On the cover time and mixing time of random geometric graphs (Q2373731): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.065 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2155869384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for covering times for reversible Markov chains and random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the cover time / 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: Q4471288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / 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: Sharp thresholds For monotone properties in random geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Cover Time for Random Walks on Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / 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: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest edge of the random minimal spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectrum of a random geometric graph is concentrated / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Rates for Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow / 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: The fundamental theorem of electrical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple cover time / rank
 
Normal rank

Revision as of 11:13, 26 June 2024

scientific article
Language Label Description Also known as
English
On the cover time and mixing time of random geometric graphs
scientific article

    Statements

    On the cover time and mixing time of random geometric graphs (English)
    0 references
    0 references
    0 references
    16 July 2007
    0 references
    random walks
    0 references
    cover time
    0 references
    mixing time
    0 references
    random graphs
    0 references

    Identifiers