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

DOI10.1016/j.matcom.2014.09.005OpenAlexW1996656121MaRDI QIDQ2228595

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

Publication date: 19 February 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.2290

zbMATH Keywords

Monte Carlo simulationscomplex networksaverage path lengthmajority-rule modelprescribed network characteristics

Mathematics Subject Classification ID

Computer science (68-XX) Combinatorics (05-XX)

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Generation of networks with prescribed degree-dependent clustering
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
• Ergodic theorems for weakly interacting infinite systems and the voter model
• Renormalization group analysis of the small-world network model
• The dynamics of public opinion under majority rules
• Complex agent networks explaining the HIV epidemic among homosexual men in Amsterdam
• Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level analysis
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks
• A model for spatial conflict
• Equation of State Calculations by Fast Computing Machines
• MULTISCALE COMPUTATIONS ON NEURAL NETWORKS: FROM THE INDIVIDUAL NEURON INTERACTIONS TO THE MACROSCOPIC-LEVEL ANALYSIS
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks