On a problem of Spencer
From MaRDI portal
Recommendations
Cites work
Cited in
(54)- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
- An estimate for the probability of dependent events
- An algorithmic proof of the Lovász local lemma via resampling oracles
- Implementations and the independent set polynomial below the Shearer threshold
- Covering systems with restricted divisibility
- One-dependent colorings of the star graph
- The Ising partition function: zeros and deterministic approximation
- Shearer's point process, the hard-sphere model, and a continuum Lovász local lemma
- Commutativity in the Algorithmic Lovász Local Lemma
- A Kolmogorov complexity proof of the Lovász local lemma for satisfiability
- Entropy compression versus Lovász local lemma
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- Partially independent random variables
- Cayley trees do not determine the maximal zero-free locus of the independence polynomial
- Absence of zeros implies strong spatial mixing
- Directed Lovász local lemma and Shearer's lemma
- Improved bounds on coloring of graphs
- On connectivity in random graph models with limited dependencies
- On a conjecture of Sokal concerning roots of the independence polynomial
- Domination by product measures
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
- Fundamentals of partial rejection sampling
- scientific article; zbMATH DE number 7375995 (Why is no real title available?)
- A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
- Shearer's measure and stochastic domination of product measures
- Packing list‐colorings
- SIR epidemics on a scale-free spatial nested modular network
- \(k\)-independent percolation on trees
- On the zeroes of hypergraph independence polynomials
- On codes with the identifiable parent property
- Zeros, chaotic ratios and the computational complexity of approximating the independence polynomial
- Witness trees in the Moser-Tardos algorithmic Lovász local lemma and Penrose trees in the hard-core lattice gas
- An improvement of the Lovász local lemma via cluster expansion
- scientific article; zbMATH DE number 1145886 (Why is no real title available?)
- A local lemma for focused stochastic algorithms
- Bears with hats and independence polynomials
- The hat guessing number of graphs
- New bounds for the Moser-Tardos distribution
- The Lovász Local Lemma and Satisfiability
- Sets of permutations that generate the symmetric group pairwise.
- Conflict‐free chromatic number versus conflict‐free chromatic index
- On conflict-free multi-coloring
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
- The harmonic mean formula for probabilities of unions: Applications to sparse random graphs
- The lefthanded local lemma characterizes chordal dependency graphs
- Probability bounds for \(n\) random events under \((n-1)\)-wise independence
- Algorithmic Pirogov-Sinai theory
- Moser-Tardos resampling algorithm, entropy compression method and the subset gas
- Commutative algorithms approximate the LLL-distribution
- Fisher zeros and correlation decay in the Ising model
- Sufficient conditions for uniform bounds in abstract polymer systems and explorative partition schemes
- Comparison of two convergence criteria for the variable-assignment lopsided Lovász local lemma
- Fisher Zeros and Correlation Decay in the Ising Model
- Finitely dependent coloring
This page was built for publication: On a problem of Spencer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072210)
