Related papers: Stochastic Domination and Comb Percolation

A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…

We study the problem of coexistence in a two-type competition model governed by first-passage percolation on $\Zd$ or on the infinite cluster in Bernoulli percolation. Actually, we prove for a large class of ergodic stationary passage times…

We give sufficient conditions for a metric space to bilipschitz embed in L_1. In particular, if X is a length space and there is a Lipschitz map u:X--->R such that for every interval I in R, the connected components of the inverse image…

In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…

We consider an i.i.d. supercritical bond percolation on $\mathbb{Z}^d$, every edge is open with a probability $p > p_c (d)$, where $p_c (d)$ denotes the critical parameter for this percolation. We know that there exists almost surely a…

A dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex outside $D$ is adjacent to a vertex in $D$. A locating-dominating set of $G$ is a dominating set $D$ of $G$ with the additional property that every two…

The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…

Bond-percolation graphs are random subgraphs of the d-dimensional integer lattice generated by a standard bond-percolation process. The associated graph Laplacians, subject to Dirichlet or Neumann conditions at cluster boundaries, represent…

For a graph $G=(V,E)$, we call a subset $ S\subseteq V \cup E$ a total mixed dominating set of $G$ if each element of $V \cup E$ is either adjacent or incident to an element of $S$, and the total mixed domination number $\gamma_{tm}(G)$ of…

We consider two examples for a well-known method for obtaining concentration of measure (COM) bounds for a given observable in a given measure. The method is to consider an auxiliary Markov chain for which the invariant distribution is the…

Kalu\v{z}a, Kopeck\'a and the author have shown that the best Lipschitz constant for mappings taking a given $n^{d}$-element set in the integer lattice $\mathbb{Z}^{d}$, with $n\in \mathbb{N}$, surjectively to the regular $n$ times $n$ grid…

We study the algorithmic decidability of the domination number in the Erdos-Renyi random graph model $G(n,p)$. We show that for a carefully chosen edge probability $p=p(n)$, the domination problem exhibits a strong irreducible property.…

Liggett and Steif (2006) proved that, for the supercritical contact process on certain graphs, the upper invariant measure stochastically dominates an i.i.d.\ Bernoulli product measure. In particular, they proved this for $\mathbb{Z}^d$ and…

Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…

Let $G$ be a graph. A total dominating set of $G$ is a set $S$ of vertices of $G$ such that every vertex is adjacent to at least one vertex in $S$. The total domatic number of a graph is the maximum number of total dominating sets which…

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…

A vertex subset $W\subseteq V$ of the graph $G=(V,E)$ is an independent dominating set if every vertex in $V\backslash W$ is adjacent to at least one vertex in $W$ and the vertices of $W$ are pairwise non-adjacent. The independent…

We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\ In 1995, I.\ Benjamini and H.\ Kesten proved that, for $d \geq 10$…

Fix a positive integer $n$ and consider the bipartite graph whose vertices are the $3$-element subsets and the $2$-element subsets of $[n]=\{1,2,\dots,n\}$, and there is an edge between $A$ and $B$ if $A\subset B$. We prove that the…

Let $d\ge 3$ be a fixed integer, $p\in (0,1)$, and let $n\geq 1$ be a positive integer such that $dn$ is even. Let $\mathbb{G}(n, d, p)$ be a (random) graph on $n$ vertices obtained by drawing uniformly at random a $d$-regular (simple)…