Linking the mixing times of random walks on static and dynamic random graphs (Q2080276): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Luca Avena / rank
 
Normal rank
Property / author
 
Property / author: W. Th. F. den Hollander / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3117655282 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2012.11012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times of random walks on dynamic configuration models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on dynamic configuration models: a trichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover time and mixing time of random walks on dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold for cutoff in two-community random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff for nonbacktracking random walks on sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the Voter Model in Dynamic Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk on sparse random digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff at the ``entropic time'' for sparse Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time trichotomy in regenerating dynamic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time of PageRank surfers on sparse random digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter in ultra‐small scale‐free random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up Markov chains with deterministic jumps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information spreading in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Rumor Spreading in Dynamic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison principle for random walk on dynamical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in random graphs with finite variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances in random graphs with finite mean and infinite variance degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: When is a scale-free graph ultra-small? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff phenomena for random walks on random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time for random walk on supercritical dynamical percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computation in dynamic networks via random walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutoff for random walk on dynamical Erdős-Rényi graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regeneration-enriched Markov processes with application to Monte Carlo / rank
 
Normal rank

Latest revision as of 07:44, 30 July 2024

scientific article
Language Label Description Also known as
English
Linking the mixing times of random walks on static and dynamic random graphs
scientific article

    Statements

    Linking the mixing times of random walks on static and dynamic random graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2022
    0 references
    configuration model
    0 references
    random rewiring
    0 references
    random walk
    0 references
    mixing time
    0 references
    cutoff
    0 references
    0 references
    0 references

    Identifiers

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