English
Related papers

Related papers: Brownian Web and Oriented Percolation: Density Bou…

200 papers

We consider two-dimensional dependent dynamical site percolation where sites perform majority dynamics. We introduce the critical percolation function at time t as the infimum density with which one needs to begin in order to obtain an…

Probability · Mathematics 2020-02-03 Gideon Amir , Rangel Baldasso

Percolation in systems made up of randomly placed impermeable grains is often examined in the context of system spanning clusters of connected solids forming above a relatively low critical grain density $\rho_{c1}$ or networks of…

Disordered Systems and Neural Networks · Physics 2025-10-10 D. J. Priour

We compute the joint distribution of the site and the time at which a $d$-dimensional standard Brownian motion $B_t$ hits the surface of the ball $ U(a) =\{|{\bf x}|<a\}$ for the first time. The asymptotic form of its density is obtained…

Probability · Mathematics 2016-10-06 Kohei Uchiyama

Let \beta_k(n) be the number of self-intersections of order k, appropriately renormalized, for a mean zero random walk X_n in Z^2 with 2+\delta moments. On a suitable probability space we can construct X_n and a planar Brownian motion W_t…

Probability · Mathematics 2007-05-23 Richard F. Bass , Jay Rosen

We study a system of branching Brownian motions on $\mathbb R$ with annihilation: at each branching time a new particle is created and the leftmost one is deleted. In [7] it has been studied the case of strictly local creations (the new…

Probability · Mathematics 2017-11-27 A. De Masi , P. A. Ferrari , E. Presutti , N. Soprano-Loto

Encounter-based models of diffusion provide a probabilistic framework for analyzing the effects of a partially absorbing reactive surface, in which the probability of absorption depends upon the amount of surface-particle contact time.…

Statistical Mechanics · Physics 2023-07-05 Paul C Bressloff

In this article we obtain uniform estimates on the absorption of Brownian motion by porous interfaces surrounding a compact set. An important ingredient is the construction of certain resonance sets, which are hard to avoid for Brownian…

Probability · Mathematics 2020-07-08 Maximilian Nitzschner , Alain-Sol Sznitman

It is shown that time reversibility of Hamiltonian microscopic dynamics and Gibbs canonical statistical ensemble of initial conditions for it together produce an exact virial expansion for probability distribution of path of molecular…

Statistical Mechanics · Physics 2008-03-04 Yu. E. Kuzovlev

We obtain Gaussian upper and lower bounds on the transition density q_t(x,y) of the continuous time simple random walk on a supercritical percolation cluster C_{\infty} in the Euclidean lattice. The bounds, analogous to Aronsen's bounds for…

Probability · Mathematics 2007-05-23 Martin T. Barlow

Corner percolation is a dependent bond percolation model on Z^2 introduced by B\'alint T\'oth, in which each vertex has exactly two incident edges, perpendicular to each other. G\'abor Pete has proven in 2008 that under the maximal entropy…

Probability · Mathematics 2022-12-09 Régine Marchand , Irène Marcovici , Pierrick Siest

We prove a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…

Probability · Mathematics 2026-03-23 Zhongyang Li

We consider an analogous version of the diffusion-limited aggregation model defined on the hyperbolic plane. We prove that almost surely the aggregate viewed at time infinity will have a positive density.

Probability · Mathematics 2015-09-10 Ronen Eldan

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

We study a model of $n$ one-dimensional non-intersecting Brownian motions with two prescribed starting points at time $t=0$ and two prescribed ending points at time $t=1$ in a critical regime where the paths fill two tangent ellipses in the…

Probability · Mathematics 2010-09-14 Steven Delvaux , Arno B. J. Kuijlaars , Lun Zhang

The coalescing Brownian flow on $\mathbb{R}$ is a process which was introduced by Arratia [Coalescing Brownian motions on the line (1979) Univ. Wisconsin, Madison] and T\'{o}th and Werner [Probab. Theory Related Fields 111 (1998) 375-452],…

Probability · Mathematics 2015-12-23 Nathanaël Berestycki , Christophe Garban , Arnab Sen

The Brownian web is a random object that occurs as the scaling limit of an infinite system of coalescing random walks. Perturbing this system of random walks by, independently at each point in space-time, resampling the random walk…

Probability · Mathematics 2007-05-23 Chris Howitt , Jon Warren

We present a coupled decreasing sequence of random walks on $ \mathbb Z $ that dominates the edge process of oriented-bond percolation in two dimensions. Using the concept of "random walk in a strip ", we construct an algorithm that…

Probability · Mathematics 2007-05-23 Thomas Logan Ritchie , Vladimir Belitsky

We consider connectivity properties of certain i.i.d. random environments on $\Z^d$, where at each location some steps may not be available. Site percolation and oriented percolation can be viewed as special cases of the models we consider.…

Probability · Mathematics 2018-11-27 Mark Holmes , Thomas S. Salisbury

We consider the Constrained-degree percolation model on the hypercubic lattice, $\mathbb L^d=(\mathbb Z^d,\mathbb E^d)$ for $d\geq 3$. It is a continuous time percolation model defined by a sequence, $(U_e)_{e\in\mathbb E^d}$, of i.i.d.…

Probability · Mathematics 2023-01-03 Ivailo Hartarsky , Bernardo N. B. de Lima

We introduce a site-wise domination criterion for local percolation models, which enables the comparison of one-arm probabilities even in the absence of stochastic domination. The method relies on a local-to-global principle: if, at each…