Next Article in Journal
Universal Target Learning: An Efficient and Effective Technique for Semi-Naive Bayesian Learning
Next Article in Special Issue
Service-Oriented Model Encapsulation and Selection Method for Complex System Simulation Based on Cloud Architecture
Previous Article in Journal
Investigation of Linear and Nonlinear Properties of a Heartbeat Time Series Using Multiscale Rényi Entropy
Previous Article in Special Issue
A SOM-Based Membrane Optimization Algorithm for Community Detection
Open AccessArticle

Minimum Memory-Based Sign Adjustment in Signed Social Networks

by 1,†, 1,*,† and 2
1
College of Systems Engineering, National University of Defense Technology, Changsha 410073, China
2
School of Economic and Management, Changsha University, Changsha 410022, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Entropy 2019, 21(8), 728; https://doi.org/10.3390/e21080728
Received: 11 June 2019 / Revised: 20 July 2019 / Accepted: 24 July 2019 / Published: 25 July 2019
(This article belongs to the Special Issue Computation in Complex Networks)
In social networks comprised of positive (P) and negative (N) symmetric relations, individuals (nodes) will, under the stress of structural balance, alter their relations (links or edges) with their neighbours, either from positive to negative or vice versa. In the real world, individuals can only observe the influence of their adjustments upon the local balance of the network and take this into account when adjusting their relationships. Sometime, their local adjustments may only respond to their immediate neighbourhoods, or centre upon the most important neighbour. To study whether limited memory affects the convergence of signed social networks, we introduce a signed social network model, propose random and minimum memory-based sign adjustment rules, and analyze and compare the impacts of an initial ratio of positive links, rewire probability, network size, neighbor number, and randomness upon structural balance under these rules. The results show that, with an increase of the rewiring probability of the generated network and neighbour number, it is more likely for the networks to globally balance under the minimum memory-based adjustment. While the Newmann-Watts small world model (NW) network becomes dense, the counter-intuitive phenomena emerges that the network will be driven to a global balance, even under the minimum memory-based local sign adjustment, no matter the network size and initial ratio of positive links. This can help to manage and control huge networks with imited resources. View Full-Text
Keywords: structural balance; minimum memory based sign adjustment; social networks; NW network; convergence structural balance; minimum memory based sign adjustment; social networks; NW network; convergence
Show Figures

Figure 1

MDPI and ACS Style

Qi, M.; Deng, H.; Li, Y. Minimum Memory-Based Sign Adjustment in Signed Social Networks. Entropy 2019, 21, 728.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map

1
Back to TopTop