中文
相关论文

相关论文: Geodesics in First Passage Percolation

200 篇论文

We consider the geodesic of the directed last passage percolation with iid exponential weights. We find the explicit one-point distribution of the geodesic location joint with the last passage times, and its limit as the parameters go to…

概率论 · 数学 2025-09-03 Zhipeng Liu

A well-known question in planar first-passage percolation concerns the convergence of the empirical distribution of weights as seen along geodesics. We demonstrate this convergence for an explicit model, directed last-passage percolation on…

概率论 · 数学 2024-12-17 James B. Martin , Allan Sly , Lingfu Zhang

We study the critical case of first-passage percolation in two dimensions. Letting $(t_e)$ be i.i.d. nonnegative weights assigned to the edges of $\mathbb{Z}^2$ with $\mathbb{P}(t_e=0)=1/2$, consider the induced pseudometric (passage time)…

概率论 · 数学 2019-12-17 Michael Damron , David Harper

This monograph resolves - in a dense class of cases - several open problems concerning geodesics in i.i.d. first-passage percolation on $\mathbb{Z}^d$. Our primary interest is in the empirical measures of edge-weights observed along…

概率论 · 数学 2021-10-04 Erik Bates

We consider the first-passage percolation problem on effectively one-dimensional graphs with vertex set {1,...,n}\times{0,1} and translation-invariant edge-structure. For three of six non-trivial cases we obtain exact expressions for the…

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

Let $0<a<b<\infty$, and for each edge $e$ of $Z^d$ let $\omega_e=a$ or $\omega_e=b$, each with probability 1/2, independently. This induces a random metric $\dist_\omega$ on the vertices of $Z^d$, called first passage percolation. We prove…

概率论 · 数学 2008-11-26 Itai Benjamini , Gil Kalai , Oded Schramm

We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…

概率论 · 数学 2015-06-04 Enrico Baroni , Remco van der Hofstad , Julia Komjathy

We give an elementary proof that Talagrand's sub-Gaussian concentration inequality implies a limit shape theorem for first passage percolation on any Cayley graph of Z^d, with a bound on the speed of convergence that slightly improves…

概率论 · 数学 2015-05-12 Romain Tessera

We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…

概率论 · 数学 2019-01-01 Jon Chaika , Arjun Krishnan

We study a version of first passage percolation on $\mathbb{Z}^d$ where the random passage times on the edges are replaced by contact times represented by random closed sets on $\mathbb{R}$. Similarly to the contact process without…

概率论 · 数学 2026-02-02 Benedikt Jahnel , Lukas Lüchtrath , Anh Duc Vu

In first-passage percolation, we place i.i.d. continuous weights at the edges of Z^2 and consider the weighted graph metric. A distance-minimizing path between points x and y is called a geodesic, and a bigeodesic is a doubly-infinite path…

概率论 · 数学 2016-10-12 Michael Damron , Jack Hanson

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…

概率论 · 数学 2019-03-19 Jian Ding , Fuxi Zhang

Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed…

We consider first passage percolation on the configuration model. Once the network has been generated each edge is assigned an i.i.d. weight modeling the passage time of a message along this edge. Then independently two vertices are chosen…

概率论 · 数学 2018-12-05 Steffen Dereich , Marcel Ortgiese

We consider the first passage percolation model on the square lattice with an edge weight distribution F. In this paper, we consider the number of optimal paths for two points separated by a long distance. We show that there is a phase…

概率论 · 数学 2019-05-31 Yu Zhang

We consider a model of long-range first-passage percolation on the $d$ dimensional square lattice $Z^d$ in which any two distinct vertices $x, y \in Z^d$ are connected by an edge having exponentially distributed passage time with mean…

概率论 · 数学 2015-03-04 Shirshendu Chatterjee , Partha S. Dey

We give examples of rank one compact surfaces on which there exist recurrent geodesics that cannot be shadowed by periodic geodesics. We build rank one compact surfaces such that ergodic measures on the unit tangent bundle of the surface…

动力系统 · 数学 2010-05-02 Yves Coudene , Barbara Schapira

We consider the model of i.i.d. first passage percolation on Z^d, where we associate with the edges of the graph a family of i.i.d. random variables with common distribution G on [0, +$\infty$] (including +$\infty$). Whereas the time…

概率论 · 数学 2018-09-25 Raphaël Rossignol , Marie Théret

We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…

概率论 · 数学 2011-02-24 Henrik Renlund

Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph. Assume that the graph is infinite and of bounded degree. Assume also strict positivity and finite…

几何拓扑 · 数学 2025-07-11 Sagnik Jana , Yulan Qing