SearcharxivSearch

arXiv · 2406.03037

The Phase Transition of the Voter Model on Evolving Scale-Free Networks

Abstract

The voter model is a classical interacting particle system explaining consensus formation on a social network. Real social networks feature not only a heterogeneous degree distribution but also connections changing over time. We study the voter model on a rank one scale-free network evolving in time by each vertex \emph{updating} (refreshing its edge neighbourhood) at any rate $\kappa=\kappa(N)$. We find the dynamic giant component phase transition in the consensus time of the voter model: when $\kappa\ll \tfrac{1}{N}$, the subcritical graph parameters are slower by a factor of $\tfrac{N}{\log N}$. Conversely, when $\kappa \gg 1$ the effect of the giant is removed completely and so for either graph parameter case we see consensus time on the same order as in the static supercritical case (up to polylogarithmic corrections). The intermediate dynamic speeds produce consensus time for subcritical network parameters longer not by the previous factor $\tfrac{N}{\log N}$, but by the factor $\tfrac{1}{\kappa}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Fernley. 2024-06-05. The Phase Transition of the Voter Model on Evolving Scale-Free Networks. https://arxiv.org/abs/2406.03037

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR