One-dependent colorings of the star graph
From MaRDI portal
Publication:6138902
DOI10.1214/22-aap1920arXiv1804.06877OpenAlexW4389342316MaRDI QIDQ6138902
Thomas M. Liggett, Wenpin Tang
Publication date: 16 January 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.06877
Combinatorial probability (60C05) Critical phenomena in equilibrium statistical mechanics (82B27) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Finitely dependent processes are finitary
- Runs in m-dependent sequences
- On a problem of Spencer
- Asymptotic expansions for potential functions of I.I.D. random fields
- Finitary coloring
- An algebraic construction of a class of one-dependent processes
- Finitely dependent cycle coloring
- Mallows permutations and finite dependence
- Localisation-resistant random words with small alphabets
- One-dependent coloring by finitary factors
- Approximations for two-dimensional discrete scan statistics in some block-factor type dependent models
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Symmetric 1-dependent colorings of the integers
- On degenerate sums of m-dependent variables
- FINITELY DEPENDENT COLORING
- On adding a list of numbers (and other one-dependent determinantal processes)
- COPULA-BASED CHARACTERIZATIONS FOR HIGHER ORDER MARKOV PROCESSES
- One-Dependent Regenerative Processes and Queues in Continuous Time
- On Dependency Graphs and the Lattice Gas
- Regenerative steady-state simulation of discrete-event systems
- Arcsine laws for random walks generated from random permutations with applications to genomics
- Asymptotic Methods in Statistics of Random Point Processes
- Scan statistics
This page was built for publication: One-dependent colorings of the star graph
