Related papers: On some threshold-one attractive interacting parti…
We study bootstrap percolation with the threshold parameter $\theta \geq 2$ and the initial probability $p$ on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of…
We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…
The study of the number of collisions in a Poisson-Dirichlet coalescent leads to the analysis of the following version of a stochastic leader-elec\-tion algorithm. Consider an infinite family of persons, labeled by $1,2,3,\ldots$, who…
We investigate space-time trade-offs for population protocols in sparse interaction graphs. In complete interaction graphs, optimal space-time trade-offs are known for the leader election and exact majority problems. However, it has…
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…
A simple object (one point in $m$-dimensional space) is the resultant of the evolving matrix polynomial of walks in the irreducible aperiodic network structure of the first order DeGroot (weighted averaging) state-space process. This paper…
A little over 25 years ago Pemantle pioneered the study of the contact process on trees, and showed that the critical values $\lambda_1$ and $\lambda_2$ for global and local survival were different. Here, we will consider the case of trees…
A scheme is proposed to entangle two systems that have not interacted by using an ancillary particle in a Mach-Zehnder interferometer, by making a suitable post--selection of the particle followed by a conditional feedback on one of the…
We propose a family of models to study the evolution of ties in a network of interacting agents by reinforcement and penalization of their connections according to certain local laws of interaction. The family of stochastic dynamical…
The last decade has shed some light on theoretical properties such as their consistency for regression tasks. In the current paper, we propose a new class of very simple learners based on so-called naive trees. These naive trees partition…
Multiple species in the ecosystem are believed to compete cyclically for survival and thus maintain balance in nature. Stochasticity has also an inevitable role in this dynamics. Considering these attributes of nature, the stochastic…
We consider a group of agents on a graph who repeatedly play the prisoner's dilemma game against their neighbors. The players adapt their actions to the past behavior of their opponents by applying the win-stay lose-shift strategy. On a…
We consider a branching process with Poissonian immigration where individuals have inheritable types. At rate theta, new individuals singly enter the total population and start a new population which evolves like a supercritical,…
Message-passing algorithms have emerged as powerful techniques for approximate inference in graphical models. When these algorithms converge, they can be shown to find local (or sometimes even global) optima of variational formulations to…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
We consider a symmetric finite-range contact process on $\mathbb{Z}$ with two types of particles (or infections), which propagate according to the same supercritical rate and die (or heal) at rate $1$. Particles of type $1$ can enter any…
In this paper we study threshold-one contact processes on lattices and regular trees. The asymptotic behavior of the critical infection rates as the degrees of the graphs growing to infinity are obtained. Defining \lambda_c as the supremum…
For one-dimensional systems with delta-contact interactions, the convergence of the exact-diagonalization method is tested with a basis of harmonic oscillator eigenfunctions with frequency $\Omega$ optimized through the minimization of the…
We study approachability theory in the presence of constraints. Given a repeated game with vector payoffs, we characterize the pairs of sets (A,D) in the payoff space such that Player 1 can guarantee that the long-run average payoff…
We introduce the idea of weakly coherent collisional models, where the elements of an environment interacting with a system of interest are prepared in states that are approximately thermal, but have an amount of coherence proportional to a…