On the equivalence of cylinder tilings and planar electric networks

DOI10.1016/J.DAM.2020.03.006MaRDI QIDQ2192134zbMATH OpenOpenAlexFDO

Authors Ben Amiet, Greg Markowsky, José Luis Palacios

Publication date 29 June 2020

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

Full work available at URL https://doi.org/10.1016/j.dam.2020.03.006

zbMATH Keywords

random walksplanar graphstilingselectric resistance

Mathematics Subject Classification ID

Applications of graph theory (05C90) Sums of independent random variables; random walks (60G50) Applications of renewal theory (reliability, demand theory, etc.) (60K10) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Random walks on graphs (05C81) Applications of graph theory to circuits and networks (94C15) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Recommendations

• Random walks and harmonic functions on infinite planar graphs using square tilings
• Planar electric networks. II
• Inverse problem in cylindrical electrical networks
• scientific article; zbMATH DE number 98308
• Uniform tiling with electrical resistors

Cites work

• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• Decomposing hitting times of walks on graphs into simpler ones
• Random walks and the effective resistance of networks
• The dissection of rectangles into squares
• The electrical resistance of a graph captures its commute and cover times

This page was built for publication: On the equivalence of cylinder tilings and planar electric networks

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