Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (Q5256387): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57401417, #quickstatements; #temporary_batch_1709751086066
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977396363 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1406.1142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cover time of a random graph with given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to covering problems for random walks on graphs / 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 probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cover Time of Random Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of the preferential attachment graph / 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: Stationary distribution and cover time of random walks on random digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of random geometric graphs / 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: Anatomy of the giant component: the strictly supercritical regime / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight upper bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight lower bound on the cover time for random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Chernoff Bound for Random Walks on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in a random graph near the critical point / 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: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) / rank
 
Normal rank

Latest revision as of 08:19, 10 July 2024

scientific article; zbMATH DE number 6448761
Language Label Description Also known as
English
Cover time of a random graph with a degree sequence II: Allowing vertices of degree two
scientific article; zbMATH DE number 6448761

    Statements

    Cover time of a random graph with a degree sequence II: Allowing vertices of degree two (English)
    0 references
    0 references
    0 references
    0 references
    22 June 2015
    0 references
    random graphs
    0 references
    emerging giant
    0 references
    cover time
    0 references

    Identifiers