The cover time of random geometric graphs (Q2998891): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57401454, #quickstatements; #temporary_batch_1711504539957
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the cover time and mixing time of random geometric 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 sparse random graphs / 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: The Cover Time of Random Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / 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: Q5798359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Internets in the sky: The capacity of three dimensional wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / rank
 
Normal rank

Latest revision as of 01:43, 4 July 2024

scientific article
Language Label Description Also known as
English
The cover time of random geometric graphs
scientific article

    Statements

    The cover time of random geometric graphs (English)
    0 references
    0 references
    0 references
    0 references
    11 May 2011
    0 references
    0 references
    random walk
    0 references
    cover time
    0 references
    ad-hoc wireless network
    0 references
    random geometric graph
    0 references
    0 references
    0 references