z-logo
Premium
First passage percolation and escape strategies
Author(s) -
Andjel Enrique D.,
Vares Maria E.
Publication year - 2015
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20548
Subject(s) - mathematics , percolation (cognitive psychology) , combinatorics , path (computing) , distribution (mathematics) , geodesic , struct , statistical physics , discrete mathematics , physics , mathematical analysis , computer science , neuroscience , biology , programming language
Consider first passage percolation onℤ dwith passage times given by i.i.d. random variables with common distribution F . Lett π ( u , v ) be the time from u to v for a path π and t ( u , v ) the minimal time among all paths from u to v . We ask whether or not there exist points x , y ∈ ℤ dand a semi‐infinite path π = ( y 0 = y , y 1 , … ) such thatt π ( y , y n + 1 ) < t ( x , y n ) for all n . Necessary and sufficient conditions on F are given for this to occur. When the support of F is unbounded, we also obtain results on the number of edges with large passage time used by geodesics. © 2014 Wiley Periodicals, Inc. Random Struct. Alg., 47, 414–423, 2015

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom