English
Related papers

Related papers: Tightness for the interfaces of one-dimensional vo…

200 papers

We study the transition probability, say $p_A^n(x,y)$, of a one-dimensional random walk on the integer lattice killed when entering into a non-empty finite set $A$. The random walk is assumed to be irreducible and have zero mean and a…

Probability · Mathematics 2017-01-24 Kohei Uchiyama

We find that the probability distribution for the largest intervals $p(l)$ exhibits universal properties for different systems including random walk and random cutting models. In particular, $p(l)$ has an infinite set of singularities at…

Condensed Matter · Physics 2009-10-28 L. Frachebourg , I. Ispolatov , P. L. Krapivsky

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

Combinatorics · Mathematics 2022-11-07 Yulin Chang , Jie Han , Lubos Thoma

This paper investigates various geometrical properties of interfaces of the two-dimensional voter model. Despite its simplicity, the model exhibits dual characteristics, resembling both a critical system with long-range correlations, while…

Statistical Mechanics · Physics 2024-06-03 Claude Godrèche , Marco Picco

The \((n,k)\) game models a group of \(n\) individuals with binary opinions, say 1 and 0, where a decision is made if at least \(k\) individuals hold opinion 1. This paper explores the dynamics of the game with heterogeneous agents under…

Probability · Mathematics 2024-09-17 Hsin-Lun Li

We consider a one-dimensional nearest-neighbor interacting particle system, which is a mixture of the simple exclusion process and the voter model. The state space is taken to be the countable set of the configurations that have a finite…

Probability · Mathematics 2007-07-02 Vladimir Belitsky , Pablo A. Ferrari , Mikhail V. Menshikov , Serguei Yu. Popov

We consider the empirical measures of multi-type voter models with mutation on large finite sets, and prove their weak atomic convergence in the sense of Ethier and Kurtz (1994) toward a Fleming-Viot process. Convergence in the weak atomic…

Probability · Mathematics 2016-08-23 Yu-Ting Chen , J. Theodore Cox

In an election in which each voter ranks all of the candidates, we consider the head-to-head results between each pair of candidates and form a labeled directed graph, called the margin graph, which contains the margin of victory of each…

Theoretical Economics · Economics 2020-09-08 Matthew Harrison-Trainor

In most sociophysical simulations on public opinion, only two opinions are allowed: Pro and Contra. However, in all political elections many people do not vote. Here we analyse two models of dynamics of public opinion, taking into account…

Physics and Society · Physics 2010-05-05 Krzysztof Malarz , Krzysztof Kulakowski

We study the behavior of a generalized consensus dynamics on a temporal network of interactions, the activity driven network with attractiveness. In this temporal network model, agents are endowed with an intrinsic activity $a$, ruling the…

Physics and Society · Physics 2018-08-15 Antoine Moinet , Alain Barrat , Romualdo Pastor Satorras

The voter model is a toy model of consensus formation based on nearest-neighbor interactions. A voter sits at each vertex in a hypercubic lattice (of dimension $d$) and is in one of two possible opinion states. The opinion state of each…

Statistical Mechanics · Physics 2023-11-08 Pascal Grange

We consider some questions raised by the recent paper of Gantert, L\"owe and Steif (2005) concerning ``signed'' voter models on locally finite graphs. These are voter model like processes with the difference that the edges are considered to…

Probability · Mathematics 2007-12-13 E. Andjel , G. Maillard , T. S. Mountford

We consider the two-opinion voter model on a regular random graph with n vertices and degree $d \geq 3$. It is known that consensus is reached on time scale n and that on this time scale the volume of the set of vertices with one opinion…

In the $R$-spread out, $d$-dimensional voter model, each site $x$ of $\mathbb{Z}^d$ has state (or 'opinion') 0 or 1 and, with rate 1, updates its opinion by copying that of some site $y$ chosen uniformly at random among all sites within…

Probability · Mathematics 2017-10-03 Balázs Ráth , Daniel Valesin

We consider "bridges" for the simple exclusion process on Z, either symmetric or asymmetric, in which particles jump to the right at rate p and to the left at rate 1-p. The initial state O has all negative sites occupied and all…

Probability · Mathematics 2012-03-02 Pablo A. Ferrari , James B. Martin

Let X be a Poisson point process of intensity lambda on the real line. A thickening of it is a (deterministic) measurable function f such that the union of X and f(X) is a Poisson point process of intensity lambda' where lambda'>lambda. An…

Probability · Mathematics 2017-03-14 Ori Gurel-Gurevich , Ron Peled

The q-voter model, a variant of the classic voter model, has been analyzed by several authors: while allowing to study opinion dynamics, this model is also believed to be one of the most representative among the many defined in the wide…

Physics and Society · Physics 2015-10-26 Marco Alberto Javarone , Tiziano Squartini

We investigate numerically, using the bond-fluctuation model, the adsorption of many random AB--copolymers with excluded volume interactions at the interface between two solvents. We find two regimes, controlled by the total number of…

Soft Condensed Matter · Physics 2007-05-23 Gongwen Peng , Jens-Uwe Sommer , Alexander Blumen

Elastic interfaces display scale-invariant geometrical fluctuations at sufficiently large lengthscales. Their asymptotic static roughness then follows a power-law behavior, whose associated exponent provides a robust signature of the…

Disordered Systems and Neural Networks · Physics 2022-05-30 Nirvana Caballero , Thierry Giamarchi , Vivien Lecomte , Elisabeth Agoritsas

For a sequence p=(p(1),p(2), ...) let G(n,p) denote the random graph with vertex set {1,2, ...,n} in which two vertices i, j are adjacent with probability p(|i-j|), independently for each pair. We study how the convergence of probabilities…

Logic · Mathematics 2016-09-06 Tomasz Łuczak , Saharon Shelah