On the sampling entropy of permutons
From MaRDI portal
Cites work
- Entropy of interval maps via permutations
- Ergodic theory and dynamical systems. Translated from the French by Reinie Erné
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Finitely forcible graphons and permutons
- Graph properties, graph limits, and entropy
- Graphons, cut norm and distance, couplings and rearrangements
- scientific article; zbMATH DE number 3233336 (Why is no real title available?)
- Limits of permutation sequences
- Locally uniform random permutations with large increasing subsequences
- On pattern-avoiding permutons
- Periodic oscillations in the analysis of algorithms and their cancellations
- Periodic points and shadowing for generic Lebesgue measure-preserving interval maps
- Permutations with fixed pattern densities
- Quasirandom permutations are characterized by 4-point densities
- Scaling limits of permutation classes with a finite specification: a dichotomy
- Self-averaging sequences which fail to converge
- Simple permutations and pattern restricted permutations
- The asymptotic probability of a tie for first place
- The entropy of random-free graphons and properties
- The method of creative telescoping
- The permuton limit of random recursive separable permutations
- The runsort permuton
- Typical properties of interval maps preserving the Lebesgue measure
- Universal limits of substitution-closed permutation classes
This page was built for publication: On the sampling entropy of permutons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7319726)
