IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v24y2013i08ns0129183113500496.html
   My bibliography  Save this article

Bounded Confidence Model In Complex Networks

Author

Listed:
  • K. FELIJAKOWSKI

    (Faculty of Physics, Warsaw University of Technology, Koszykowa 75, Warsaw 00-662, Poland)

  • R. KOSINSKI

    (Faculty of Physics, Warsaw University of Technology, Koszykowa 75, Warsaw 00-662, Poland;
    Central Institute of Labor Protection – National, Research Institute, Czerniakowska 16, Warsaw 00-701, Poland)

Abstract

This paper presents a study of the bounded confidence model applied to the complex networks. Two different cases were examined: opinion formation process in the Barabási–Albert network and corruption spreading in a hierarchical network. For both cases, the value of the bounded confidence parameter ε was assumed as a constant, or its value was dependent on the degree of a node in the network. To measure the opinion formation and corruption spreading processes, we introduced the order parameter related to the number of interfaces in the system. As a results of numerical simulations, the influence of the values of ε on the final opinions in the population, as well as, the influence of an initial source of corruption in the company structure on the corruption spreading process, were obtained and discussed.

Suggested Citation

  • K. Felijakowski & R. Kosinski, 2013. "Bounded Confidence Model In Complex Networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 24(08), pages 1-12.
    • Handle: RePEc:wsi:ijmpcx:v:24:y:2013:i:08:n:s0129183113500496
    DOI: 10.1142/S0129183113500496
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183113500496
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183113500496?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.

    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:wsi:ijmpcx:v:24:y:2013:i:08:n:s0129183113500496. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.