Related papers: Isoperimetric lower bounds for critical exponents …
Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…
Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the…
We consider an inhomogeneous oriented percolation model introduced by de Lima, Rolla and Valesin. In this model, the underlying graph is an oriented rooted tree in which each vertex points to each of its $d$ children with `short' edges, and…
We introduce an approximation specific to a continuous model for directed percolation, which is strictly equivalent to 1+1 dimensional directed bond percolation. We find that the critical exponent associated to the order parameter…
We consider independent and $m$-dependent two-dimensional oriented site percolation with open-site density close to one started from Bernoulli product measures. We show that the probability of an occupied interval in the former process…
In this paper we study bond percolation on a one-dimensional chain with power-law bond probability $C/ r^{1+\sigma}$, where $r$ is the distance length between distinct sites. We introduce and test an order $N$ Monte Carlo algorithm and we…
We investigate percolation on a randomly directed lattice, an intermediate between standard percolation and directed percolation, focusing on the isotropic case in which bonds on opposite directions occur with the same probability. We…
We provide a complete proof of the diagrammatic bounds on the lace-expansion coefficients for oriented percolation, which are used in [arXiv:math/0703455] to investigate critical behavior for long-range oriented percolation above…
Consider the long-range models on $\mathbb{Z}^d$ of random walk, self-avoiding walk, percolation and the Ising model, whose translation-invariant 1-step distribution/coupling coefficient decays as $|x|^{-d-\alpha}$ for some $\alpha>0$. In…
In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…
We consider long-range percolation on $\mathbb{Z}^d$, where the probability that two vertices at distance $r$ are connected by an edge is given by $p(r)=1-\exp[-\lambda(r)]\in(0,1)$ and the presence or absence of different edges are…
Let C_n be the origin-containing cluster in subcritical percolation on the lattice (1/n) Z^d, viewed as a random variable in the space Omega of compact, connected, origin-containing subsets of R^d, endowed with the Hausdorff metric delta.…
We have generalized the idea of backbend in a nearest-neighbor oriented bond percolation process by considering a backbend sequence $\beta : \mathbb{Z}_+ \to \mathbb{Z}_+ \cup \{\infty\}$, and defining a $\beta$-backbend path from the…
There are distributed graph algorithms for finding maximal matchings and maximal independent sets in $O(\Delta + \log^* n)$ communication rounds; here $n$ is the number of nodes and $\Delta$ is the maximum degree. The lower bound by Linial…
We determine the dimensional dependence of the percolative exponents of the jamming transition via numerical simulations in four and five spatial dimensions. These novel results complement literature ones, and establish jamming as a mixed…
We consider independent anisotropic bond percolation on $\mathbb{Z}^d\times \mathbb{Z}^s$ where edges parallel to $\mathbb{Z}^d$ are open with probability $p<p_c(\mathbb{Z}^d)$ and edges parallel to $\mathbb{Z}^s$ are open with probability…
Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…
Let n points be placed independently in d-dimensional space according to the densities $f(x) = A_d e^{-\lambda \|x\|^{\alpha}}, \lambda > 0, x \in \Re^d, d \geq 2.$ Let $d_n$ be the longest edge length for the nearest neighbor graph on…
Let $p_c(\mathbb{Q}_n)$ and $p_c(\mathbb{Z}^n)$ denote the critical values for nearest-neighbour bond percolation on the $n$-cube $\mathbb{Q}_n = \{0,1\}^n$ and on $\Z^n$, respectively. Let $\Omega = n$ for $\mathbb{G} = \mathbb{Q}_n$ and…
Scanning probes reveal complex, inhomogeneous patterns on the surface of many condensed matter systems. In some cases, the patterns form self-similar, fractal geometric clusters. In this paper, we advance the theory of criticality as it…