FINITELY DEPENDENT COLORING
From MaRDI portal
Publication:2971028
DOI10.1017/fmp.2016.7zbMath1361.60025arXiv1403.2448OpenAlexW2962728955MaRDI QIDQ2971028
Alexander E. Holroyd, Thomas M. Liggett
Publication date: 4 April 2017
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.2448
Stationary stochastic processes (60G10) Combinatorial probability (60C05) Coloring of graphs and hypergraphs (05C15)
Related Items
Stationary distributions for the Voter model in \(d\geq 3\) are factors of IID, Mallows permutations and finite dependence, Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics, One-dependent colorings of the star graph, Finitely dependent cycle coloring, Long paths and connectivity in 1‐independent random graphs, Finitely dependent processes are finitary, CLT with explicit variance for products of random singular matrices related to Hill’s equation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model
- A note on general sliding window processes
- A recurrence for linear extensions
- Hilbert space representations of \(m\)-dependent processes
- Runs in m-dependent sequences
- Renewal theory for m-dependent variables
- On a problem of Spencer
- Extremal two-correlations of two-valued stationary one-dependent processes
- Asymptotic expansions for potential functions of I.I.D. random fields
- 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
- One-dependent trigonometric determinantal processes are two-block-factors
- An algebraic construction of a class of one-dependent processes
- One-dependent coloring by finitary factors
- On regression representations of stochastic processes
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Symmetric 1-dependent colorings of the integers
- The central limit theorem for dependent random variables
- On degenerate sums of m-dependent variables
- On adding a list of numbers (and other one-dependent determinantal processes)
- Scaling transformations for {0, 1}-valued sequences
- On Dependency Graphs and the Lattice Gas
- Asymptotic Expansions in the Central Limit Theorem for a Special Class ofm-Dependent Random Fields II – Lattice Case
- Necklace Processes Via Pólya Urns
- A Lower Bound on Probabilistic Algorithms for Distributive Ring Coloring
- TRANSFER-MATRIX STUDY OF NEGATIVE-FUGACITY SINGULARITY OF HARD-CORE LATTICE GAS
- On two–block–factor sequences and one–dependence
- Permutations with given peak set
- The Necklace Process
