Search arXivSearch

arXiv · 1107.4413

Consensus in the two-state Axelrod model

Abstract

The Axelrod model is a spatial stochastic model for the dynamics of cultures which, similarly to the voter model, includes social influence, but differs from the latter by also accounting for another social factor called homophily, the tendency to interact more frequently with individuals who are more similar. Each individual is characterized by its opinions about a finite number of cultural features, each of which can assume the same finite number of states. Pairs of adjacent individuals interact at a rate equal to the fraction of features they have in common, thus modeling homophily, which results in the interacting pair having one more cultural feature in common, thus modeling social influence. It has been conjectured based on numerical simulations that the one-dimensional Axelrod model clusters when the number of features exceeds the number of states per feature. In this article, we prove this conjecture for the two-state model with an arbitrary number of features.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Lanchier, Jason Schweinsberg. 2011-07-22. Consensus in the two-state Axelrod model. https://arxiv.org/abs/1107.4413

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