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.
- 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)
- Cover time in edge-uniform stochastically-evolving graphs (Q2283819) (← links)
- Return probability and recurrence for the random walk driven by two-dimensional Gaussian free field (Q2288111) (← links)
- Does adding more agents make a difference? A case study of cover time for the rotor-router (Q2323346) (← links)
- Laplacian spectra for categorical product networks and its applications (Q2333608) (← links)
- A characterization of effective resistance metrics (Q2334560) (← links)
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications (Q2335795) (← links)
- Resistance distances in Cayley graphs on symmetric groups (Q2357139) (← links)
- A resistance bound via an isoperimetric inequality (Q2368594) (← links)
- On the cover time and mixing time of random geometric graphs (Q2373731) (← links)
- Simple random walk on the uniform infinite planar quadrangulation: Subdiffusivity via pioneer points (Q2375765) (← links)
- Decomposing hitting times of walks on graphs into simpler ones (Q2404178) (← links)
- Computing an expected hitting time for the 3-urn Ehrenfest model via electric networks (Q2406776) (← links)
- Length lower bounds for reflecting sequences and universal traversal sequences (Q2407040) (← links)
- Approximate span programs (Q2414858) (← links)
- Commute times for a directed graph using an asymmetric Laplacian (Q2431186) (← links)
- A recursion formula for resistance distances and its applications (Q2444563) (← links)
- Asymptotics of cover times via Gaussian free fields: bounded-degree graphs and general trees (Q2447331) (← links)
- On state estimation for nonlinear systems under random access wireless protocols (Q2683503) (← links)
- Average Resistance of Toroidal Graphs (Q2942289) (← links)
- Incremental Computation of Pseudo-Inverse of Laplacian (Q2942445) (← links)
- The Evolution of the Cover Time (Q2998848) (← links)
- The Cover Time of Cartesian Product Graphs (Q3000524) (← links)
- Randomly biased walks on subcritical trees (Q3165462) (← links)
- Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time (Q3176187) (← links)
- Extrema of the Two-Dimensional Discrete Gaussian Free Field (Q3294679) (← links)
- Maximum hitting time for random walks on graphs (Q3970909) (← links)
- A tight upper bound on the cover time for random walks on graphs (Q4322474) (← links)
- (Q4347881) (← links)
- Communication Lower Bounds via Critical Block Sensitivity (Q4554052) (← links)
- An Electric Network for Nonreversible Markov Chains (Q4576532) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- Effective Resistance Preserving Directed Graph Symmetrization (Q4615300) (← links)
- Biased random walks on random graphs (Q4641984) (← links)
- Expected hitting times for random walks on quadrilateral graphs and their applications (Q4689926) (← links)
- A tight lower bound on the cover time for random walks on graphs (Q4845080) (← links)
- Circuit Theory and Model-Based Inference for Landscape Connectivity (Q4916923) (← links)
- Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters (Q4959293) (← links)
- Chung-Yau Invariants and Graphs with Symmetric Hitting Times (Q4978297) (← links)
- Graph Clustering using Effective Resistance (Q4993308) (← links)
- Trapping efficiency of random walks on weighted scale-free trees (Q5006965) (← links)
- Two-point resistances and random walks on stellated regular graphs (Q5051131) (← links)
- Spectral analysis of three invariants associated to random walks on rounded networks with 2<i>n</i>-pentagons (Q5063462) (← links)
- (Q5090445) (← links)
- (Q5091254) (← links)
- A Spectral Approach to Network Design (Q5092510) (← links)
- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs (Q5094176) (← links)
