IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v109y2015icp186-196.html
   My bibliography  Save this article

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

Author

Listed:
  • Reppas, Andreas I.
  • Spiliotis, Konstantinos
  • Siettos, Constantinos I.

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.

Suggested Citation

  • Reppas, Andreas I. & Spiliotis, Konstantinos & Siettos, Constantinos I., 2015. "Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 109(C), pages 186-196.
  • Handle: RePEc:eee:matcom:v:109:y:2015:i:c:p:186-196
    DOI: 10.1016/j.matcom.2014.09.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475414002456
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2014.09.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Hughes, R.L., 2000. "The flow of large crowds of pedestrians," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 53(4), pages 367-370.
    2. Dirk Helbing & Illés Farkas & Tamás Vicsek, 2000. "Simulating dynamical features of escape panic," Nature, Nature, vol. 407(6803), pages 487-490, September.
    3. M. E. J. Newman & D. J. Watts, 1999. "Renormalization Group Analysis of the Small-World Network Model," Working Papers 99-04-029, Santa Fe Institute.
    4. Guo, Qiang & Zhou, Tao & Liu, Jian-Guo & Bai, Wen-Jie & Wang, Bing-Hong & Zhao, Ming, 2006. "Growing scale-free small-world networks with tunable assortative coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 814-822.
    5. Mei, Shan & Sloot, P.M.A. & Quax, Rick & Zhu, Yifan & Wang, Weiping, 2010. "Complex agent networks explaining the HIV epidemic among homosexual men in Amsterdam," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(5), pages 1018-1030.
    6. Ianni, A. & Corradi, V., 2001. "The dynamics of public opinion under majority rules," Discussion Paper Series In Economics And Econometrics 0109, Economics Division, School of Social Sciences, University of Southampton.
    7. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 1999. "Mean-field theory for scale-free random networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 272(1), pages 173-187.
    8. Parisi, D.R. & Dorso, C.O., 2005. "Microscopic dynamics of pedestrian evacuation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 354(C), pages 606-618.
    9. Jorge M Pacheco & Flávio L Pinheiro & Francisco C Santos, 2009. "Population Structure Induces a Symmetry Breaking Favoring the Emergence of Cooperation," PLOS Computational Biology, Public Library of Science, vol. 5(12), pages 1-7, December.
    10. Leary, C.C. & Schwehm, M. & Eichner, M. & Duerr, H.P., 2007. "Tuning degree distributions: Departing from scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 382(2), pages 731-738.
    11. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    12. D. S. Callaway & J. E. Hopcroft & J. M. Kleinberg & M. E. J. Newman & S. H. Strogatz, 2001. "Are Randomly Grown Graphs Really Random?," Working Papers 01-05-025, Santa Fe Institute.
    13. Ianni, A. & Corradi, V., 2001. "The dynamics of public opinion under majority rules," Discussion Paper Series In Economics And Econometrics 109, Economics Division, School of Social Sciences, University of Southampton.
    14. Tessone, Claudio J. & Toral, Raúl, 2005. "System size stochastic resonance in a model for opinion formation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 351(1), pages 106-116.
    15. Jennifer Badham & Rob Stocker, 2010. "A Spatial Approach to Network Generation for Three Properties: Degree Distribution, Clustering Coefficient and Degree Assortativity," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 13(1), pages 1-11.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lucas Cuadra & Sancho Salcedo-Sanz & Javier Del Ser & Silvia Jiménez-Fernández & Zong Woo Geem, 2015. "A Critical Review of Robustness in Power Grids Using Complex Networks Concepts," Energies, MDPI, vol. 8(9), pages 1-55, August.
    2. Chung-Yuan Huang & Chuen-Tsai Sun & Hsun-Cheng Lin, 2005. "Influence of Local Information on Social Simulations in Small-World Network Models," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 8(4), pages 1-8.
    3. Zheng, Xiaoping & Cheng, Yuan, 2011. "Conflict game in evacuation process: A study combining Cellular Automata model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1042-1050.
    4. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    5. L. Jarina Banu & P. Balasubramaniam, 2014. "Synchronisation of discrete-time complex networks with randomly occurring uncertainties, nonlinearities and time-delays," International Journal of Systems Science, Taylor & Francis Journals, vol. 45(7), pages 1427-1450, July.
    6. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    7. Zheng, Xiaoping & Li, Wei & Guan, Chao, 2010. "Simulation of evacuation processes in a square with a partition wall using a cellular automaton model for pedestrian dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(11), pages 2177-2188.
    8. Sticco, I.M. & Frank, G.A. & Cerrotta, S. & Dorso, C.O., 2017. "Room evacuation through two contiguous exits," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 474(C), pages 172-185.
    9. Santiago, A. & Benito, R.M., 2008. "Connectivity degrees in the threshold preferential attachment model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(10), pages 2365-2376.
    10. Chen, Qinghua & Chen, Shenghui, 2007. "A highly clustered scale-free network evolved by random walking," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 383(2), pages 773-781.
    11. Wang, Lei & Zhang, Qian & Cai, Yun & Zhang, Jianlin & Ma, Qingguo, 2013. "Simulation study of pedestrian flow in a station hall during the Spring Festival travel rush," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(10), pages 2470-2478.
    12. Johansson, Fredrik & Peterson, Anders & Tapani, Andreas, 2015. "Waiting pedestrians in the social force model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 419(C), pages 95-107.
    13. Chen, Chang-Kun & Li, Jian & Zhang, Dong, 2012. "Study on evacuation behaviors at a T-shaped intersection by a force-driving cellular automata model," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(7), pages 2408-2420.
    14. Zhang, Yijing & Lu, Linjun & Liu, Qiujia & Hu, Miaoqing, 2023. "Modeling of low-risk behavior of pedestrian movement based on dynamic data analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 168(C).
    15. Zhao, Yongxiang & Li, Meifang & Lu, Xin & Tian, Lijun & Yu, Zhiyong & Huang, Kai & Wang, Yana & Li, Ting, 2017. "Optimal layout design of obstacles for panic evacuation using differential evolution," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 175-194.
    16. Ying Duan & Xiuwen Fu & Wenfeng Li & Yu Zhang & Giancarlo Fortino, 2017. "Evolution of Scale-Free Wireless Sensor Networks with Feature of Small-World Networks," Complexity, Hindawi, vol. 2017, pages 1-15, July.
    17. Danhao Zhu & Dongbo Wang & Saeed-Ul Hassan & Peter Haddawy, 2013. "Small-world phenomenon of keywords network based on complex network," Scientometrics, Springer;Akadémiai Kiadó, vol. 97(2), pages 435-442, November.
    18. Fu, Zhijian & Zhou, Xiaodong & Zhu, Kongjin & Chen, Yanqiu & Zhuang, Yifan & Hu, Yuqi & Yang, Lizhong & Chen, Changkun & Li, Jian, 2015. "A floor field cellular automaton for crowd evacuation considering different walking abilities," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 420(C), pages 294-303.
    19. Frank, G.A. & Dorso, C.O., 2011. "Room evacuation in the presence of an obstacle," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(11), pages 2135-2145.
    20. Ikeda, N., 2007. "Network formed by traces of random walks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 379(2), pages 701-713.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:109:y:2015:i:c:p:186-196. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.