Pages that link to "Item:Q1386176"
From MaRDI portal
The following pages link to The electrical resistance of a graph captures its commute and cover times (Q1386176):
Displaying 50 items.
- Stable limit laws for randomly biased walks on supercritical trees (Q373593) (← links)
- Mixing time of near-critical random graphs (Q428137) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Cover times, blanket times, and majorizing measures (Q431644) (← links)
- An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification (Q448318) (← links)
- Concentration of the Kirchhoff index for Erdős-Rényi graphs (Q473412) (← links)
- Potential induced random teleportation on finite graphs (Q493692) (← links)
- Effective resistances for supercritical percolation clusters in boxes (Q500798) (← links)
- Tight bounds for the cover time of multiple random walks (Q541669) (← links)
- On the inverse mean first passage matrix problem and the inverse \(M\)-matrix problem (Q630504) (← links)
- Random walks and flights over connected graphs and complex networks (Q718283) (← links)
- Random walks and the effective resistance of networks (Q756281) (← links)
- Some further results on the maximal hitting times of trees with some given parameters (Q833005) (← links)
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs (Q898134) (← links)
- Critical random graphs: Diameter and mixing time (Q941296) (← links)
- Convergence of metric graphs and energy forms (Q986612) (← links)
- On hitting times of random walks on trees (Q1003428) (← links)
- The Alexander-Orbach conjecture holds in high dimensions (Q1038723) (← links)
- Expected cover times of random walks on symmetric graphs (Q1194485) (← links)
- Resistance bounds for first-passage percolation and maximum flow (Q1284477) (← links)
- On the mean and variance of cover times for random walks on graphs (Q1353782) (← links)
- A spectrum of time-space trade-offs for undirected \(s-t\) connectivity (Q1356886) (← links)
- Collecting coupons on trees, and the cover time of random walks (Q1386177) (← links)
- Harmonic analysis for resistance forms. (Q1421836) (← links)
- Further results on the expected hitting time, the cover cost and the related invariants of graphs (Q1618224) (← links)
- The resistance perturbation distance: a metric for the analysis of dynamic networks (Q1693161) (← links)
- Optimizing network robustness by edge rewiring: a general framework (Q1741288) (← links)
- Developments in the theory of randomized shortest paths with a comparison of graph node distances (Q1782487) (← links)
- Universal traversal sequences with backtracking. (Q1872734) (← links)
- The effective resistance of the \(N\)-cycle graph with four nearest neighbors (Q2016572) (← links)
- On planar graphs of uniform polynomial growth (Q2041656) (← links)
- Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs (Q2043378) (← links)
- The hitting times of random walks on bicyclic graphs (Q2053698) (← links)
- On the resistance diameter of hypercubes (Q2067117) (← links)
- Effective resistance is more than distance: Laplacians, simplices and the Schur complement (Q2074965) (← links)
- Kemeny's constant for a graph with bridges (Q2081463) (← links)
- Coalescing and branching simple symmetric exclusion process (Q2083266) (← links)
- Dumbbell graphs with extremal (reverse) cover cost (Q2107445) (← links)
- The local limit of uniform spanning trees (Q2128107) (← links)
- Graph coarsening: from scientific computing to machine learning (Q2128866) (← links)
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain (Q2141848) (← links)
- Minimising the expected commute time (Q2145796) (← links)
- Spectral analysis for a family of treelike networks (Q2149621) (← links)
- A discrete random walk on the hypercube (Q2150085) (← links)
- Hitting time quasi-metric and its forest representation (Q2174870) (← links)
- Random walk on barely supercritical branching random walk (Q2182117) (← links)
- Inferring models of gene expression dynamics (Q2186487) (← links)
- On the equivalence of cylinder tilings and planar electric networks (Q2192134) (← links)
- Random walks on graphs and Monte Carlo methods (Q2229041) (← links)
- Cover times for sequences of reversible Markov chains on random graphs (Q2258610) (← links)
