English
Related papers

Related papers: Percolation of random nodal lines

200 papers

In this work we consider infinite dimensional extensions of some finite dimensional Gaussian geometric functionals called the Gaussian Minkowski functionals. These functionals appear as coefficients in the probability content of a tube…

Probability · Mathematics 2013-07-26 Jonathan E. Taylor , Sreekar Vadlamani

Scale-free percolation is a percolation model on $\mathbb{Z}^d$ which can be used to model real-world networks. We prove bounds for the graph distance in the regime where vertices have infinite degrees. We fully characterize transience vs.…

Probability · Mathematics 2018-01-11 Markus Heydenreich , Tim Hulshof , Joost Jorritsma

Associated to a closed, oriented surface S is the complex vector space with basis the set of all compact, oriented 3-manifolds which it bounds. Gluing along S defines a Hermitian pairing on this space with values in the complex vector space…

Geometric Topology · Mathematics 2009-10-14 Danny Calegari , Michael Freedman , Kevin Walker

It has been proved by the authors that the (extended) Sadowsky functional can be deduced as the Gamma-limit of the Kirchhoff energy on a rectangular strip of height $\varepsilon$, as $\varepsilon$ tends to 0. In this paper we show that this…

Analysis of PDEs · Mathematics 2022-09-07 Lorenzo Freddi , Peter Hornung , Maria Giovanna Mora , Roberto Paroni

We introduce a model of random interlacements made of a countable collection of doubly infinite paths on Z^d, d bigger or equal to 3. A non-negative parameter u measures how many trajectories enter the picture. This model describes in the…

Probability · Mathematics 2010-06-08 Alain-Sol Sznitman

We consider a first-passage percolation model on a Delaunay triangulation of the plane. In this model each edge is independently equipped with a nonnegative random variable, with distribution function F, which is interpreted as the time it…

Probability · Mathematics 2011-08-15 Leandro P. R. Pimentel

We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…

Probability · Mathematics 2015-05-19 Massimo Franceschetti , Mathew D. Penrose , Tom Rosoman

The aim of this paper is twofold. First, we study eigenvalues and eigenvectors of the adjacency matrix of a bond percolation graph when the base graph is finite and well approximated locally by an infinite regular graph. We relate…

Mathematical Physics · Physics 2023-07-19 Charles Bordenave

We explore a bond percolation model on slabs $\mathbb{S}^+_k=\mathbb{Z}_+\times \mathbb{Z}_+\times\{0,\dots,k\}$ featuring one-dimensional inhomogeneities. In this context, a vertical column on the slab comprises the set of vertical edges…

Probability · Mathematics 2026-05-05 Matheus B. Castro , Rémy Sanchis , Roger W. C. Silva

Recently established rationality of correlation functions in a globally conformal invariant quantum field theory satisfying Wightman axioms is used to construct a family of soluble models in 4-dimensional Minkowski space-time. We consider…

High Energy Physics - Theory · Physics 2008-11-26 Nikolay M. Nikolov , Yassen S. Stanev , Ivan T. Todorov

We consider undirected graphs that arise as deterministic functions of stationary point processes such that each point has degree bounded by two. For a large class of point processes and edge-drawing rules, we show that the arising graph…

Probability · Mathematics 2021-06-08 Benedikt Jahnel , András Tóbiás

We consider inhomogeneous spatial random graphs on the real line. Each vertex carries an i.i.d. weight and edges are drawn such that short edges and edges to vertices with large weights occur with higher probability. This allows the study…

Probability · Mathematics 2025-09-08 Peter Gracar , Lukas Lüchtrath , Christian Mönch

We consider the percolation problem of sites on an $L\times L$ square lattice with periodic boundary conditions which were unvisited by a random walk of $N=uL^2$ steps, i.e. are vacant. Most of the results are obtained from numerical…

Statistical Mechanics · Physics 2021-03-24 Amit Federbush , Yacov Kantor

The intrinsically secure communications graph (iS-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence of eavesdroppers. It is based on principles of…

Information Theory · Computer Science 2016-11-18 Pedro C. Pinto , Moe Z. Win

Let k be an algebraically closed field of characteristic 0, let X=P^1\times A^N and let f be a rational endomorphism of X given by (x,y)--->(g(x), A(x)y), where g is a rational function, while A is an N-by-N matrix with entries in k(x). We…

Number Theory · Mathematics 2018-03-13 Dragos Ghioca , Junyi Xie , with an appendix written by Michael Wibmer

The diffraction of stochastic point sets, both Bernoulli and Markov, and of random tilings with crystallographic symmetries is investigated in rigorous terms. In particular, we derive the diffraction spectrum of 1D random tilings, of…

Mathematical Physics · Physics 2015-06-26 Michael Baake , Moritz Hoeffe

These lectures give an introduction to the methods of conformal field theory as applied to deriving certain results in two-dimensional critical percolation: namely the probability that there exists at least one cluster connecting two…

Mathematical Physics · Physics 2007-05-23 John Cardy

Let M be a compact smooth manifold of dimension n with or without boundary, and f : M $\rightarrow$ R be a smooth Gaussian random field. It is very natural to suppose that for a large positive real u, the random excursion set {f $\ge$ u} is…

Probability · Mathematics 2021-04-13 Damien Gayet

Recently, the authors showed that the critical probability for random Voronoi percolation in the plane is 1/2. A by-product of the method was a short proof of the Harris-Kesten Theorem concerning bond percolation in the planar square…

Probability · Mathematics 2007-05-23 Bela Bollobas , Oliver Riordan

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…

Probability · Mathematics 2024-02-21 Geoffrey R. Grimmett , Zhongyang Li