Related papers: Crossing estimates from metric graph and discrete …
We provide an explicit solution of the problem of level-set percolation for multivariate Gaussians defined in terms of weighted graph Laplacians on complex networks. The solution requires an analysis of the heterogeneous micro-structure of…
We prove that the phase transition for the Gaussian free field (GFF) is sharp. In comparison to a previous argument due to Rodriguez in 2017 which characterized a $0-1$ law for the Massive Gaussian Free Field by analyzing crossing…
Critical phenomena on scale-free networks with a degree distribution $p_k \sim k^{-\lambda}$ exhibit rich finite-size effects due to its structural heterogeneity. We systematically study the finite-size scaling of percolation and identify…
For massless vertex-transitive transient graphs, the percolation phase transition for the level sets of the Gaussian free field on the associated continuous cable system is particularly well understood, and in particular the associated…
Scale-free percolation is a stochastic model for complex networks. In this spatial random graph model, vertices $x,y\in\mathbb{Z}^d$ are linked by an edge with probability depending on i.i.d.\ vertex weights and the Euclidean distance…
The Gaussian free field (GFF) is considered in the background of random iso-height islands which is modeled by the site percolation with the occupation probability $p$. To realize GFF, we consider the Poisson equation in the presence of…
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…
We consider $Z^d$, with d bigger or equal to three. We investigate the vacant set of random interlacements in the strongly percolative regime, the vacant set of the simple random walk, and the excursion set above a given level of the…
We prove that for the Gaussian free field (GFF) on the metric graph of $\mathbb{Z}^d$ (for all $d\ge 3$ except the critical dimension $d_c=6$), with uniformly positive probability there exist two distinct sign clusters of diameter at least…
In this note, we shall prove an explicit formula on the probability of the level line of the Gaussian Free Field (GFF) with mixed boundary condition terminating at the free boundary, which generalizes the results of GFF with Dirichlet…
We consider level crossing in a matrix family $H=H_0+\lambda V$ where $H_0$ is a fixed $N\times N$ matrix and $V$ belongs to one of the standard Gaussian random matrix ensembles. We study the probability distribution of level crossing…
We study on the metric graphs two types of scalar Gaussian free fields (GFF), the usual one and the one twisted by a $\{-1,1\}$-valued gauge field. We show that the latter can be obtained, up to an additional deterministic transformation,…
We study intersection properties of two or more independent tree-like random graphs. Our setting encompasses critical, possibly long range, Bernoulli percolation clusters, incipient infinite clusters, as well as critical branching random…
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We consider a general enough set-up and obtain a refinement of the coupling between the Gaussian free field and random interlacements recently constructed by Titus Lupu in arXiv:1402.0298. We apply our results to level-set percolation of…
Using conformal field theory, we derive several new crossing formulas at the two-dimensional percolation point. High-precision simulation confirms these results. Integrating them gives a unified derivation of Cardy's formula for the…
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…
Percolation has two mean-field theories, the Gaussian fixed point (GFP) and the Landau mean-field theory or the complete graph (CG) asymptotics. By large-scale Monte Carlo simulations, we systematically study the interplay of the GFP and CG…
Consider a random geometric graph over a random point process in $\mathbb{R}^d$. Two points are connected by an edge if and only if their distance is bounded by a prescribed distance parameter. We show that projecting the graph onto a two…