Random walks and the effective resistance of networks
From MaRDI portal
Publication:756281
DOI10.1007/BF01046996zbMATH Open0722.60070OpenAlexW1986269714MaRDI QIDQ756281FDOQ756281
Authors: Prasad Tetali 
Publication date: 1991
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01046996
Recommendations
Sums of independent random variables; random walks (60G50) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Cites Work
Cited In (only showing first 100 items - show all)
- The discrete Einstein relation
- Collecting coupons on trees, and the cover time of random walks
- Resistance distances in vertex-weighted complete multipartite graphs
- Commute times of random walks on trees
- The hitting time of random walk on unicyclic graphs
- Title not available (Why is that?)
- A tight lower bound on the cover time for random walks on graphs
- Title not available (Why is that?)
- The evolution of the cover time
- Cutpoints and resistance of random walk paths
- Some further results on the maximal hitting times of trees with some given parameters
- Hitting times, cover cost, and the Wiener index of a tree
- The electrical resistance of a graph captures its commute and cover times
- Reconstruction of graphs based on random walks
- An Extension of Foster's Network Theorem
- Resistance distance and the normalized Laplacian spectrum
- Flow distances on open flow networks
- MFPT calculation for random walks in inhomogeneous networks
- Moran's genetics model via electric networks.
- Further results on the expected hitting time, the cover cost and the related invariants of graphs
- Critical random graphs: Diameter and mixing time
- Mixing time of near-critical random graphs
- Random walks and flights over connected graphs and complex networks
- The hitting time of multiple random walks
- Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
- Expected hitting times for random walks on the \(k\)-triangle graph and their applications
- The combinatorics of effective resistances and resistive inverses
- Chung-Yau invariants and graphs with symmetric hitting times
- Random walks on a finite graph with congestion points
- The effective resistance of the \(N\)-cycle graph with four nearest neighbors
- The hitting times of random walks on bicyclic graphs
- On the first passage time of a simple random walk on a tree
- Title not available (Why is that?)
- The expected hitting times for finite Markov chains
- Kirchhoff indexes of a network
- A spectrum of time-space trade-offs for undirected \(s-t\) connectivity
- Using genetic data to estimate diffusion rates in heterogeneous landscapes
- Non-uniform random spanning trees on weighted graphs
- On the (reverse) cover cost of trees with some given parameters
- Frames and factorization of graph Laplacians
- The role of Kemeny's constant in properties of Markov chains
- Which values of the volume growth and escape time exponent are possible for a graph?
- On hitting times of random walks on trees
- A note on expected hitting times for birth and death chains
- Random walks on edge transitive graphs
- Combinatorial Random Walks on 3-Manifolds
- Incremental computation of pseudo-inverse of Laplacian
- Resistance networks, random walks, and network theorems
- Random graphs and their subgraphs
- Random walks and the effective resistance sum rules
- Potential distribution on random electrical networks
- The expected hitting times for graphs with cutpoints.
- Cover time for the frog model on trees
- Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory
- The first two cacti with larger multiplicative eccentricity resistance-distance
- Potential induced random teleportation on finite graphs
- A fast randomized LOGSPACE algorithm for graph connectivity
- Random walks on dual Sierpinski gaskets
- Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains
- Cover times, blanket times, and majorizing measures
- Hitting times for random walks on subdivision and triangulation graphs
- Expected hitting times for random walks on quadrilateral graphs and their applications
- On the probabilistic representation of the free effective resistance of infinite graphs
- On resistance distance of Markov chain and its sum rules
- Convergence of metric graphs and energy forms
- A class of scale-free networks with fractal structure based on subshift of finite type
- A tight upper bound on the cover time for random walks on graphs
- Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters
- Efficiency of transportation on weighted extended Koch networks
- Dumbbell graphs with extremal (reverse) cover cost
- Bicyclic graphs with extremal cover cost
- Resistance between two vertices of almost complete bipartite graphs
- Average resistance of toroidal graphs
- Electrical networks with prescribed current and applications to random walks on graphs
- Extremal hitting times of trees with some given parameters
- Two-point resistances and random walks on stellated regular graphs
- Explicit determination of three invariants associated with random walks on \(n\)-prism networks
- Determining average path length and average trapping time on generalized dual dendrimer
- La métrica de resistencia efectiva
- Extension of Foster's averaging formula to infinite networks with moderate growth
- Transport properties of random walks on scale-free/regular-lattice hybrid networks
- Brownian motion on stable looptrees
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
- On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain
- Geometry of complex networks and topological centrality
- Hitting times for random walks on tricyclic graphs
- Efficiency test of pseudorandom number generators using random walks
- Random walks on decorated Galton-Watson trees
- Random walks with the minimum degree local rule have \(O(n^2)\) cover time
- On the notion of effective impedance
- Probability, graphs and electrical networks
- Resistance distance distribution in large sparse random graphs
- Mean first passage time for random walk on dual structure of dendrimer
- Anomalous scaling regime for one-dimensional Mott variable-range hopping
- Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
- Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs
- Infinite stable looptrees
- Cover and hitting times of hyperbolic random graphs
- A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees
- Equilibrium Measures on Finite Networks: Effective Resistance and Hitting Time
This page was built for publication: Random walks and the effective resistance of networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756281)
