Random walks and electrical resistances in products of graphs

DOI10.1016/S0166-218X(96)00002-9zbMATH Open0865.05070OpenAlexW1973995684MaRDI QIDQ674924FDOQ674924

Béla Bollobás, Graham Brightwell

Publication date: 16 June 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

random walksresistanceelectrical networksproduct graphsprelocation processproduct of paths

Mathematics Subject Classification ID

Combinatorial probability (60C05) Paths and cycles (05C38) Graph theory (05C99)

Cites Work

• Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (15)

• On the resistance matrix of a graph
• Title not available (Why is that?)
• Slab percolation and phase transitions for the Ising model
• Solution to a conjecture on resistance diameter of lexicographic product of paths
• The bunkbed conjecture on the complete graph
• Title not available (Why is that?)
• Exact two-point resistance, and the simple random walk on the complete graph minus \(N\) edges
• On the resistance diameter of the Cartesian and lexicographic product of paths
• Representation learning for temporal networks using temporal random walk and deep autoencoder
• On Percolation and the Bunkbed Conjecture
• Computation of resistance distance and Kirchhoff index of chain of triangular bipyramid hexahedron
• The Cover Time of Cartesian Product Graphs
• On the resistance diameter of hypercubes
• 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: Random walks and electrical resistances in products of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674924)