Large deviations in first-passage percolation (Q1429121): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aoap/1069786513 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987057244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-passage percolation, network flows and electrical resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3738376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-passage percolation on the square lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supercritical behaviors in first-passage percolation / rank
 
Normal rank

Latest revision as of 16:41, 6 June 2024

scientific article
Language Label Description Also known as
English
Large deviations in first-passage percolation
scientific article

    Statements

    Large deviations in first-passage percolation (English)
    0 references
    0 references
    0 references
    30 March 2004
    0 references
    A specific probability space and measure are associated with nonnegative independent identically distributed random variables which are attached to normalized edges of a graph in (\(d>2\))-dimensional space. Each sample path between two vertices is an alternating sequence of vertices and edges with fixed end-points. Among various passage times, the face-face and point-point first-passage times are of major interest. The paper focuses on their limiting behaviour when the number of edges grows to infinity. Most limit behaviors in first passage percolation are obtained by using subadditive arguments which do not work in the limit. Technical Theorems 1-3 resolve this difficulty by employing the min-cut and max-flow theorems and setting up a multi-subadditive argument.
    0 references
    0 references
    first-passage percolation
    0 references
    large deviations
    0 references
    random variables on graphs
    0 references
    dynamics on graphs
    0 references
    0 references