Mallows permutations and finite dependence
From MaRDI portal
Publication:2184821
DOI10.1214/19-AOP1363zbMath1456.60081arXiv1706.09526OpenAlexW3013166320MaRDI QIDQ2184821
Alexander E. Holroyd, Avi Levy, Tom Hutchcroft
Publication date: 29 May 2020
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.09526
Stationary stochastic processes (60G10) Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15)
Related Items
A central limit theorem for descents of a Mallows permutation and its inverse, Cycles in Mallows random permutations, One-dependent colorings of the star graph, Finitely dependent processes are finitary, Finitary codings for spatial mixing Markov random fields, Arcsine laws for random walks generated from random permutations with applications to genomics, Mallows permutations as stable matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The length of the longest increasing subsequence of a random Mallows permutation
- The two-sided infinite extension of the Mallows model for random permutations
- A note on general sliding window processes
- Finitely dependent insertion processes
- Hilbert space representations of \(m\)-dependent processes
- Finitely dependent processes are finitary
- Runs in m-dependent sequences
- Asymptotic behavior of permutation records
- Renewal theory for m-dependent variables
- Extremal two-correlations of two-valued stationary one-dependent processes
- On the structure of 1-dependent Markov chains
- Combining \(m\)-dependence with Markovness
- On 1-dependent processes and \(k\)-block factors
- Domination by product measures
- Finitary coloring
- Limit theorems for longest monotone subsequences in random Mallows permutations
- One-dependent trigonometric determinantal processes are two-block-factors
- An algebraic construction of a class of one-dependent processes
- Lengths of monotone subsequences in a Mallows permutation
- One-dependent coloring by finitary factors
- On regression representations of stochastic processes
- Symmetric 1-dependent colorings of the integers
- The central limit theorem for dependent random variables
- On degenerate sums of m-dependent variables
- Combinatorics of Permutations
- FINITELY DEPENDENT COLORING
- On adding a list of numbers (and other one-dependent determinantal processes)
- Scaling transformations for {0, 1}-valued sequences
- NON-NULL RANKING MODELS. I
- Asymptotic Expansions in the Central Limit Theorem for a Special Class ofm-Dependent Random Fields II – Lattice Case
- Thermodynamic limit for the Mallows model on Sn
- A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
- Breaking Records and Breaking Boards
- Distribution of the number of consecutive records
- Phase uniqueness for the Mallows measure on permutations
- Lannes’ T functor on injective unstable modules and Harish-Chandra restriction
- Mixing times of the biased card shuffling and the asymmetric exclusion process
- On two–block–factor sequences and one–dependence
- Mallows permutations as stable matchings
- Quantum gravity and the KPZ formula
- The Existence of Probability Measures with Given Marginals
- The maximal and minimal 2-correlation of a class of 1-dependent 0-1 valued processes
- Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques
