中文
相关论文

相关论文: On Limit Constants in Last Passage Percolation in …

200 篇论文

Around 2008, Schramm conjectured that the critical probabilities for Bernoulli bond percolation satisfy the following continuity property: If $(G_n)_{n\geq 1}$ is a sequence of transitive graphs converging locally to a transitive graph $G$…

概率论 · 数学 2019-07-29 Tom Hutchcroft

We study the two-time distribution in directed last passage percolation with geometric weights in the first quadrant. We compute the scaling limit and show that it is given by a contour integral of a Fredholm determinant.

概率论 · 数学 2018-11-07 Kurt Johansson

In first-passage percolation (FPP), we let $(\tau_v)$ be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If $F$ is the distribution function of $\tau_v$, there are…

概率论 · 数学 2021-08-31 Michael Damron , Jack Hanson , David Harper , Wai-Kit Lam

In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $\delta(\ell) = 1/n \times$ (maximum number of steps in a…

统计力学 · 物理学 2009-11-11 David J. Aldous

The simplest transport problem, namely maxflow, is investigated on critical percolation clusters in two and three dimensions, using a combination of extremal statistics arguments and exact numerical computations, for power-law distributed…

统计力学 · 物理学 2009-11-07 Mikko Alava , Cristian Moukarzel

We study the complete graph equipped with a topology induced by independent and identically distributed edge weights. The focus of our analysis is on the weight W_n and the number of edges H_n of the minimal weight path between two distinct…

To each edge (i,j), i<j of the complete directed graph on the integers we assign unit weight with probability p or weight x with probability 1-p, independently from edge to edge, and give to each path weight equal to the sum of its edge…

概率论 · 数学 2022-06-29 Sergey Foss , Takis Konstantopoulos , Artem Pyatkin

We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…

概率论 · 数学 2007-05-23 Robin Pemantle , Russell Lyons

In exponential last passage percolation, we consider the rescaled Busemann process $x\mapsto N^{-1/3}B^\rho_{0,[xN^{2/3}]e_1} \,\, (x\in\mathbb{R})$, as a process parametrized by the scaled density $\rho=1/2+\frac{\mu}{4} N^{-1/3}$, and…

概率论 · 数学 2023-01-25 Ofer Busani

In this paper, we obtain optimal uniform lower tail estimates for the probability distribution of the properly scaled length of the longest up/right path of the last passage site percolation model considered by Johansson in [12]. The…

概率论 · 数学 2007-05-23 Jinho Baik , Percy Deift , Ken McLaughlin , Peter Miller , Xin Zhou

We consider the first-passage percolation problem on the random graph with vertex set N\times{0,1}, edges joining vertices at Euclidean distance equal to unity and independent exponential edge weights. We provide a central limit theorem for…

概率论 · 数学 2012-01-24 Eckhard Schlemm

In a geometric inhomogeneous random graph vertices are given by the points of a Poisson process and are equipped with independent weights following a heavy tailed distribution. Any pair of distinct vertices is independently forming an edge…

概率论 · 数学 2025-09-30 Emmanuel Jacob , Céline Kerriou , Amitai Linker , Peter Mörters

Our object of study is the asymptotic growth of heaviest paths in a charged (weighted with signed weights) complete directed acyclic graph. Edge charges are i.i.d. random variables with common distribution $F$ supported on $[-\infty,1]$…

概率论 · 数学 2023-09-28 Sergey Foss , Takis Konstantopoulos , Bastien Mallein , Sanjay Ramassamy

Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…

概率论 · 数学 2024-03-12 Philip Easo , Tom Hutchcroft

We study a random bisection problem where an initial interval of length x is cut into two random fragments at the first stage, then each of these two fragments is cut further, etc. We compute the probability P_n(x) that at the n-th stage,…

统计力学 · 物理学 2009-10-31 P. L. Krapivsky , Satya N. Majumdar

We consider directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices. A topic of great interest is the coupling structure of the weights of geodesics as the endpoints are varied spatially and…

概率论 · 数学 2021-01-28 Riddhipratim Basu , Shirshendu Ganguly , Lingfu Zhang

Let $\{X_{v}:v\in\mathbb{Z}^d\}$ be i.i.d. random variables. Let $S(\pi)=\sum_{v\in\pi}X_v$ be the weight of a self-avoiding lattice path $\pi$. Let \[M_n=\max\{S(\pi):\pi\text{ has length }n\text{ and starts from the origin}\}.\] We are…

概率论 · 数学 2024-01-30 Yinshan Chang , Anqi Zheng

The aim of this article is to study the forest composed by point-to-line geodesics in the last-passage percolation model with exponential weights. We will show that the location of the root can be described in terms of the maxima of a…

概率论 · 数学 2015-10-07 Sergio I. Lopez , Leandro P. R. Pimentel

We consider first passage percolation with i.i.d. weights on edges of the d-dimensional cubic lattice. Under the assumptions that a weight is equal to zero with probability smaller than the critical probability of bond percolation in the…

概率论 · 数学 2015-09-17 Naoki Kubota

We consider first-passage percolation with positive, stationary-ergodic weights on the square lattice $\mathbb{Z}^d$. Let $T(x)$ be the first-passage time from the origin to a point $x$ in $\mathbb{Z}^d$. The convergence of the scaled…

概率论 · 数学 2016-10-25 Arjun Krishnan