A ug 2 01 4 Networks maximizing the consensus time of voter models
نویسنده
چکیده
Yuni Iwamasa and Naoki Masuda 3, 4, ∗ Faculty of Engineering, The University of Tokyo, 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan Department of Mathematical Informatics, The University of Tokyo, 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan Department of Engineering Mathematics, University of Bristol, Merchant Venturers Building, Woodland Road, Clifton, Bristol BS8 1UB, United Kingdom CREST, JST, 4-1-8, Honcho, Kawaguchi, Saitama 332-0012, Japan (Dated: August 5, 2014)
منابع مشابه
s . so c - ph ] 1 7 A pr 2 01 3 Consensus time and conformity in the adaptive voter model
The adaptive voter model is a paradigmatic model in the study of opinion formation. Here we propose an extension for this model, in which conflicts are resolved by obtaining another opinion, and analytically study the time required for consensus to emerge. Our results shed light on the rich phenomenology of both the original and extended adaptive voter models, including a dynamical phase transi...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Networks Maximising the Consensus Time of Voter Models
We explore the networks that yield the largest mean consensus time of voter models under different update rules. By analytical and numerical means, we show that the so-called lollipop graph, barbell graph, and double star graph maximise the mean consensus time under the update rules called the link dynamics, voter model, and invasion process, respectively. For each update rule, the largest mean...
متن کاملNetworks maximising the consensus time of voter models
We explore the networks that yield the largest mean consensus time of voter models under different update rules. By analytical and numerical means, we show that the so-called lollipop graph, barbell graph, and double-star graph maximize the mean consensus time under the update rules called the link dynamics, voter model, and invasion process, respectively. For each update rule, the largest mean...
متن کاملHeterogeneous pair approximation for voter models on networks
For models whose evolution takes place on a network it is often necessary to augment the mean-field approach by considering explicitly the degree dependence of average quantities (heterogeneous mean-field). Here we introduce the degree dependence in the pair approximation (heterogeneous pair approximation) for analyzing voter models on uncorrelated networks. This approach gives an essentially e...
متن کاملVoter models on heterogeneous networks.
We study simple interacting particle systems on heterogeneous networks, including the voter model and the invasion process. These are both two-state models in which in an update event an individual changes state to agree with a neighbor. For the voter model, an individual "imports" its state from a randomly chosen neighbor. Here the average time TN to reach consensus for a network of N nodes wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014