OPINION DYNAMICS APPROACH FOR IDENTIFYING COMMUNITY STRUCTURES IN COMPLEX NETWORKS

Title
OPINION DYNAMICS APPROACH FOR IDENTIFYING COMMUNITY STRUCTURES IN COMPLEX NETWORKS
Author(s)
신재균
Keywords
ALGORITHM; PHYSICS
Issue Date
201411
Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
Citation
ADVANCES IN COMPLEX SYSTEMS, v.17, no.6
Abstract
This paper suggests an opinion dynamics approach to define community structures in complex networks. If a typical opinion dynamics model is applied to a network with a community structure, the network can separate in two groups of nodes. Such bisection in a given network can arise in many different ways depending on the initial conditions. The opinion distance between two nodes is defined as the probability of disagreement, or the probability that the two nodes belong to different bisections in multiple Monte Carlo simulations. The communities can be defined in terms of the distance. Closer nodes belong to the same community. Three opinion dynamics models were tested to show how the method works. Through various example networks, it was shown that the distance data can be used as a unique metric for identifying hierarchical structures and overlapping nodes in networks, as well as for identifying the community structure itself.
URI
http://hdl.handle.net/YU.REPOSITORY/30466http://dx.doi.org/10.1142/S0219525914500234
ISSN
0219-5259
Appears in Collections:
공과대학 > 기계공학부 > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE