English
Related papers

Related papers: Geodesics in first-passage percolation cross any p…

200 papers

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…

Probability · Mathematics 2012-01-24 Eckhard Schlemm

We consider the model of i.i.d. first passage percolation on $\mathbb{Z}^d$ : we associate with each edge $e$ of the graph a passage time $t(e)$ taking values in $[0,+\infty]$, such that $\mathbb{P}[t(e)<+\infty] >p_c(d)$. Equivalently, we…

Probability · Mathematics 2014-11-21 Raphaël Cerf , Marie Théret

We analyze the geometrical structure of the passage times in the last passage percolation model. Viewing the passage time as a piecewise linear function of the weights we determine the domains of the various pieces, which are the subsets of…

Probability · Mathematics 2019-07-02 Tom Alberts , Eric Cator

We develop a new method for visualizing and refining the invariances of learned representations. Specifically, we test for a general form of invariance, linearization, in which the action of a transformation is confined to a low-dimensional…

Computer Vision and Pattern Recognition · Computer Science 2020-07-28 Olivier J. Hénaff , Eero P. Simoncelli

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…

Probability · Mathematics 2015-05-12 Romain Tessera

For first passage percolation (FPP) on Euclidean lattices $\mathbb{Z}^d$ with $d\ge 2$, it is expected that the variance of the first passage time between two points grows sublinearly in the distance with a universal exponent strictly…

Probability · Mathematics 2026-04-02 Riddhipratim Basu , Vladas Sidoravicius , Allan Sly

For the exactly solvable model of exponential last passage percolation on $\mathbb{Z}^2$, consider the geodesic $\Gamma_n$ joining $(0,0)$ and $(n,n)$ for large $n$. It is well known that the transversal fluctuation of $\Gamma_n$ around the…

Probability · Mathematics 2021-01-06 Riddhipratim Basu , Manan Bhatia

For First Passage Percolation in Z^d with large d, we construct a path connecting the origin to {x_1 =1}, whose passage time has optimal order \log d/d. Besides, an improved lower bound for the "diagonal" speed of the cluster combined with…

Probability · Mathematics 2011-02-24 Olivier Couronné , Nathanaël Enriquez , Lucas Gerin

A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…

Probability · Mathematics 2016-04-22 David J. Aldous

We consider Bernoulli first-passage percolation on the $d$-dimensional hypercubic lattice with $d \geq 2$. The passage time of edge $e$ is $0$ with probability $p$ and $1$ with probability $1-p$, independently of each other. Let $p_c$ be…

Probability · Mathematics 2022-05-31 Naoki Kubota , Masato Takei

We study geodesics on the parameter manifold, for systems exhibiting second order classical and quantum phase transitions. The coupled non-linear geodesic equations are solved numerically for a variety of models which show such phase…

Statistical Mechanics · Physics 2015-06-11 Prashant Kumar , Subhash Mahapatra , Prabwal Phukon , Tapobrata Sarkar

Solving optimization problems leads to elegant and practical solutions in a wide variety of real-world applications. In many of those real-world applications, some of the information required to specify the relevant optimization problem is…

Data Structures and Algorithms · Computer Science 2025-06-11 Kritkorn Karntikoon , Yiheng Shen , Sreenivas Gollapudi , Kostas Kollias , Aaron Schild , Ali Sinop

We introduce Riemannian First-Passage Percolation (Riemannian FPP) as a new model of random differential geometry, by considering a random, smooth Riemannian metric on $\mathbb R^d$. We are motivated in our study by the random geometry of…

Probability · Mathematics 2016-11-26 Tom LaGatta

We consider first-passage percolation on the edges of $\mathbb{Z}^2 \times k,$ namely the slab of width $k$. Each edge is assigned independently a passage time of either 0 (with probability $1-p_c(\mathbb{S}_k)$) or 1 ((with probability…

Probability · Mathematics 2017-08-16 Wei Wu , Serena Sian Yuan

The stationary isotropic Poisson line process was used to derive upper bounds on mean excess network geodesic length in Aldous and Kendall [Adv. in Appl. Probab. 40 (2008) 1-21]. The current paper presents a study of the geometry and…

Probability · Mathematics 2012-11-08 Wilfrid S. Kendall

Let $0<a<b<\infty$ be fixed scalars. Assign independently to each edge in the lattice $\mathbb{Z}^2$ the value $a$ with probability $p$ or the value $b$ with probability $1-p$. For all $u,v\in\mathbb{Z}^2$, let $T(u,v)$ denote the first…

Probability · Mathematics 2007-05-23 J. E. Yukich , Yu Zhang

For exponential last passage percolation on the plane we analyse the probability that the point-to-line geodesic exhibits an atypically large transversal fluctuation at the endpoint as well as the probability that the point-to-point…

Probability · Mathematics 2025-02-11 Pranay Agarwal , Riddhipratim Basu

We consider Brownian last passage percolation evolving dynamically via a discrete resampling procedure. Using $\Gamma_{(0,0)}^{(n,n),r}$ to denote a geodesic from $(0,0)$ to $(n,n)$ at time $r$, we prove that the expected total number of…

Probability · Mathematics 2025-11-03 Manan Bhatia

Consider a network embedded in the 2D plane, where a particle diffuses along the edges of the network. It is clear that over short length scales a particle moves along a single edge and thus undergoes one-dimensional diffusion. However, on…

Statistical Mechanics · Physics 2021-08-23 D. B. Wilson , C. H. L. Beentjes

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…

Probability · Mathematics 2007-05-23 Robin Pemantle , Russell Lyons
‹ Prev 1 3 4 5 6 7 10 Next ›