Related papers: Stochastic domination: the contact process, Ising …
Hard constraints imposed in statistical mechanics models can lead to interesting thermodynamical behaviors, but may at the same time raise obstructions in the thoroughfare to thermal equilibration. Here we study a variant of Baxter's…
We present a model of contact process on Domany-Kinzel cellular automata with a geometrical disorder. In the 1-D model, each site is connected to two nearest neighbors which are either on the left or the right. The system is always…
In this paper, we consider contact processes on locally compact separable metric spaces with birth and death rates heterogeneous in space. Conditions on the rates that ensure the existence of invariant measures of contact processes are…
We study attracting graphs of step skew products from the topological and ergodic points of view where the usual contracting-like assumptions of the fiber dynamics are replaced by weaker merely topological conditions. In this context, we…
We study stochastic particle systems that conserve the particle density and exhibit a condensation transition due to particle interactions. We restrict our analysis to spatially homogeneous systems on finite lattices with stationary product…
We study versions of the contact process with three states, and with infections occurring at a rate depending on the overall infection density. Motivated by a model described in [17] for vegetation patterns in arid landscapes, we focus on…
Convex combinations of i.i.d. random variables without a finite mean can behave in a strikingly different way from the finite-mean case: as the weight vector becomes more balanced, the resulting combination may become stochastically larger,…
We develop a method to prove that certain percolation processes on amenable random rooted graphs are factors of iid (fiid), given that the process is a monotone limit of random finite subgraphs that satisfy a certain independent stochastic…
Power domination is a two-step observation process that is used to monitor power networks and can be viewed as a combination of domination and zero forcing. Given a graph $G$, a subset $S\subseteq V(G)$ that can observe all vertices of $G$…
The existence of a weak survival region is established for the anisotropic symmetric contact process on a homogeneous tree T_{2d} of degree 2d > 2: For parameter values in a certain connected region of positive Lebesgue measure, the…
The unitary Cayley graph of $\mathbb{Z} /n \mathbb{Z}$, denoted $X_{\mathbb{Z} / n \mathbb{Z}}$, has vertices $0,1, \dots, n-1$ with $x$ adjacent to $y$ if $x-y$ is relatively prime to $n$. We present results on the tightness of the known…
It is known that the Ising model on $\mathbb {Z}^d$ at a given temperature is a finitary factor of an i.i.d. process if and only if the temperature is at least the critical temperature. Below the critical temperature, the plus and minus…
The power domination problem focuses on finding the optimal placement of phase measurement units (PMUs) to monitor an electrical power network. In the context of graphs, the power domination number of a graph $G$, denoted $\gamma_P(G)$, is…
The ferromagnetic transition in the Ising model is the paradigmatic example of ergodicity breaking accompanied by symmetry breaking. It is routinely assumed that the thermodynamic limit is taken with free or periodic boundary conditions.…
A dominating set $D$ for a graph $G$ is a subset of $V(G)$ such that any vertex not in $D$ has at least one neighbor in $D$. The domination number $\gamma(G)$ is the size of a minimum dominating set in $G$. Vizing's conjecture from 1968…
A graph is \emph{well-dominated} if all of its minimal dominating sets have the same cardinality. We prove that at least one of the factors is well-dominated if the Cartesian product of two graphs is well-dominated. In addition, we show…
We investigate a modified one-dimensional contact process with varying infection rates. Specifically, the infection spreads at rate $\lambda_e$ along the boundaries of the infected region and at rate $\lambda_i$ elsewhere. We establish the…
The unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$, denoted $X_n$, is the graph on $\{0,\dots,n-1\}$ where vertices $a$ and $b$ are adjacent if and only if $\gcd(a-b,n) = 1$. We answer a question of Defant and Iyer by constructing a…
In the uniformly hyperbolic setting it is well known that the set of all measures supported on periodic orbits is dense in the convex space of all invariant measures. In this paper we consider the converse question, in the non-uniformly…
A dominating (respectively, total dominating) set $S$ of a digraph $D$ is a set of vertices in $D$ such that the union of the closed (respectively, open) out-neighborhoods of vertices in $S$ equals the vertex set of $D$. The minimum size of…