Elementary proof of Rayleigh formula for graphs
classification
🧮 math.CO
keywords
rayleighgraphsmonotonicitypresenceproofcombinatorialcorrelatededge
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.