Related papers: Percolation of random nodal lines
Consider any fixed graph whose edges have been randomly and independently oriented, and write $\{S \leadsto i\}$ to indicate that there is an oriented path going from a vertex $s \in S$ to vertex $i$. Narayanan (2016) proved that for any…
We extend Smirnov's proof of the existence and conformal invariance of the scaling limit of critical site-percolation on the triangular lattice to particular sequences of periodic graphs with more arbitrary large-scale structure, obtained…
Bogomolny and Schmit proposed that the critical edge percolation on the square lattice is a good model for the nodal domains of a random plane wave. Based on this they made a conjecture about the number of nodal domains. Recent computer…
In this paper we provide general conditions on a one parameter family of random infinite subsets of Z^d to contain a unique infinite connected component for which the chemical distances are comparable to the Euclidean distances, focusing…
Rigidity Percolation with g degrees of freedom per site is analyzed on randomly diluted Erdos-Renyi graphs with average connectivity gamma, in the presence of a field h. In the (gamma,h) plane, the rigid and flexible phases are separated by…
Random graphs have played an instrumental role in modelling real-world networks arising from the internet topology, social networks, or even protein-interaction networks within cells. Percolation, on the other hand, has been the fundamental…
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…
Recently it was conjectured that nodal domains of random wave functions are adequately described by critical percolation theory. In this paper we strengthen this conjecture in two respects. First, we show that, though wave function…
The study of real-life network modeling has become very popular in recent years. An attractive model is the scale-free percolation model on the lattice $\mathbb{Z}^d$, $d\ge1$, because it fulfills several stylized facts observed in large…
Three-dimensional bond or site percolation theory on a lattice can be interpreted as a gauge theory in which the Wilson loops are viewed as counters of topological linking with random clusters. Beyond the percolation threshold large Wilson…
In this note we discuss vacant set level set percolation on a transient weighted graph. It interpolates between the percolation of the vacant set of random interlacements and the level set percolation of the Gaussian free field. We employ…
We study oriented percolation on random causal triangulations, those are random planar graphs obtained roughly speaking by adding horizontal connections between vertices of an infinite tree. When the underlying tree is a geometric…
We prove that for Gaussian random normal matrices the correlation function has universal behavior. Using the technique of orthogonal polynomials and identities similar to the Christoffel-Darboux formula, we find that in the limit, as the…
We prove Schramm's locality conjecture for Bernoulli bond percolation on transitive graphs: If $(G_n)_{n\geq 1}$ is a sequence of infinite vertex-transitive graphs converging locally to a vertex-transitive graph $G$ and $p_c(G_n) \neq 1$…
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$,…
In this paper we investigate the properties of nodal structures in random wave fields, and in particular we scrutinize their recently proposed connection with short-range percolation models. We propose a measure which shows the difference…
The nodal lines of random wave functions are investigated. We demonstrate numerically that they are well approximated by the so-called SLE_6 curves which describe the continuum limit of the percolation cluster boundaries. This result gives…
We study the percolation properties of the nodal structures of random fields. Lower bounds on crossing probabilities (RSW-type estimates) of quads by nodal domains or nodal sets of Gaussian ensembles of smooth random functions are…
We study random digraphs on sequences of expanders with bounded average degree {which converge locally in probability}. We prove that the threshold for the existence of a giant strongly connected component, as well as the asymptotic…
We describe the critical window for percolation in the universality class of sparse growing random graphs. In our models, vertices arrive sequentially and connect independently to each earlier vertex $v$ with probability proportional to a…