The Edge Correlation of Random Forests |
| |
Authors: | Dudley Stark |
| |
Institution: | 1. School of Mathematical Sciences, Queen Mary, University of London, London, E1 4NS, United Kingdom
|
| |
Abstract: | The conjecture was made by Kahn that a spanning forest F chosen uniformly at random from all forests of any finite graph G has the edge-negative association property. If true, the conjecture would mean that given any two edges ε1 and ε2 in G, the inequality
\mathbbP(e1 ? F, e2 ? F) £ \mathbbP(e1 ? F)\mathbbP(e2 ? F){{\mathbb{P}(\varepsilon_{1} \in \mathbf{F}, \varepsilon_{2} \in \mathbf{F}) \leq \mathbb{P}(\varepsilon_{1} \in \mathbf{F})\mathbb{P}(\varepsilon_{2} \in \mathbf{F})}} would hold. We use enumerative methods to show that this conjecture is true for n large enough when G is a complete graph on n vertices. We derive explicit related results for random trees. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|