The mixing time of the giant component of a random graph (Q2930052): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some Inequalities for Reversible Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Percolation on finite graphs and isoperimetric inequalities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk on the incipient infinite cluster for oriented percolation in high dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walk on the incipient infinite cluster on trees / 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 phase transition in inhomogeneous random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all graphs with 1.44n edges are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time of near-critical random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The diameter of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster mixing and small bottlenecks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The evolution of the mixing rate of a simple random walk on the giant component of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing time bounds via the spectral profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random regular graphs with edge faults: Expansion through cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of edge deletion processes on faulty random regular graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolving sets, mixing and heat kernel bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical random graphs: Diameter and mixing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing and hitting times for finite Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times are hitting times of large sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting connected graphs inside-out / rank
 
Normal rank
Property / cites work
 
Property / cites work: Birth control for giants / rank
 
Normal rank

Revision as of 07:00, 9 July 2024

scientific article
Language Label Description Also known as
English
The mixing time of the giant component of a random graph
scientific article

    Statements

    The mixing time of the giant component of a random graph (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2014
    0 references
    mixing time
    0 references
    random walk
    0 references
    random graph
    0 references
    expander
    0 references
    giant component
    0 references

    Identifiers