Related papers: Tightness for the interfaces of one-dimensional vo…
We study an adaptive network model driven by a nonlinear voter dynamics. Each node in the network represents a voter and can be in one of two states that correspond to different opinions shared by the voters. A voter disagreeing with its…
Fairness in multiwinner elections, a growing line of research in computational social choice, primarily concerns the use of constraints to ensure fairness. Recent work proposed a model to find a diverse \emph{and} representative committee…
We base ourselves on the construction of the two-dimensional random interlacements [12] to define the one-dimensional version of the process. For this constructions we consider simple random walks conditioned on never hitting the origin,…
We study the lattice random walk dynamics in a heterogeneous space of two media separated by an interface and having different diffusivity and bias. Depending on the position of the interface, there exist two exclusive ways to model the…
We consider first-passage percolation on the two-dimensional integer lattice Z^2 with passage times that are IID exponentials of mean one. It has been conjectured, based on numerical evidence, that the variance of the time T(0,n) to reach…
In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of lattice, we derive an explicit expression for the…
We consider three-dimensional statistical systems at phase coexistence in the half-volume with boundary conditions leading to the presence of an interface. Working slightly below the critical temperature, where universal properties emerge,…
We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
We study the dynamics of the voter and Moran processes running on top of complex network substrates where each edge has a weight depending on the degree of the nodes it connects. For each elementary dynamical step the first node is chosen…
Most work on manipulation assumes that all preferences are known to the manipulators. However, in many settings elections are open and sequential, and manipulators may know the already cast votes but may not know the future votes. We…
We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…
This paper proposes normative criteria for voting rules under uncertainty about individual preferences. The criteria emphasize the importance of responsiveness, i.e., the probability that the social outcome coincides with the realized…
Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker visited twice or more. This simple model has…
We prove two lower bounds for stopping times of sequential tests between general composite nulls and alternatives. The first lower bound is for the setting where the type-1 error level $\alpha$ approaches zero, and equals $\log(1/\alpha)$…
We analyze intermittence and roughening of an elastic interface or domain wall pinned in a periodic potential, in the presence of random-bond disorder in (1+1) and (2+1) dimensions. Though the ensemble average behavior is smooth, the…
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.…
We consider interacting urns on a finite directed network, where both sampling and reinforcement processes depend on the nodes of the network. This extends previous research by incorporating node-dependent sampling and reinforcement. We…
We consider a one dimensional interacting particle system which describes the effective interface dynamics of the two dimensional Toom model at low temperature and noise. We prove a number of basic properties of this model. First we…
We investigate the role of contrarians in a recently proposed weighted-influence variant of the $q$-voter model. In this framework, non-unanimous influence groups affect the focal agent through weighted contributions governed by a bias…