Correlation bounds for fields and matroids

June Huh, Benjamin Schröter, Botong Wang

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Let G be a finite connected graph, and let T be a spanning tree of G chosen uniformly at random. The work of Kirchhoff on electrical networks can be used to show that the events e1 ϵ T and e2 ϵ T are negatively correlated for any distinct edges e1 and e2. What can be said for such events when the underlying matroid is not necessarily graphic? We use Hodge theory for matroids to bound the correlation between the events e ϵ B, where B is a randomly chosen basis of a matroid. As an application, we prove Mason's conjecture that the number of k-element independent sets of a matroid forms an ultra-log-concave sequence in k.

Original languageEnglish (US)
Pages (from-to)1335-1351
Number of pages17
JournalJournal of the European Mathematical Society
Volume24
Issue number4
DOIs
StatePublished - 2021

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Applied Mathematics

Keywords

  • Hodge theory
  • Matroid
  • correlation

Fingerprint

Dive into the research topics of 'Correlation bounds for fields and matroids'. Together they form a unique fingerprint.

Cite this