Random walks and the effective resistance of networks
From MaRDI portal
Publication:756281
DOI10.1007/BF01046996zbMath0722.60070OpenAlexW1986269714MaRDI QIDQ756281
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
Sums of independent random variables; random walks (60G50) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Related Items (only showing first 100 items - show all)
Further results on the expected hitting time, the cover cost and the related invariants of graphs ⋮ Flow distances on open flow networks ⋮ Which values of the volume growth and escape time exponent are possible for a graph? ⋮ Some further results on the maximal hitting times of trees with some given parameters ⋮ Reconstruction of graphs based on random walks ⋮ Using genetic data to estimate diffusion rates in heterogeneous landscapes ⋮ Random Walks with the Minimum Degree Local Rule Have $O(n^2)$ Cover Time ⋮ On the resistance distance and Kirchhoff index of a linear hexagonal (cylinder) chain ⋮ A fast randomized LOGSPACE algorithm for graph connectivity ⋮ Extension of Foster's averaging formula to infinite networks with moderate growth ⋮ Frames and factorization of graph Laplacians ⋮ A spectrum of time-space trade-offs for undirected \(s-t\) connectivity ⋮ The Hitting Time of Multiple Random Walks ⋮ Resistance distance distribution in large sparse random graphs ⋮ The first two cacti with larger multiplicative eccentricity resistance-distance ⋮ Explicit determination of three invariants associated with random walks on n-prism networks ⋮ Resistance distance and the normalized Laplacian spectrum ⋮ Random walks and the effective resistance sum rules ⋮ Geometry of complex networks and topological centrality ⋮ Extremal hitting times of trees with some given parameters ⋮ Random walks on edge transitive graphs ⋮ A note on expected hitting times for birth and death chains ⋮ The discrete Einstein relation ⋮ Incremental Computation of Pseudo-Inverse of Laplacian ⋮ The electrical resistance of a graph captures its commute and cover times ⋮ Collecting coupons on trees, and the cover time of random walks ⋮ A tight lower bound on the cover time for random walks on graphs ⋮ An Extension of Foster's Network Theorem ⋮ Infinite stable looptrees ⋮ A class of scale-free networks with fractal structure based on subshift of finite type ⋮ On resistance distance of Markov chain and its sum rules ⋮ Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs ⋮ Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition ⋮ On the probabilistic representation of the free effective resistance of infinite graphs ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ On the equivalence of cylinder tilings and planar electric networks ⋮ A tight upper bound on the cover time for random walks on graphs ⋮ Efficiency of transportation on weighted extended Koch networks ⋮ Scaling limit of linearly edge-reinforced random walks on critical Galton-Watson trees ⋮ Hitting times for random walks on tricyclic graphs ⋮ La métrica de resistencia efectiva ⋮ Random walks on dual Sierpinski gaskets ⋮ Mixing time of near-critical random graphs ⋮ Two-point resistances in the generalized phenylenes ⋮ On the first passage time of a simple random walk on a tree ⋮ Cover times, blanket times, and majorizing measures ⋮ Commute times of random walks on trees ⋮ Moran's genetics model via electric networks. ⋮ Random Graphs and Their Subgraphs ⋮ Hitting Times, Cover Cost, and the Wiener Index of a Tree ⋮ Effective Resistance Preserving Directed Graph Symmetrization ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ Markov fundamental tensor and its applications to network analysis ⋮ The expected hitting times for graphs with cutpoints. ⋮ The expected hitting times for finite Markov chains ⋮ Exact results for the first-passage properties in a class of fractal networks ⋮ Potential distribution on random electrical networks ⋮ Resistance between two vertices of almost complete bipartite graphs ⋮ The Evolution of the Cover Time ⋮ Mean trapping time for an arbitrary node on regular hyperbranched polymers ⋮ Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees ⋮ Potential induced random teleportation on finite graphs ⋮ Critical random graphs: Diameter and mixing time ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ Transport properties of random walks on scale-free/regular-lattice hybrid networks ⋮ Bicyclic graphs with extremal cover cost ⋮ Resistance distances in vertex-weighted complete multipartite graphs ⋮ Kirchhoff indexes of a network ⋮ Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory ⋮ The Role of Kemeny's Constant in Properties of Markov Chains ⋮ Efficiency test of pseudorandom number generators using random walks ⋮ The effective resistance of the \(N\)-cycle graph with four nearest neighbors ⋮ Convergence of metric graphs and energy forms ⋮ Random walks and flights over connected graphs and complex networks ⋮ Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees ⋮ Mean first passage time for random walk on dual structure of dendrimer ⋮ Expected hitting times for random walks on quadrilateral graphs and their applications ⋮ On hitting times of random walks on trees ⋮ A New Proof of Foster’s First Theorem ⋮ Expected hitting times for random walks on the diamond hierarchical graphs involving some classical parameters ⋮ Brownian motion on stable looptrees ⋮ Kemeny's constant and Kirchhoffian indices for conjoined highly symmetric graphs ⋮ The hitting times of random walks on bicyclic graphs ⋮ Chung-Yau Invariants and Graphs with Symmetric Hitting Times ⋮ The combinatorics of effective resistances and resistive inverses ⋮ Random walks on a finite graph with congestion points ⋮ Diffusion processes on small-world networks with distance dependent random links ⋮ New Bounds for Edge-Cover by Random Walk ⋮ COVER TIME FOR THE FROG MODEL ON TREES ⋮ Metric graphs, cross ratios, and Rayleigh's laws ⋮ Non-uniform random spanning trees on weighted graphs ⋮ Improved approximation of the minimum cover time ⋮ Coalescing and branching simple symmetric exclusion process ⋮ Infinite networks and variation of conductance functions in discrete Laplacians ⋮ A characterization of effective resistance metrics ⋮ Expected hitting times for random walks on the \(k\)-triangle graph and their applications ⋮ The hitting time of random walk on unicyclic graphs ⋮ Determining average path length and average trapping time on generalized dual dendrimer ⋮ Dumbbell graphs with extremal (reverse) cover cost ⋮ Anomalous scaling regime for one-dimensional Mott variable-range hopping
Cites Work
This page was built for publication: Random walks and the effective resistance of networks
