oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Conservation laws for the voter model in complex networks  [PDF]
Krzysztof Suchecki,Victor M. Eguiluz,Maxi San Miguel
Physics , 2004, DOI: 10.1209/epl/i2004-10329-8
Abstract: We consider the voter model dynamics in random networks with an arbitrary distribution of the degree of the nodes. We find that for the usual node-update dynamics the average magnetization is not conserved, while an average magnetization weighted by the degree of the node is conserved. However, for a link-update dynamics the average magnetization is still conserved. For the particular case of a Barabasi-Albert scale-free network the voter model dynamics leads to a partially ordered metastable state with a finite size survival time. This characteristic time scales linearly with system size only when the updating rule respects the conservation law of the average magnetization. This scaling identifies a universal or generic property of the voter model dynamics associated with the conservation law of the magnetization.
A generalized voter model on complex networks  [PDF]
Casey M. Schneider-Mizell,Leonard M. Sander
Physics , 2008, DOI: 10.1007/s10955-009-9757-6
Abstract: We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it difficult to disentangle the effects of the stochastic process itself relative to the network structure. We introduce a process with two steps, one that selects a pair of interacting nodes and one that determines the direction of interaction as a function of the degrees of the two nodes and a parameter $\alpha$ which sets the likelihood of the higher degree node giving its state. Traditional voter model behavior can be recovered within the model. We find that on a complete bipartite network, the traditional voter model is the fastest process. On a random network with power law degree distribution, we observe two regimes. For modest values of $\alpha$, exit time is dominated by diffusive drift of the system state, but as the high nodes become more influential, the exit time becomes becomes dominated by frustration effects. For certain selection processes, a short intermediate regime occurs where exit occurs after exponential mixing.
Generalized voter-like models on heterogeneous networks  [PDF]
Paolo Moretti,Andrea Baronchelli,Michele Starnini,Romualdo Pastor-Satorras
Computer Science , 2012,
Abstract: We describe a generalization of the voter model on complex networks that encompasses different sources of degree-related heterogeneity and that is amenable to direct analytical solution by applying the standard methods of heterogeneous mean-field theory. Our formalism allows for a compact description of previously proposed heterogeneous voter-like models, and represents a basic framework within which we can rationalize the effects of heterogeneity in voter-like models, as well as implement novel sources of heterogeneity, not previously considered in the literature.
Effect of network topology on the ordering dynamics of voter models  [PDF]
Claudio Castellano
Physics , 2005, DOI: 10.1063/1.2008600
Abstract: We introduce and study the reverse voter model, a dynamics for spin variables similar to the well-known voter dynamics. The difference is in the way neighbors influence each other: once a node is selected and one among its neighbors chosen, the neighbor is made equal to the selected node, while in the usual voter dynamics the update goes in the opposite direction. The reverse voter dynamics is studied analytically, showing that on networks with degree distribution decaying as k^{-nu}, the time to reach consensus is linear in the system size N for all nu>2. The consensus time for link-update voter dynamics is computed as well. We verify the results numerically on a class of uncorrelated scale-free graphs.
Voter Models on Heterogeneous Networks  [PDF]
V. Sood,Tibor Antal,S. Redner
Physics , 2007, DOI: 10.1103/PhysRevE.77.041121
Abstract: 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 T_N to reach consensus for a network of N nodes with an uncorrelated degree distribution scales as N mu_1^2/mu_2, where mu_k is the kth moment of the degree distribution. Quick consensus thus arises on networks with broad degree distributions. We also identify the conservation law that characterizes the route by which consensus is reached. Parallel results are derived for the invasion process, in which the state of an agent is "exported" to a random neighbor. We further generalize to biased dynamics in which one state is favored. The probability for a single fitter mutant located at a node of degree k to overspread the population--the fixation probability--is proportional to k for the voter model and to 1/k for the invasion process.
Voter Model with Arbitrary Degree Dependence: Clout, Confidence and Irreversibility  [PDF]
Babak Fotouhi,Michael G. Rabbat
Computer Science , 2013, DOI: 10.1140/epjb/e2014-41088-3
Abstract: In this paper, we consider the voter model with popularity bias. The influence of each node on its neighbors depends on its degree. We find the consensus probabilities and expected consensus times for each of the states. We also find the fixation probability, which is the probability that a single node whose state differs from every other node imposes its state on the entire system. In addition, we find the expected fixation time. Then two extensions to the model are proposed and the motivations behind them are discussed. The first one is confidence, where in addition to the states of neighbors, nodes take their own state into account at each update. We repeat the calculations for the augmented model and investigate the effects of adding confidence to the model. The second proposed extension is irreversibility, where one of the states is given the property that once nodes adopt it, they cannot switch back. The dynamics of densities, fixation times and consensus times are obtained.
Mapping the $q$-voter model: From a single chain to complex networks  [PDF]
Arkadiusz J?drzejewski,Katarzyna Sznajd-Weron,Janusz Szwabiński
Physics , 2015,
Abstract: We propose and compare six different ways of mapping the modified $q$-voter model to complex networks. Considering square lattices, Barab\'asi-Albert, Watts-Strogatz and real Twitter networks, we ask the question if always a particular choice of the group of influence of a fixed size $q$ leads to different behavior at the macroscopic level. Using Monte Carlo simulations we show that the answer depends on the relative average path length of the network and for real-life topologies the differences between the considered mappings may be negligible.
How does degree heterogeneity affect an order-disorder transition?  [PDF]
R. Lambiotte
Physics , 2007, DOI: 10.1209/0295-5075/78/68002
Abstract: We focus on the role played by the node degree distribution on the way collective phenomena emerge on complex networks. To address this question, we focus analytically on a typical model for cooperative behaviour, the Majority Rule, applied to dichotomous networks. The latter are composed of two kinds of nodes, each kind $i$ being characterized by a degree $k_i$. Dichotomous networks are therefore a simple instance of heterogeneous networks, especially adapted in order to reveal the effect of degree heterogeneity. Our main result are that degree heterogeneity affects the location of the order-disorder transition and that the system exhibits non-equipartition of the average opinion between the two kinds of nodes. This effect is observed in the ordered phase and in the disordered phase.
Voter Model on Heterogeneous Graphs  [PDF]
V. Sood,S. Redner
Physics , 2004, DOI: 10.1103/PhysRevLett.94.178701
Abstract: We study the voter dynamics model on heterogeneous graphs. We exploit the non-conservation of the magnetization to characterize how consensus is reached on networks with different connectivity patterns. For a network of N sites with an arbitrary degree distribution, we show that the mean time to reach consensus T_N scales as N mu_1^2/mu_2, where mu_k is the kth moment of the degree distribution. For a power-law degree distribution n_k k^{-nu}, we thus find that T_N scales as N for nu>3, as N/ln N for nu=3, as N^{(2nu-4)/(nu-1)} for 2
Heterogeneous pair approximation for voter models on networks  [PDF]
Emanuele Pugliese,Claudio Castellano
Physics , 2009, DOI: 10.1209/0295-5075/88/58004
Abstract: 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 exact description of the dynamics, correcting some inaccurate results of previous approaches. The heterogeneous pair approximation introduced here can be applied in full generality to many other processes on complex networks.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.