Cover times for sequences of reversible Markov chains on random graphs (Q2258610): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Diophantine equation \(x (x + 1) \dots (x + n) + 1 = y^2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk covering of some special trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Evolution of the Cover Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A resistance bound via an isoperimetric inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the mixing time of a simple random walk on the super critical percolation cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: The electrical resistance of a graph captures its commute and cover times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of the giant component of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk on the range of random walk / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of mixing times for sequences of random walks on finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on Galton-Watson trees with infinite variance offspring distribution conditioned to survive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover times, blanket times, and majorizing measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cover Time for Random Walks on Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdiffusive behavior of random walk on a random cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering problems for Brownian motion on spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new limit theorems for the critical branching process allowing immigration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on percolation on \(\mathbb Z^d\): isoperimetric profile via exponential cluster repulsion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian free fields for mathematicians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact value of the resistance exponent for four dimensional random walk trace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generic Chaining / rank
 
Normal rank

Latest revision as of 17:43, 9 July 2024

scientific article
Language Label Description Also known as
English
Cover times for sequences of reversible Markov chains on random graphs
scientific article

    Statements

    Cover times for sequences of reversible Markov chains on random graphs (English)
    0 references
    0 references
    26 February 2015
    0 references
    reversible Markov chains
    0 references
    random graphs
    0 references
    cover times
    0 references
    maximal hitting time
    0 references
    Galton-Watson trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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