English
Related papers

Related papers: Brownian Bridge Asymptotics for the Subcritical Be…

200 papers

Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong…

Probability · Mathematics 2011-01-25 Daniela Bertacchi , Fabio Zucca

We use the lace expansion to prove that the critical values for nearest-neighbour bond percolation on the $n$-cube $\{0,1\}^n$ and on $\mathbb{Z}^n$ have asymptotic expansions, with rational coefficients, to all orders in powers of…

Probability · Mathematics 2007-05-23 Remco van der Hofstad , Gordon Slade

We study the clusters of loops in a Brownian loop soup in some bounded two-dimensional domain with subcritical intensity $\theta \in (0,1/2]$. We obtain an exact expression for the asymptotic probability of the existence of a cluster…

Probability · Mathematics 2025-11-17 Antoine Jego , Titus Lupu , Wei Qian

We solve exactly a special case of the anisotropic directed bond percolation problem in three dimensions, in which the occupation probability is 1 along two spatial directions, by mapping it to a five-vertex model. We determine the…

Statistical Mechanics · Physics 2009-10-31 R. Rajesh , Deepak Dhar

The space-time distribution, $Q_A(x,dt d\xi)$ say, of Brownian hitting of a bounded Borel set $A$ of the $d$-dimensional Euclidian space is studied. We derive the asymptotic form of the leading term of the time-derivative $Q_A(x,…

Probability · Mathematics 2017-12-13 Kohei Uchiyama

We study Bernoulli first-passage percolation (FPP) on the triangular lattice $\mathbb{T}$ in which sites have 0 and 1 passage times with probability $p$ and $1-p$, respectively. Denote by $\mathcal {C}_{\infty}$ the infinite cluster with…

Probability · Mathematics 2018-12-20 Chang-Long Yao

We consider random genus-0 hyperbolic surfaces $\mathcal{S}_n$ with $n + 1$ punctures, sampled according to the Weil-Petersson measure. We show that, after rescaling the metric by $n^{-1/4}$, the surface $\mathcal{S}_n$ converges in…

Probability · Mathematics 2025-08-27 Timothy Budd , Nicolas Curien

Let G_n be a sequence of finite transitive graphs with vertex degree d=d(n) and |G_n|=n. Denote by p^t(v,v) the return probability after t steps of the non-backtracking random walk on G_n. We show that if p^t(v,v) has quasi-random…

Probability · Mathematics 2008-11-25 Asaf Nachmias

We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation…

Probability · Mathematics 2021-06-01 Gabriel Berzunza , Cecilia Holmgren

We show how the theory of the critical behaviour of $d$-dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes. This in particular encompasses the case of a single polymer chain…

Mathematical Physics · Physics 2020-08-26 Bertrand Duplantier , Anthony J Guttmann

We associate geometric partial differential equations on holomorphic vector bundles to Bridgeland stability conditions. We call solutions to these equations $Z$-critical connections, with $Z$ a central charge. Deformed Hermitian Yang--Mills…

Differential Geometry · Mathematics 2024-01-23 Ruadhaí Dervan , John Benjamin McCarthy , Lars Martin Sektnan

We consider the backbone of the infinite cluster generated by supercritical oriented site percolation in dimension 1 +1. A directed random walk on this backbone can be seen as an "ancestral line" of an individual sampled in the stationary…

Probability · Mathematics 2019-09-12 Matthias Birkner , Nina Gantert , Sebastian Steiber

We consider percolation on the discrete torus $\mathbb{Z}_n^d$ at $p_c(\mathbb{Z}^d)$, the critical value for percolation on the corresponding infinite lattice $\mathbb{Z}^d$, and within the scaling window around it. We assume that $d$ is a…

Probability · Mathematics 2025-12-23 Arthur Blanc-Renaudie , Asaf Nachmias

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…

Probability · Mathematics 2023-07-10 David Corlin Marchand

We study a $q$-state Potts model on the square grid when $q>4$ at the point $T_c(q)$ of its (discontinous) transition. This model exhibits exactly $q+1$ extremal Gibbs measures: $q$ ordered (monochromatic) and one disordered (free). The…

Probability · Mathematics 2026-04-24 Moritz Dober , Alexander Glazman , Sébastien Ott

I prove that every adapted Brownian bridge on a geodesically complete connected Riemannian manifold is a semimartingale including its terminal time, without any further assumptions on the geometry. In particular, it follows that every such…

Probability · Mathematics 2016-04-29 Batu Güneysu

Partially motivated by the desire to better understand the connectivity phase transition in fractal percolation, we introduce and study a class of continuum fractal percolation models in dimension d greater than or equal to 2. These include…

Probability · Mathematics 2010-12-30 Erik I. Broman , Federico Camia

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…

Statistical Mechanics · Physics 2017-05-16 Ralph Kenna , Bertrand Berche

The critical phase of bond percolation on the random growing tree is examined. It is shown that the root cluster grows with the system size $N$ as $N^\psi$ and the mean number of clusters with size $s$ per node follows a power function $n_s…

Disordered Systems and Neural Networks · Physics 2011-04-21 Takehisa Hasegawa , Koji Nemoto

We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimera like topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size $2n$,…

Disordered Systems and Neural Networks · Physics 2016-04-26 O. Melchert , Helmut G. Katzgraber , M. A. Novotny