Random walks, capacity and percolation on trees (Q1203667): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Heinrich Hering / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Heinrich Hering / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1214/aop/1176989540 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966680551 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:03, 19 March 2024

scientific article
Language Label Description Also known as
English
Random walks, capacity and percolation on trees
scientific article

    Statements

    Random walks, capacity and percolation on trees (English)
    0 references
    0 references
    22 February 1993
    0 references
    Technically at the heart of this paper there are closely related inequalities for the crossing probabilities of random walks and percolation on trees. They are first proved by elementary algebraic methods. Then an equivalent formulation based on capacity is given, extending a result of A. H. Fan on random interval coverings. It is applied to generalize S. N. Evans' result on random labeling of trees. The correspondence between random walks and percolation is used to decide whether certain random walks on trees are transient or recurrent almost surely. Finally, several new results on branching processes in varying environment are obtained.
    0 references
    percolation on trees
    0 references
    random interval coverings
    0 references
    random walks
    0 references
    percolation
    0 references
    branching processes in varying environment
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references