A Variant Voter Model in Assortative Networks 在同配网络上的一个改进投票模型的研究 潘黎明 荣智海 王直杰 Donghua University October 2010 Presented in CCCN2010, Suzhou.

Slides:



Advertisements
Similar presentations
Peer-to-Peer and Social Networks Power law graphs Small world graphs.
Advertisements

Albert-László Barabási
Network biology Wang Jie Shanghai Institutes of Biological Sciences.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Traffic-driven model of the World-Wide-Web Graph A. Barrat, LPT, Orsay, France M. Barthélemy, CEA, France A. Vespignani, LPT, Orsay, France.
Analysis and Modeling of Social Networks Foudalis Ilias.
NSPCS 2012 (KIAS, Seoul, 3 Jul ~ 6 July) Cooperative hierarchical structures emerging in multiadaptive games & Petter Holme (Umeå University, SungKyunKwan.
Time-dependent picture for trapping of an anomalous massive system into a metastable well Jing-Dong Bao Department of Physics, Beijing.
School of Information University of Michigan Network resilience Lecture 20.
Advanced Topics in Data Mining Special focus: Social Networks.
Structural Inference of Hierarchies in Networks BY Yu Shuzhi 27, Mar 2014.
Identity and search in social networks Presented by Pooja Deodhar Duncan J. Watts, Peter Sheridan Dodds and M. E. J. Newman.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
School of Information University of Michigan SI 614 Random graphs & power law networks preferential attachment Lecture 7 Instructor: Lada Adamic.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Network growth under the constraint of synchronization stability Xingang Wang Department of Physics, ZJU Oct. 17, 2010, Suzhou.
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Mining and Searching Massive Graphs (Networks)
Networks FIAS Summer School 6th August 2008 Complex Networks 1.
Comparison of Online Social Relations in terms of Volume vs. Interaction: A Case Study of Cyworld Hyunwoo Chun+ Haewoon Kwak+ Young-Ho Eom* Yong-Yeol Ahn#
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Financial Networks with Static and dynamic thresholds Tian Qiu Nanchang Hangkong University.
Physical Mechanism Underlying Opinion Spreading Jia Shao Advisor: H. Eugene Stanley J. Shao, S. Havlin, and H. E. Stanley, Phys. Rev. Lett. 103,
Global topological properties of biological networks.
Physical Mechanism Underlying Opinion Spreading
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Conference title 1 A Few Bad Apples Are Enough. An Agent-Based Peer Review Game. Juan Bautista Cabotà, Francisco Grimaldo (U. València) Lorena Cadavid.
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Complex networks A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, Orsay, France) M. Barthélemy (CEA, France) L. Dall’Asta (LPT, Orsay,
Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks.
Traffic Dynamics on Networks Tao Zhou Department of Modern Physics, University of Science and Technology of China Department of Physics, University of.
Author: M.E.J. Newman Presenter: Guoliang Liu Date:5/4/2012.
Claudio Castellano CNR-INFM Statistical Mechanics and Complexity and
Network Economics: two examples Marc Lelarge (INRIA-ENS) SIGMETRICS, London June 14, 2012.
“The Geography of the Internet Infrastructure: A simulation approach based on the Barabasi-Albert model” Sandra Vinciguerra and Keon Frenken URU – Utrecht.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Using Graph Theory to Study Neural Networks (Watrous, Tandon, Conner, Pieters & Ekstrom, 2012)
Shi Zhou University College London Second-order mixing in networks Shi Zhou University College London.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Soon-Hyung Yook, Sungmin Lee, Yup Kim Kyung Hee University NSPCS 08 Unified centrality measure of complex networks: a dynamical approach to a topological.
Robustness of complex networks with the local protection strategy against cascading failures Jianwei Wang Adviser: Frank,Yeong-Sung Lin Present by Wayne.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Dynamics of Malicious Software in the Internet
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Class 9: Barabasi-Albert Model-Part I
Percolation and diffusion in network models Shai Carmi, Department of Physics, Bar-Ilan University Networks Percolation Diffusion Background picture: The.
Spontaneous Formation of Dynamical Groups in an Adaptive Networked System Li Menghui, Guan Shuguang, Lai Choy-Heng Temasek Laboratories National University.
Class 19: Degree Correlations PartII Assortativity and hierarchy
Introduction to complex networks Part I: Structure
Social Networking: Large scale Networks
Simulating the Social Processes of Science Leiden| 9 April 2014 INGENIO [CSIC-UPV] Ciudad Politécnica de la Innovación | Edif 8E 4º Camino de Vera s/n.
Community structure in graphs Santo Fortunato. More links “inside” than “outside” Graphs are “sparse” “Communities”
Cascading failures of loads in interconnected networks under intentional attack Yongxiang Xia Department of Information Science and Electronic Engineering.
Scaling mobility patterns and collective movements: deterministic walks in lattice Han Xiao-Pu Zhou Tao Wang Bing-Hong University of Science and Technology.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Non-Markovian Character in Human Mobility: Online and Offline 报告人:蔡世民 合作者:赵志丹,卢扬.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Network (graph) Models
Random Walk for Similarity Testing in Complex Networks
Uncovering the Mystery of Trust in An Online Social Network
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Universal Power Exponent in Network Models of Thin Film Growth
Department of Computer Science University of York
Modelling Structure and Function in Complex Networks
OPINIONS DYNAMICS WITH RELATIVE AGREEMENT
Network topology. Network topology. Nodes are linked by edges. Node size represents a quantifiable node property (e.g. fold-change in two different experimental.
Presentation transcript:

A Variant Voter Model in Assortative Networks 在同配网络上的一个改进投票模型的研究 潘黎明 荣智海 王直杰 Donghua University October 2010 Presented in CCCN2010, Suzhou

Contents Review of the Voter Models Voter Model Invasion Process Link Dynamics Introduction to a variant voter model Degree correlations The variant voter model in assortative networks Conclusions

Review of the Voter models The origin voter model (VM): (i) randomly pick a node; (ii) the node adopts the state of a random neighbor. The invasion process (IP): (i) pick a random node; (ii) the node exports its state to a random neighbor. link dynamics (LD) (i) pick a random link; (ii) one of the nodes on the link, adopts the state of the other end node. V. Sood, T. Antal, and S. Redner, Phys. Rev. E 77, (2008) T. M. Liggett, Interacting Particle Systems, (Springer-Verlag, Berlin, 2005). P. L. Krapivsky, Phys. Rev. A 45, 1067 (1992). C. Castellano, AIP Conference Proceedings 779, ).

Review of the Voter models In uncorrelated networks, consider all the nodes of like degree to be indistinguishable, the probability of node i adopts node j’s opinion is: (C. M. Schneider-Mizell and L. M. Sander, J. Stat. Phys. 136, 59 (2009) ) VM: LD: IP: n i,n j : the fraction of nodes with degree i and j k i,k j : the degree of node i j μ1: the average degree

Review of the Voter models In uncorrelated networks, consider all the nodes of like degree to be indistinguishable, the probability of node i adopts node j’s opinion is: (C. M. Schneider-Mizell and L. M. Sander, J. Stat. Phys. 136, 59 (2009) ) VM: LD: IP: n i,n j : the fraction of nodes with degree i and j k i,k j : the degree of node i j μ1: the average degree The differences seems to be trivial, but they are fundamental.

Discussion of a Variant Voter Model A variant of the voter model with respect to the heterogeneous influence of individuals. The nodes update their state in the following two steps: (i) Select a pair of nodes using node selection (ii) The pair of nodes choose of the opinions as their common opinion. The probability of choosing i’s opinion as the common opinion is Han-Xin Yang, Zhi-Xi Wu, Changsong Zhou, Tao Zhou and Bing-Hong Wang Phys. Rev. E 80, (2009)

Discussion of a Variant Voter Model On uncorrelated networks, the probability of node i adopting node j’s opinion is: When the parameter α=1, The model reduces to the origin voter model

Consensus time as a function of the parameter α for different G Han-Xin Yang, Zhi-Xi Wu, Changsong Zhou, Tao Zhou and Bing- Hong Wang Phys. Rev. E 80, (2009) A.-L. Barabasi and R. Albert, Science 286, 509 (1999).

Degree-mixing patterns Many networks show ‘‘assortative mixing’’ on their degrees, i.e., a preference for high degree vertices to attach to other high-degree vertices. Whereas, others show disassortative mixing: high-degree vertices attach to low-degree ones. Most social networks have assortative mixing, while technological and biological networks are disassortative. M. E. J. Newman, Phys. Rev. Lett. 89,208701,2002;

The variant voter model in assortative scale-free networks Simulations in assortative scale-free networks with N=5000, and G=2 Maslov, S. and Sneppen, K. (2002). Science,296, R. Xulvi-Brunet and I. M. Sokolov, Phys. Rev. E 70, (2004)

Discussion of the situation when α=0 Comparison of the α =0 situation and the link dynamics LD: Symmetric random walks on integers. α =0: When an active link is selected, the probability for increasing or decreasing the 1 nodes are the same for networks of different degree-mixing coefficients, but the probability of selecting an active link are different.

A plausible explanation for α=0

Average degree of the final common opinion during the time process when α=4.(G=2)

The consensus time T c when G=5000 when

The number of opinion clusters during the time process when G=5000

The fraction of the final common opinion for different degree regions Node selection

The fraction of the final common opinion for different degree regions Link Selection

Conclusions We studied a variant of the voter model on assortative scale-free networks. We find that under node selection, the assortative degree mixing will resulting faster convergence speed due to that the opinion clusters around high-degree individuals will easier to vanish. The slight difference of the way selecting a pair of nodes will change the dynamical behavior dramatically. When using the link selection, assortative-degree mixing will inhibit the consensus for some region of the parameter alpha. Further study is in progress.

Thank you very much!