Related papers: Chemical distance for smooth Gaussian fields in hi…

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays…

Simulating percolation and critical phenomena of labelled species inside films composed of single-component linear homogeneous macromolecules using molecular Monte Carlo method in 3 dimensions, we study dependence of these conducting…

We study a dependent site percolation model on the $n$-dimensional Euclidean lattice where, instead of single sites, entire hyperplanes are removed independently at random. We extend the results about Bernoulli line percolation showing that…

Motivated by an application in wireless telecommunication networks, we consider a two-type continuum-percolation problem involving a homogeneous Poisson point process of users and a stationary and ergodic point process of base stations.…

Let $T$ be a random ergodic pseudometric over $\mathbb R^d$. This setting generalizes the classical \emph{first passage percolation} (FPP) over $\mathbb Z^d$. We provide simple conditions on $T$, the decay of instant one-arms and…

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…

We consider the (unoriented) long-range percolation on Z^d in dimensions d\ge1, where distinct sites x,y\in Z^d get connected with probability p_{xy}\in[0,1]. Assuming p_{xy}=|x-y|^{-s+o(1)} as |x-y|\to\infty, where s>0 and |\cdot| is a…

Consider an i.i.d. sample from an unknown density function supported on an unknown manifold embedded in a high dimensional Euclidean space. We tackle the problem of learning a distance between points, able to capture both the geometry of…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

We derive a sufficient condition for the existence of a subcritical percolation phase for a wide range of continuum percolation models where each vertex is embedded into Euclidean space according to an iid-marked stationary Poisson point…

We consider Bernoulli first-passage percolation on the triangular lattice in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. For each $p\in(0,p_c)$, let $\mathcal {B}(p)$ be the limit shape in the…

In the classic model of first passage percolation, for pairs of vertices separated by a Euclidean distance $L$, geodesics exhibit deviations from their mean length $L$ that are of order $L^\chi$, while the transversal fluctuations, known as…

Let $\{\eta(v): v\in V_N\}$ be a discrete Gaussian free field in a two-dimensional box $V_N$ of side length $N$ with Dirichlet boundary conditions. We study the Liouville first passage percolation, i.e., the shortest path metric where each…

Alexander and Orbach (AO) in 1982 conjectured that the simple random walk on critical percolation clusters (also known as the ant in the labyrinth) in Euclidean lattices exhibit mean field behavior; for instance, its spectral dimension is…

Considering supercritical Bernoulli percolation on $\mathbb{Z}^d$, Garet and Marchand [GM09] proved a diffusive concentration for the graph distance. In this paper, we sharpen this result by establishing the subdiffusive concentration…

First-passage percolation is the study of the metric space $(\mathbb{Z}^d,T)$, where $T$ is a random metric defined as the weighted graph metric using random edge-weights $(t_e)_{e\in \mathcal{E}^d}$ assigned to the nearest-neighbor edges…

We study percolation of two-sided level sets for the discrete Gaussian free field (DGFF) in 2D. For a DGFF $\varphi$ defined in a box $B_N$ with side length $N$, for $C$ large enough, there exist low crossings in the set of vertices $z$…

We derive an estimate for the distance, measured in lattice spacings, inside two-dimensional critical percolation clusters from the origin to the boundary of the box of side length $2n$, conditioned on the existence of an open connection.…

We study the random walk on dynamical percolation of $\mathbb{Z}^d$ (resp., the two-dimensional triangular lattice $\mathcal{T}$), where each edge (resp., each site) can be either open or closed, refreshing its status at rate $\mu\in…