First order convergence of matroids
Preprint
Abstract
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse structures. It is known that every first order convergent sequence of graphs with bounded tree-depth can be represented by an analytic limit object called a limit modeling. We establish the matroid counterpart of this result: every first order convergent sequence of matroids with bounded branch-depth representable over a fixed finite field has a limit modeling, i.e., there exists an infinite matroid with the elements forming a probability space that has asymptotically the same first order properties. We show that neither of the bounded branch-depth assumption nor the representability assumption can be removed.Keywords
All Related Versions
This publication has 21 references indexed in Scilit:
- Convergent sequences of sparse graphs: A large deviations approachRandom Structures & Algorithms, 2016
- Axioms for infinite matroidsAdvances in Mathematics, 2013
- Quasirandom permutations are characterized by 4-point densitiesGeometric and Functional Analysis, 2013
- Left and right convergence of graphs with bounded degreeRandom Structures & Algorithms, 2012
- Poset limits and exchangeable random posetsCombinatorica, 2011
- Sparse graphs: Metrics and random modelsRandom Structures & Algorithms, 2011
- Testing properties of graphs and functionsIsrael Journal of Mathematics, 2010
- Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testingAdvances in Mathematics, 2008
- Testing branch-widthJournal of Combinatorial Theory, Series B, 2007
- Recognizing graphic matroidsCombinatorica, 1981