scientific article; zbMATH DE number 98308
From MaRDI portal
Publication:4022503
zbMATH Open0758.60068MaRDI QIDQ4022503FDOQ4022503
Authors: Mokhtar Konsowa 
Publication date: 17 January 1993
Title of this publication is not available (Why is that?)
Recommendations
- Random walks and the effective resistance of networks
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
- Resistance networks, random walks, and network theorems
- Random walks and electrical resistances in products of graphs
- Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
- On the probabilistic representation of the free effective resistance of infinite graphs
- Random walks and the effective resistance sum rules
- A collection of results concerning electric resistance and simple random walk on distance-regular graphs
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Sums of independent random variables; random walks (60G50)
Cited In (25)
- Sum rules for effective resistances in infinite graphs
- Title not available (Why is that?)
- Cutpoints and resistance of random walk paths
- Effective graph resistance
- Two-point resistances and random walks on stellated regular graphs
- Title not available (Why is that?)
- A resistance bound via an isoperimetric inequality
- A random hierarchical lattice: the series-parallel graph and its properties
- The effective resistance of the \(N\)-cycle graph with four nearest neighbors
- Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs
- Energy of convex sets, shortest paths, and resistance
- Probability, graphs and electrical networks
- Resistance distance distribution in large sparse random graphs
- Random walks and the effective resistance of networks
- Title not available (Why is that?)
- Resistance networks, random walks, and network theorems
- Random walks and the effective resistance sum rules
- Equilibrium Measures on Finite Networks: Effective Resistance and Hitting Time
- Title not available (Why is that?)
- A note on recurrent random walks on graphs.
- Random Paths and Cuts, Electrical Networks, and Reversible Markov Chains
- On the equivalence of cylinder tilings and planar electric networks
- Monotonicity of random walks' states on finite grids
- On the probabilistic representation of the free effective resistance of infinite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022503)
