Negative association in uniform forests and connected graphs

DOI10.1002/rsa.20012zbMath1048.60007arXivmath/0302185OpenAlexW2949117595MaRDI QIDQ4739581

S. N. Winkler, Geoffrey R. Grimmett

Publication date: 6 August 2004

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0302185

zbMATH Keywords

negative associationuniform spanning treeuniform connected graphuniform forest

Mathematics Subject Classification ID

Trees (05C05) Combinatorial probability (60C05)

Related Items (max. 100)

Random spanning forests and hyperbolic symmetry ⋮ Evaluations of Tutte polynomials of regular graphs ⋮ On combinatorial testing problems ⋮ Upper bound for the number of spanning forests of regular graphs ⋮ Correlated Matroids ⋮ Lorentzian polynomials ⋮ The edge correlation of random forests ⋮ Negative Correlation in Graphs and Matroids ⋮ Negative Dependence and Srinivasan's Sampling Process ⋮ A strong log-concavity property for measures on Boolean algebras ⋮ The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\) ⋮ Negative correlation and log-concavity ⋮ Some Inequalities for Whitney–Tutte Polynomials ⋮ A combinatorial proof of the Rayleigh formula for graphs ⋮ On the number of forests and connected spanning subgraphs

Cites Work

• Probability on Trees and Networks
• Percolation
• A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Negative association in uniform forests and connected graphs