First order convergence of matroids
From MaRDI portal
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.
Recommendations
- Deciding first order properties of matroids
- Convexity in ordered matroids and the generalized external order
- Matroids on partially ordered sets
- Matroid rank functions and discrete concavity
- Matroid inequalities
- A Tverberg type theorem for matroids
- On a generalization of the matroid
- Publication:4893198
- Matroids
- scientific article; zbMATH DE number 1028231
Cites work
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A Parametrized Algorithm for Matroid Branch-Width
- A measure-theoretic approach to the theory of dense hypergraphs
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- Axioms for infinite matroids
- Branch-width, parse trees, and monadic second-order logic for matroids.
- Computing Representations of Matroids of Bounded Branch-Width
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Deciding first order properties of matroids
- Large networks and graph limits
- Left and right convergence of graphs with bounded degree
- Limits of dense graph sequences
- Limits of locally-globally convergent graph sequences
- Limits of permutation sequences
- On Matroid Representability and Minor Problems
- On limits of finite graphs
- Poset limits and exchangeable random posets
- Poset limits can be totally ordered
- Processes on unimodular random networks
- Quasirandom permutations are characterized by 4-point densities
- Recognizing graphic matroids
- Recurrence of distributional limits of finite planar graphs
- Sparse graphs: metrics and random models
- Sparsity. Graphs, structures, and algorithms
- Testing branch-width
- Testing properties of graphs and functions
- The computational complexity of matroid properties
- Unavoidable minors of graphs of large type
Cited in
(10)- Obstructions for bounded branch-depth in matroids
- The matroid of a graphing
- Branch-depth: generalizing tree-depth of graphs
- Matrices of optimal tree-depth and a row-invariant parameterized algorithm for integer programming
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Pathwidth vs Cocircumference
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- First order limits of sparse graphs: plane trees and path-width
- Existence of modeling limits for sequences of sparse structures
- Limits of mappings
This page was built for publication: First order convergence of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326662)
