Birth and death chains on finite trees: computing their stationary distribution and hitting times (Q292363): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1633746
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Daniel A. Quiroz / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JDQZ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CSparse / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158686591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut-off and Escape Behaviors for Birth and Death Chains on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birth and death processes on certain random trees: classification and stationary laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3855869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birth-death processes on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on expected hitting times for birth and death chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hitting times of random walks on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast random generation of binary, t-ary and other types of trees / rank
 
Normal rank

Latest revision as of 03:24, 12 July 2024

scientific article
Language Label Description Also known as
English
Birth and death chains on finite trees: computing their stationary distribution and hitting times
scientific article

    Statements

    Birth and death chains on finite trees: computing their stationary distribution and hitting times (English)
    0 references
    0 references
    0 references
    8 June 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    birth-and-death chains
    0 references
    finite trees
    0 references
    random walk
    0 references
    stationary distribution
    0 references
    hitting times
    0 references
    algorithm
    0 references
    effective resistance
    0 references
    conductance
    0 references
    star graph
    0 references
    0 references
    0 references
    0 references
    0 references