Commute times of random walks on trees (Q1949106)

From MaRDI portal
Revision as of 18:29, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Commute times of random walks on trees
scientific article

    Statements

    Commute times of random walks on trees (English)
    0 references
    0 references
    0 references
    0 references
    25 April 2013
    0 references
    A random weighted tree is considered in which every vertex at the same distance from the root has the same degree. The commute time is investigated for a random walk from the root to level n in the tree and back. Asymptotic results for large \(n\) are given when the random outdegree of each vertex is either 1 or 2 according to various probability distributions.
    0 references
    random walk
    0 references
    commute time
    0 references
    spherically symmetric tree
    0 references
    resistance
    0 references
    random weighted tree
    0 references

    Identifiers

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