Natural quasirandomness properties
From MaRDI portal
Abstract: The theory of quasirandomness has greatly expanded from its inaugural graph theoretical setting to several different combinatorial objects such as hypergraphs, tournaments, permutations, etc. However, these quasirandomness variants have been done in an ad-hoc case-by-case manner. In this paper, we propose three new hierarchies of quasirandomness properties that can be naturally defined for arbitrary combinatorial objects. Our properties are also "natural" in more formal sense: they are preserved by local combinatorial constructions (encoded by open interpretations). We show that our quasirandomness properties have several different but equivalent characterizations that are similar to hypergraph quasirandomness properties. We also prove several implications and separations comparing them to each other and to what has been known for hypergraphs. The main notion explored by our statements and proofs is that of unique coupleability: two limit objects are uniquely coupleable if there is a unique limit object in the combined theory that is an alignment (i.e., a coupling) of these two objects.
Recommendations
Cites work
- σ-algebras for quasirandom hypergraphs
- A central limit theorem for a new statistic on permutations
- A measure-theoretic approach to the theory of dense hypergraphs
- A note on even cycles and quasirandom tournaments
- Characterization of quasirandom permutations by a pattern sum
- Eigenvalues and linear quasirandom hypergraphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Flag algebras
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Hereditary quasirandom properties of hypergraphs
- Hereditary quasirandomness without regularity
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 747030 (Why is no real title available?)
- scientific article; zbMATH DE number 3443668 (Why is no real title available?)
- Hypergraphs, quasi-randomness, and conditions for regularity
- Large networks and graph limits
- Limits of dense graph sequences
- Moments of two-variable functions and the uniqueness of graph limits
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- On the density of transitive tournaments
- On the statistics of vision: The Julesz conjecture
- Quasi-random graphs
- Quasi-random graphs and graph limits
- Quasi-random hypergraphs
- Quasi-random tournaments
- Quasi-randomness and the distribution of copies of a fixed graph
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasirandom arithmetic permutations
- Quasirandom permutations
- Quasirandom permutations are characterized by 4-point densities
- Quasirandomness in hypergraphs
- Quasi‐random classes of hypergraphs
- Semantic limits of dense combinatorial objects
- The poset of hypergraph quasirandomness
- Unseparated pairs and fixed points in random permutations
- Weak hypergraph regularity and linear hypergraphs
Cited in
(7)- Hereditary quasirandomness without regularity
- scientific article; zbMATH DE number 1872987 (Why is no real title available?)
- Quasirandom-Forcing Orientations of Cycles
- Forcing generalised quasirandom graphs efficiently
- Weak randomness in graphons and theons
- Forcing quasirandomness in a regular tournament
- Strong modeling limits of graphs with bounded tree-width
This page was built for publication: Natural quasirandomness properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076730)
