Related papers: Level-set percolation for the Gaussian free field …
We consider invasion percolation on Galton-Watson trees. On almost every Galton-Watson tree, the invasion cluster almost surely contains only one infinite path. This means that for almost every Galton-Watson tree, invasion percolation…
We study the distribution of the maximum of a large class of Gaussian fields indexed by a box $V_N\subset Z^d$ and possessing logarithmic correlations up to local defects that are sufficiently rare. Under appropriate assumptions that…
We prove empirical central limit theorems for the distribution of levels of various random fields defined on high-dimensional discrete structures as the dimension of the structure goes to $\infty$. The random fields considered include costs…
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…
We study the level crossing of the fermion system described by the euclidean Dirac Hamiltonian in the valley background. One chiral fermion level is shown to cross twice the zero value in the case of well-separated instanton-anti-instanton…
We investigate the geometric properties of loops on two-dimensional lattice graphs, where edge weights are drawn from a distribution that allows for positive and negative weights. We are interested in the appearance of spanning loops of…
We consider critical percolation on a supercritical Galton-Watson tree. We show that, when the offspring distribution is in the domain of attraction of an $\alpha$-stable law for some $\alpha \in (1,2)$, or has finite variance, several…
We consider the lattice version of the free field in two dimensions and study the fractal structure of the sets where the field is unusually high (or low). We then extend some of our computations to the case of the free field conditioned on…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
In a recent article, one of the authors used $c=0$ logarithmic conformal field theory to predict crossing-probability formulas for percolation clusters inside a hexagon with free boundary conditions. In this article, we verify these…
Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in…
H\"aggstr\"om, Peres, and Steif (1997) have introduced a dynamical version of percolation on a graph $G$. When $G$ is a tree they derived a necessary and sufficient condition for percolation to exist at some time $t$. In the case that $G$…
We address one open problem in a recent work due to Ding and Wirth, the first version of which was available in $2019$, relating to level-set percolation on metric-graphs for the Gaussian free field in three dimensions, in which it was…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We consider the extinction time of the contact process on increasing sequences of finite graphs obtained from a variety of random graph models. Under the assumption that the infection rate is above the critical value for the process on the…
This paper is an overview of the classical level crossing problem which is studied extensively in the literature and is fundamental in many branches of applied probability. We discuss a number of approximations with an emphasis on their…
We provide a complete picture of the local convergence of critical or subcritical Galton-Watson tree conditioned on having a large number of individuals with out-degree in a given set. The generic case, where the limit is a random tree with…
A simple non-interacting-electron model, combining local quantum tunneling and global classical percolation (due to a finite dephasing time at low temperatures), is introduced to describe a metal-insulator transition in two dimensions. It…
We consider a Bernoulli bond percolation on a random recursive tree of size $n\gg 1$, with supercritical parameter $p_n=1-c/\ln n$ for some $c>0$ fixed. It is known that with high probability, there exists then a unique giant cluster of…
We investigate the bond percolation model on transient weighted graphs ${G}$ induced by the excursion sets of the Gaussian free field on the corresponding metric graph. Under the sole assumption that its sign clusters do not percolate, we…