Journal
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL
Volume 43, Issue 38, Pages -Publisher
IOP Publishing Ltd
DOI: 10.1088/1751-8113/43/38/385003
Keywords
-
Categories
Funding
- RCUK
Ask authors/readers for more resources
We study the voter model and related random copying processes on arbitrarily complex network structures. Through a representation of the dynamics as a particle reaction process, we show that a quantity measuring the degree of order in a finite system is, under certain conditions, exactly governed by a universal diffusion equation. Whenever this reduction occurs, the details of the network structure and random copying process affect only a single parameter in the diffusion equation. The validity of the reduction can be established with considerably less information than one might expect: it suffices to know just two characteristic timescales within the dynamics of a single pair of reacting particles. We develop methods to identify these timescales and apply them to deterministic and random network structures. We focus in particular on how the ordering time is affected by degree correlations, since such effects are difficult to access by existing theoretical approaches.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available