Paper
Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph
Authors
Pengfei Tang, Zibo Zhang
Abstract
We investigate the pairwise negative correlation (p-NC) property for uniform probability measures on several families of spanning subgraphs of the complete graph $K_n$. Motivated by conjectured negative dependence properties of the random-cluster model with $q<1$, we focus on three natural families: the set of all connected spanning subgraphs, the set of forests with exactly $k$ components, and the set of connected spanning subgraphs with excess $k$, where $k$ is a fixed integer. We prove that for each of these families, the associated uniform measure satisfies the p-NC property provided $n$ is sufficiently large. Our results extend earlier work on uniform forests and provide the first verification of the p-NC property for uniform connected subgraphs and their truncations on complete graphs.
Metadata
Related papers
Fractal universe and quantum gravity made simple
Fabio Briscese, Gianluca Calcagni • 2026-03-25
POLY-SIM: Polyglot Speaker Identification with Missing Modality Grand Challenge 2026 Evaluation Plan
Marta Moscati, Muhammad Saad Saeed, Marina Zanoni, Mubashir Noman, Rohan Kuma... • 2026-03-25
LensWalk: Agentic Video Understanding by Planning How You See in Videos
Keliang Li, Yansong Li, Hongze Shen, Mengdi Liu, Hong Chang, Shiguang Shan • 2026-03-25
Orientation Reconstruction of Proteins using Coulomb Explosions
Tomas André, Alfredo Bellisario, Nicusor Timneanu, Carl Caleman • 2026-03-25
The role of spatial context and multitask learning in the detection of organic and conventional farming systems based on Sentinel-2 time series
Jan Hemmerling, Marcel Schwieder, Philippe Rufin, Leon-Friedrich Thomas, Mire... • 2026-03-25
Raw Data (Debug)
{
"raw_xml": "<entry>\n <id>http://arxiv.org/abs/2603.10738v1</id>\n <title>Pairwise Negative Correlation for Uniform Spanning Subgraphs of the Complete Graph</title>\n <updated>2026-03-11T13:13:58Z</updated>\n <link href='https://arxiv.org/abs/2603.10738v1' rel='alternate' type='text/html'/>\n <link href='https://arxiv.org/pdf/2603.10738v1' rel='related' title='pdf' type='application/pdf'/>\n <summary>We investigate the pairwise negative correlation (p-NC) property for uniform probability measures on several families of spanning subgraphs of the complete graph $K_n$. Motivated by conjectured negative dependence properties of the random-cluster model with $q<1$, we focus on three natural families: the set of all connected spanning subgraphs, the set of forests with exactly $k$ components, and the set of connected spanning subgraphs with excess $k$, where $k$ is a fixed integer. We prove that for each of these families, the associated uniform measure satisfies the p-NC property provided $n$ is sufficiently large. Our results extend earlier work on uniform forests and provide the first verification of the p-NC property for uniform connected subgraphs and their truncations on complete graphs.</summary>\n <category scheme='http://arxiv.org/schemas/atom' term='math.PR'/>\n <category scheme='http://arxiv.org/schemas/atom' term='math.CO'/>\n <published>2026-03-11T13:13:58Z</published>\n <arxiv:comment>52 pages plus an appendix. Comments are very welcome</arxiv:comment>\n <arxiv:primary_category term='math.PR'/>\n <author>\n <name>Pengfei Tang</name>\n </author>\n <author>\n <name>Zibo Zhang</name>\n </author>\n </entry>"
}