Random Trees in Electrical Networks

2006/07/01 by Hariharan Narayanan, H. Narayanan, Narayanan, Hariharan
Computer Science · Mathematics · #60B99 #Algorithms and Data Compression #Complexity and Algorithms in Graphs #FOS: Mathematics #Markov Chains and Monte Carlo Methods #Probability (math.PR) #math.PR #msc:60B99

paper · pdf · doi:10.48550/arxiv.math/0607011

The results are for the most part not new

openalex publication_date 2006/07/01 · arxiv created 2012/01/15 · arxiv updated 2012/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper contains results relating currents and voltages in resistive networks to appropriate random trees or forests in those networks.

Related

• The homogenous tree as an electric network
• Random Electrical Networks on Complete Graphs II: Proofs
• Resistance growth of branching random networks
• Explicit Rayleigh's Principles for Resistive Electrical Network and The Total Number of Spanning Trees of Graphs
• Fractal and Multifractal Scaling of Electrical Conduction in Random Resistor Networks