Elementary proof of Rayleigh formula for graphs
From MaRDI portal
Publication:6208948
arXiv0803.4395MaRDI QIDQ6208948FDOQ6208948
Publication date: 31 March 2008
Abstract: The Rayleigh monotonicity is a principle from the theory of electrical networks. Its combinatorial interpretation says for each two edges of a graph G, that the presence of one of them in a random spanning tree of G is negatively correlated with the presence of the other edge. In this paper we give a self-contained (inductive) proof of Rayleigh monotonicity for graphs.
This page was built for publication: Elementary proof of Rayleigh formula for graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6208948)
