Mixing time of near-critical random graphs (Q428137): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C81 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60J10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6047797 / rank
 
Normal rank
Property / zbMATH Keywords
 
random graphs
Property / zbMATH Keywords: random graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
random walk
Property / zbMATH Keywords: random walk / rank
 
Normal rank
Property / zbMATH Keywords
 
mixing time
Property / zbMATH Keywords: mixing time / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0908.3870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing times for uniformly ergodic Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixing time of the giant component of a random graph / 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 Evolution of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / 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: Diameters in Supercritical Random Graphs Via First Passage Percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anatomy of a young giant component in the random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / 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: Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poisson Cloning Model for Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster mixing via average conductance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component behavior near the critical point of the random graph process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability on Trees and Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isoperimetry and heat kernel decay on percolation clusters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422650 / 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: Q4208453 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of Sparse Random 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: Random walks and the effective resistance of networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Mixing time of near-critical random graphs
scientific article

    Statements

    Mixing time of near-critical random graphs (English)
    0 references
    0 references
    0 references
    0 references
    19 June 2012
    0 references
    random graphs
    0 references
    random walk
    0 references
    mixing time
    0 references
    0 references
    0 references
    0 references
    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