The electrical resistance of a graph captures its commute and cover times (Q1386176): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time taken by random walks on finite groups to visit every state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and expanders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Random Walks on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Applications of Inductive Counting for Complementation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the length of universal traversal sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the cover time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random polynomial-time algorithm for approximating the volume of convex bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expanding graphs contain all small trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover time of random walks on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for eigenvalues of certain stochastic matrices / 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: Constructing disjoint paths on expander graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cover time of a regular expander is O(n log n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of electrical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time to traverse all edges of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Technique for Lower Bounding the Cover Time / rank
 
Normal rank

Latest revision as of 11:33, 28 May 2024

scientific article
Language Label Description Also known as
English
The electrical resistance of a graph captures its commute and cover times
scientific article

    Statements

    The electrical resistance of a graph captures its commute and cover times (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 January 1999
    0 references
    random walk
    0 references
    resistance
    0 references
    cover time
    0 references
    commute time
    0 references

    Identifiers