Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model

Andreas I. Reppas, Konstantinos Spiliotis and Constantinos I. Siettos

Mathematics and Computers in Simulation (MATCOM), 2015, vol. 109, issue C, 186-196

Abstract: We show how appropriate rewiring with the aid of Metropolis Monte Carlo computational experiments can be exploited to create network topologies possessing prescribed values of the average path length (APL) while keeping the same connectivity degree and clustering coefficient distributions. Using the proposed rewiring rules, we illustrate how the emergent dynamics of the celebrated majority-rule model are shaped by the distinct impact of the APL attesting the need for developing efficient algorithms for tuning such network characteristics.

Keywords: Complex networks; Average path length; Prescribed network characteristics; Monte Carlo simulations; Majority-rule model (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475414002456
Full text for ScienceDirect subscribers only

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:matcom:v:109:y:2015:i:c:p:186-196

DOI: 10.1016/j.matcom.2014.09.005

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().