IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v495y2018icp152-161.html
   My bibliography  Save this article

Dynamical and topological aspects of consensus formation in complex networks

Author

Listed:
  • Chacoma, A.
  • Mato, G.
  • Kuperman, M.N.

Abstract

The present work analyzes a particular scenario of consensus formation, where the individuals navigate across an underlying network defining the topology of the walks. The consensus, associated to a given opinion coded as a simple message, is generated by interactions during the agent’s walk and manifest itself in the collapse of the various opinions into a single one. We analyze how the topology of the underlying networks and the rules of interaction between the agents promote or inhibit the emergence of this consensus. We find that non-linear interaction rules are required to form consensus and that consensus is more easily achieved in networks whose degree distribution is narrower.

Suggested Citation

  • Chacoma, A. & Mato, G. & Kuperman, M.N., 2018. "Dynamical and topological aspects of consensus formation in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 495(C), pages 152-161.
    • Handle: RePEc:eee:phsmap:v:495:y:2018:i:c:p:152-161
    DOI: 10.1016/j.physa.2017.12.071
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437117313201
    Download Restriction: 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
    File URL: https://libkey.io/10.1016/j.physa.2017.12.071?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wu, Liuyi & Dong, Lijun & Wang, Yi & Zhang, Feng & Lee, Victor E. & Kang, Xiaojun & Liang, Qingzhong, 2018. "Uniform-scale assessment of role minimization in bipartite networks and its application to access control," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 507(C), pages 381-397.
    2. Lopez-Pina, A. & Losada, J.C. & Benito, R.M., 2019. "Competition games between teams vying for common resources under consensus dynamics on networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 534(C).

    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:phsmap:v:495:y:2018:i:c:p:152-161. 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.

    We have no bibliographic references for this item. You can help adding them by using 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/physica-a-statistical-mechpplications/ .

    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.