Related papers: Uniqueness and non-uniqueness in percolation theor…
Let $G$ be an acylindrically hyperbolic group. We prove that Bernoulli bond percolation on every Cayley graph of $G$ has a nonuniqueness phase, in which there are infinitely many infinite clusters. This generalizes Hutchcroft's result for…
We introduce a simple lattice model in which percolation is constructed on top of critical percolation clusters, and show that it can be repeated recursively any number $n$ of generations. In two dimensions, we determine the percolation…
We study the uniqueness of solutions to a class of heat equations with positive density posed on infinite weighted graphs. We separately consider the case when the density is bounded from below by a positive constant and the case of…
The study of percolation in so-called {\em nested subgraphs} implies a generalization of the concept of percolation since the results are not linked to specific graph process. Here the behavior of such graphs at criticallity is studied for…
Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a…
We prove that, the diffusivity and conductivity on $\mathbb{Z}^d$-Bernoulli percolation ($d \geq 2$) are infinitely differentiable in supercritical regime. This extends a result by Kozlov [Uspekhi Mat. Nauk 44 (1989), no. 2(266), pp 79 -…
The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results are obtained for the random-cluster model on nonamenable graphs with cluster…
We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…
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…
We consider a family of percolation models in which geometry and connectivity are defined by two independent random processes. Such models merge characteristics of discrete and continuous percolation. We develop an algorithm allowing…
In this paper, a number of traditional models related to the percolation theory has been considered by means of new computational methodology that does not use Cantor's ideas and describes infinite and infinitesimal numbers in accordance…
In this paper we study the noncompact star-type graph with perturbed radial Schrodinger equation on each ray and the matching conditions of some special form at the vertex. The results include the uniqueness theorem and constructive…
Contextuality is one way of capturing the non-classicality of quantum theory. The contextual nature of a theory is often witnessed via the violation of non-contextuality inequalities---certain linear inequalities involving probabilities of…
The aim of this note is to describe a geometric relation between simple plane curve singularities classified by simply laced Cartan matrices and cluster varieties of finite type also classified by the simply laced Cartan matrices. We…
We prove tight bounds on the site percolation threshold for $k$-uniform hypergraphs of maximum degree $\Delta$ and for $k$-uniform hypergraphs of maximum degree $\Delta$ in which any pair of edges overlaps in at most $r$ vertices. The…
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows to find the critical threshold and the size of the giant component. Numerical simulations…
Percolation refers to the emergence of a giant connected cluster in a disordered system when the number of connections between nodes exceeds a critical value. The percolation phase transitions were believed to be continuous until recently…
Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…
We introduce a formalism for computing bond percolation properties of a class of correlated and clustered random graphs. This class of graphs is a generalization of the Configuration Model where nodes of different types are connected via…
We introduce and study a model of percolation with constant freezing (PCF) where edges open at constant rate 1, and clusters freeze at rate \alpha independently of their size. Our main result is that the infinite volume process can be…