中文
相关论文

相关论文: Scaling limits of the three-dimensional uniform sp…

200 篇论文

Let $\mathcal{U}$ be the uniform spanning tree on $\mathbb{Z}^3$, whose probability law is denoted by $\mathbf{P}$. For $\mathbf{P}$-a.s. realization of $\mathcal{U}$, the recurrence of the the simple random walk on $\mathcal{U}$ is proved…

概率论 · 数学 2023-02-13 Satomi Watanabe

Let x and y be points chosen uniformly at random from $\Z_n^4$, the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order $n^2 (\log n)^{1/6}$, resolving a…

概率论 · 数学 2007-07-30 Jason Schweinsberg

We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…

概率论 · 数学 2017-08-07 L. Avena , F. den Hollander

We show that the Brownian continuum random tree is the Gromov-Hausdorff-Prohorov scaling limit of the uniform spanning tree on high-dimensional graphs including the $d$-dimensional torus $\mathbb{Z}_n^d$ with $d>4$, the hypercube…

概率论 · 数学 2022-04-14 Eleanor Archer , Asaf Nachmias , Matan Shalev

We show that the scaling limit exists and is invariant to dilations and rotations. We give some tools that might be useful to show universality.

概率论 · 数学 2007-05-23 Gady Kozma

We consider uniform spanning tree (UST) in topological rectangles with alternating boundary conditions. The Peano curves associated to the UST converge weakly to hypergeometric SLE$_8$, denoted by hSLE$_8$. From the convergence result, we…

概率论 · 数学 2023-10-24 Yong Han , Mingchang Liu , Hao Wu

We study random two-dimensional spanning forests in the plane that can be viewed both in the discrete case and in their appropriately taken scaling limits as a uniformly chosen spanning tree with some Poissonian deletion of edges or points.…

概率论 · 数学 2020-08-04 Stéphane Benoist , Laure Dumaz , Wendelin Werner

We consider critical site percolation ($p=p_c=1/2$) on the triangular lattice $\mathbf{T}$ in two dimensions. We show that the simple random walk on the clusters of open vertices converges in the scaling limit to a continuous diffusion…

概率论 · 数学 2026-04-16 Irina Đanković , Maarten Markering , Jason Miller , Yizheng Yuan

We prove that the Minimal Spanning Tree and the Invasion Percolation Tree on a version of the triangular lattice in the complex plane have unique scaling limits, which are invariant under rotations, scalings, and, in the case of the MST,…

概率论 · 数学 2017-01-27 Christophe Garban , Gábor Pete , Oded Schramm

We derive sub-Gaussian bounds for the annealed transition density of the simple random walk on a high-dimensional loop-erased random walk. The walk dimension that appears in these is the exponent governing the space-time scaling of the…

概率论 · 数学 2023-12-18 David A. Croydon , Daisuke Shiraishi , Satomi Watanabe

In previous work by Avena and den Hollander, a model of a one-dimensional random walk in a dynamic random environment was proposed where the random environment is resampled from a given law along a growing sequence of deterministic times.…

概率论 · 数学 2018-03-12 L. Avena , Y. Chino , C. da Costa , F. den Hollander

We prove that the scaling limit of loop-erased random walk in a simply connected domain $D$ is equal to the radial SLE(2) path in $D$. In particular, the limit exists and is conformally invariant. It follows that the scaling limit of the…

概率论 · 数学 2008-11-26 Gregory F. Lawler , Oded Schramm , Wendelin Werner

For any edge weight distribution, we consider the uniform spanning tree (UST) on finite graphs with i.i.d. random edge weights. We show that, for bounded degree expander graphs and finite boxes of ${\mathbb Z}^d$, the diameter of the UST is…

概率论 · 数学 2024-10-23 Luca Makowiec , Michele Salvi , Rongfeng Sun

We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…

统计力学 · 物理学 2007-05-23 Jae Dong Noh , Heiko Rieger

In this thesis, we study a new disordered system called random spanning tree in random environment (RSTRE) across different families of graphs with varying disorder distributions. We examine several observables as functions of the disorder…

概率论 · 数学 2025-07-11 Luca Makowiec

We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…

概率论 · 数学 2013-07-22 Jean-François Le Gall , Shen Lin

We investigate scaling limits of trees built by uniform attachment with freezing, which is a variant of the classical model of random recursive trees introduced in a companion paper. Here vertices are allowed to freeze, and arriving…

In this work, we consider the scaling limit of loop-erased random walk (LERW) in three dimensions and prove that the limiting occupation measure is equivalent to its $\beta$-dimensional Minkowski content, where $\beta \in (1, 5/3]$ is its…

概率论 · 数学 2025-12-23 Sarai Hernandez-Torres , Xinyi Li , Daisuke Shiraishi

We consider a random walk on a Galton-Watson tree in random environment, in the subdiffusive case. We prove the convergence of the renormalised height function of the walk towards the continuous-time height process of a spectrally positive…

概率论 · 数学 2019-04-19 Loïc de Raphélis

We introduce a Gibbs measure on nearest-neighbour paths of length $t$ in the Euclidean $d$-dimensional lattice, where each path is penalised by a factor proportional to the size of its boundary and an inverse temperature $\beta$. We prove…

概率论 · 数学 2018-03-28 Nathanael Berestycki , Ariel Yadin