How networks split when rival leaders emerge

Malgorzata J. Krawczyk and Krzysztof Kułakowski

Physica A: Statistical Mechanics and its Applications, 2018, vol. 492, issue C, 2249-2259

Abstract: In a model social network, two hubs are appointed as leaders. Consecutive cutting of links on a shortest path between them splits the network in two. Next, the network is growing again till the initial size. Both processes are cyclically repeated. We investigate the size of a cluster containing the largest hub, the degree, the clustering coefficient, the closeness centrality and the betweenness centrality of the largest hub, as dependent on the number of cycles. The results are interpreted in terms of the leader’s benefits from conflicts.

Keywords: Social networks; Network topology; Time evolution; Conflict (search for similar items in EconPapers)
Date: 2018
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S037843711731186X
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:492:y:2018:i:c:p:2249-2259

DOI: 10.1016/j.physa.2017.11.139

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().