Related papers: Level set percolation for random interlacements an…

A region of two-dimensional space has been filled randomly with large number of growing circular discs allowing only a `slight' overlapping among them just before their growth stop. More specifically, each disc grows from a nucleation…

We study models of correlated percolation where there are constraints on the occupation of sites that mimic force-balance, i.e. for a site to be stable requires occupied neighboring sites in all four compass directions in two dimensions. We…

In this paper we obtain a decoupling feature of the random interlacements process $\mathcal{I}^u \subset \mathbb{Z}^d$, at level $u$, $d\geq 3$. More precisely, we show that the trace of the random interlacements process on two disjoint…

We study the percolation phase transition in hierarchical scale-free nets. Depending on the method of construction, the nets can be fractal or small-world (the diameter grows either algebraically or logarithmically with the net size),…

We consider discrete random fractal surfaces with negative Hurst exponent $H<0$. A random colouring of the lattice is provided by activating the sites at which the surface height is greater than a given level $h$. The set of activated sites…

For the model of two-dimensional random interlacements in the critical regime (i.e., $\alpha=1$), we prove that the vacant set is a.s.\ infinite, thus solving an open problem from arXiv:1502.03470. Also, we prove that the entrance measure…

There is proposed a model of scale-free random graphs which are locally close to the uncorrelated complex random networks with divergent $\langle k^2 \rangle$ studied in e.g. S. N. Dorogovtsev {\it et al}, Rev. Mod. Phys. {\bf 80}, 1275…

A necessary and sufficient condition is established for the strict inequality $p_c(G_*)<p_c(G)$ between the critical probabilities of site percolation on a quasi-transitive, plane graph $G$ and on its matching graph $G_*$. It is assumed…

In this article, we study special points of a simple random walk and a Gaussian free field, such as (nearly) favorite points, late points and high points. In section $2$, we extend results of [19] and suggest open problems for $d=2$. In…

We study the behavior of algebraic connectivity in a weighted graph that is subject to site percolation, random deletion of the vertices. Using a refined concentration inequality for random matrices we show in our main theorem that the…

We consider two-dimensional dependent dynamical site percolation where sites perform majority dynamics. We introduce the critical percolation function at time t as the infimum density with which one needs to begin in order to obtain an…

We study the phenomenon of information propagation on mobile geometric scale-free random graphs, where vertices instantaneously pass on information to all other vertices in the same connected component. The graphs we consider are…

There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close…

Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…

It is argued that some phase--transitions observed in models of non-equilibrium wetting phenomena are related to contact processes with long-range interactions. This is investigated by introducing a model where the activation rate of a site…

We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…

We consider the d-dimensional massless free field localized by a delta-pinning of strength e. We study the asymptotics of the variance of the field, and of the decay-rate of its 2-point function, as e goes to zero, for general Gaussian…

We estimate locations of the regions of the percolation and of the non-percolation in the plane $(\lambda,\beta)$: the Poisson rate -- the inverse temperature, for interacted particle systems in finite dimension Euclidean spaces. Our…

Using an inverse of the standard linear congruential random number generator, large randomly occupied lattices can be visited by a random walker without having to determine the occupation status of every lattice site in advance. In seven…

We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for…