The following pages link to (Q4022503):
Displaying 19 items.
- Effective graph resistance (Q550630) (← links)
- Random walks and the effective resistance sum rules (Q602687) (← links)
- Random walks and electrical resistances in products of graphs (Q674924) (← links)
- Random walks and the effective resistance of networks (Q756281) (← links)
- The combinatorics of effective resistances and resistive inverses (Q1281506) (← links)
- The discrete Einstein relation (Q1382938) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges (Q1933581) (← links)
- A note on recurrent random walks on graphs. (Q1963710) (← links)
- The effective resistance of the \(N\)-cycle graph with four nearest neighbors (Q2016572) (← links)
- On the equivalence of cylinder tilings and planar electric networks (Q2192134) (← links)
- A resistance bound via an isoperimetric inequality (Q2368594) (← links)
- Sum rules for effective resistances in infinite graphs (Q3303030) (← links)
- (Q4347881) (← links)
- Two-point resistances and random walks on stellated regular graphs (Q5051131) (← links)
- Resistance distance distribution in large sparse random graphs (Q5078649) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)
- Random walk hitting times and effective resistance in sparsely connected Erdős‐Rényi random graphs (Q6055380) (← links)
- On the probabilistic representation of the free effective resistance of infinite graphs (Q6071169) (← links)
