Connectivity in Random Matroids

Dukes, W.M.B. (1998) Connectivity in Random Matroids. (Preprint)

Share Twitter Facebook Email

[img] Text

Download (192kB)


We look at f_M(p), the probability that a random matroid (generated by a bernoulli measure on its ground set) is 2-connected. Upper and lower bounds on this value are proven in terms of the number of circuits and dependent sets of the matroid. Another inequality is presented for the case where M is known in terms of connected components. Some results as regards matroid enumeration are given at the end.

Item Type: Article
Divisions: School of Theoretical Physics > Preprints
Date Deposited: 09 Jul 2018 14:08
Last Modified: 18 Jul 2018 10:09

Actions (login required)

View Item View Item


Downloads per month over past year