Hostname: page-component-586b7cd67f-t7czq Total loading time: 0 Render date: 2024-11-24T23:15:04.676Z Has data issue: false hasContentIssue false
  • English
  • Français

Correlated Matroids

Published online by Cambridge University Press:  01 July 2008

CLIFFORD C. COCKS
CLIFFORD C. COCKS*
Affiliation:
GCHQ, Hubble Road, Cheltenham, Glos, GL51 OEX, UK (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Semple and Welsh [5] introduced the concept of correlated matroids, which relate to conjectures by Grimmett and Winkler [2], and Pemantle [4], respectively, that the uniformly random forest and the uniformly random connected subgraph of a finite graph have the edge-negative-association property. In this paper, we extend results of Semple and Welsh, and show that the Grimmett and Winkler, and Pemantle conjectures are equivalent to statements about correlated graphic matroids. We also answer some open questions raised in [5] regarding correlated matroids, and in particular show that the 2-sum of correlated matroids is correlated.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 17 , Issue 4 , July 2008 , pp. 511 - 518
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Choe, Y.-B. and Wagner, D. G. (2006) Rayleigh matroids. Combin. Probab. Comput. 15 765–781.CrossRefGoogle Scholar
[2]Grimmett, G. R. and Winkler, S. N. (2004) Negative association in uniform forests and connected graphs. Random Struct. Alg. 24 444–460.CrossRefGoogle Scholar
[3]Oxley, J. G. (1992) Matroid Theory, Oxford University Press.Google Scholar
[4]Pemantle, R. (2000) Towards a theory of negative independence. J. Math. Phys. 41 1371–1390.CrossRefGoogle Scholar
[5]Semple, C. and Welsh, D. (2008) Negative correlation in graphs and matroids. Combin. Probab. Comput. 17 423–435.CrossRefGoogle Scholar
[6]Wagner, D. G. (2005) Rank-three matroids are Rayleigh. Electron. J. Combin. 12 #N8 1–11.CrossRefGoogle Scholar