Fetching the paper…
Reading the bibliography…
We study the identity testing problem for high-dimensional distributions.
Spectra of trees
CD Godsil · 1984
Earlier work this paper cites.
Approximating the permanent
Mark Jerrum and Alistair Sinclair · 1989
Earlier work this paper cites.
Exact sampling with coupled Markov chains and applications to statistical mechanics
James Gary Propp and David Bruce Wilson · 1996
Earlier work this paper cites.
1-factorizations of random regular graphs
Michael S. O. Molloy, Hanna Robalewska, Robert W. Robinson, and Nicholas C. Wormald · 1997
Earlier work this paper cites.
Exponential integrability and transportation cost related to logarithmic Sobolev inequalities
Sergej G Bobkov and Friedrich Götze · 1999
Earlier work this paper cites.
Testing random variables for independence and identity
Tugkan Batu, Eldar Fischer, Lance Fortnow, Ravi Kumar, Ronitt Rubinfeld, and Patrick White · 2001
Earlier work this paper cites.
Quasi-factorization of the entropy and logarithmic Sobolev inequalities for Gibbs random fields
Filippo Cesi · 2001
Earlier work this paper cites.
The Ising model on trees: Boundary conditions and mixing time
Fabio Martinelli, Alistair Sinclair, and Dror Weitz · 2003
Earlier work this paper cites.
On phase transition in the hard-core model on Z d {Z}^{d}
David Galvin and Jeff Kahn · 2004
Earlier work this paper cites.
Foundations of cryptography. II: Basic applications
Oded Goldreich · 2004
Earlier work this paper cites.
Mathematical aspects of mixing times in Markov chains
Ravi Montenegro and Prasad Tetali · 2006
Earlier work this paper cites.
The complexity of ferromagnetic Ising with local fields
Leslie Ann Goldberg and Mark Jerrum · 2007
Earlier work this paper cites.
A coincidence-based test for uniformity given very sparsely sampled discrete data
Liam Paninski · 2008
Earlier work this paper cites.
Uniqueness thresholds on trees versus graphs
Allan Sly · 2008
Earlier work this paper cites.
Computational transition at the uniqueness threshold
Allan Sly · 2010
Earlier work this paper cites.
The power of linear estimators
Gregory Valiant and Paul Valiant · 2011
Earlier work this paper cites.
Matrix theory
Joel N Franklin · 2012
Earlier work this paper cites.
Optimal algorithms for testing closeness of discrete distributions
Siu-On Chan, Ilias Diakonikolas, Paul Valiant, and Gregory Valiant · 2014
Earlier work this paper cites.
Counting in two-spin models on d d -regular graphs
Allan Sly and Nike Sun · 2014
Earlier work this paper cites.
Optimal testing for properties of distributions
Jayadev Acharya, Constantinos Daskalakis, and Gautam Kamath · 2015
Earlier work this paper cites.
Approximate tensorization of entropy at high temperature
Pietro Caputo, Georg Menz, and Prasad Tetali · 2015
Earlier work this paper cites.
Testing probability distributions using conditional samples
Clément L Canonne, Dana Ron, and Rocco A. Servedio · 2015
Earlier work this paper cites.
Faster algorithms for testing under conditional sampling
Moein Falahatgar, Ashkan Jafarpour, Alon Orlitsky, Venkatadheeraj Pichapati, and Ananda Theertha Suresh · 2015
Earlier work this paper cites.
Minimax estimation of functionals of discrete distributions
Jiantao Jiao, Kartik Venkat, Yanjun Han, and Tsachy Weissman · 2015
Cited alongside, same era.
On the power of conditional samples in distribution testing
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, and Arie Matsliah · 2016
Cited alongside, same era.
#BIS-hardness for 2-spin systems on bipartite bounded degree graphs in the tree non-uniqueness region
Jin-Yi Cai, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Mark Jerrum, Daniel Štefankovič, and Eric Vigoda · 2016
Cited alongside, same era.
A new approach for testing properties of discrete distributions
Ilias Diakonikolas and Daniel M Kane · 2016
Cited alongside, same era.
Inapproximability of the partition function for the antiferromagnetic Ising and hard-core models
Andreas Galanis, Daniel Štefankovič, and Eric Vigoda · 2016
Cited alongside, same era.
Minimax rates of entropy estimation on large alphabets via best polynomial approximation
Algorithms for #BIS-hard problems on expander graphs
Matthew Jenssen, Peter Keevash, and Will Perkins · 2020
Later among the works it cites.
Hardness of identity testing for restricted Boltzmann machines and Potts models
Antonio Blanca, Zongchen Chen, Daniel Štefankovič, and Eric Vigoda · 2021
Later among the works it cites.
Testing product distributions: A closer look
Arnab Bhattacharyya, Sutanu Gayen, Saravanan Kandasamy, and NV Vinodchandran · 2021
Later among the works it cites.
Random restrictions of high dimensional distributions and uniformity testing with subcube conditioning
Clement L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, and Erik Waingarten · 2021
Later among the works it cites.
Rapid mixing for colorings via spectral independence
Zongchen Chen, Andreas Galanis, Daniel Štefankovič, and Eric Vigoda · 2021
Later among the works it cites.
Learning and testing junta distributions with subcube conditioning
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Yihong Wu and Pengkun Yang · 2016
Cited alongside, same era.
Square Hellinger subadditivity for Bayesian networks and its applications to identity testing
Constantinos Daskalakis and Qinxuan Pan · 2017
Cited alongside, same era.
Introduction to property testing
Oded Goldreich · 2017
Cited alongside, same era.
Learning graphical models using multiplicative weights
Adam Klivans and Raghu Meka · 2017
Cited alongside, same era.
An automatic inequality prover and instance optimal identity testing
Gregory Valiant and Paul Valiant · 2017
Cited alongside, same era.
Estimating the unseen: Improved estimators for entropy and other properties
Gregory Valiant and Paul Valiant · 2017
Cited alongside, same era.
Property testing of joint distributions using conditional samples
Rishiraj Bhattacharyya and Sourav Chakraborty · 2018
Cited alongside, same era.
Xi Chen, Rajesh Jayaram, Amit Levi, and Erik Waingarten · 2021
Later among the works it cites.
Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional expansion
Zongchen Chen, Kuikui Liu, and Eric Vigoda · 2021
Later among the works it cites.
Spectral independence via stability and applications to Holant-type problems
Zongchen Chen, Kuikui Liu, and Eric Vigoda · 2021
Later among the works it cites.
Block factorization of the relative entropy via spatial mixing
Pietro Caputo and Daniel Parisi · 2021
Later among the works it cites.
Optimal testing of discrete distributions with high probability
Ilias Diakonikolas, Themis Gouleakis, Daniel M Kane, John Peebles, and Eric Price · 2021
Later among the works it cites.
From coupling to spectral independence and blackbox comparison with the down-up walk
Kuikui Liu · 2021
Later among the works it cites.
On tolerant distribution testing in the conditional sampling model
Shyam Narayanan · 2021
Later among the works it cites.
Entropic independence: Optimal mixing of down-up random walks
Nima Anari, Vishesh Jain, Frederic Koehler, Huy Tuan Pham, and Thuy-Duong Vuong · 2022
Closest in time.
On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
Antonio Blanca, Pietro Caputo, Zongchen Chen, Daniel Parisi, Daniel Štefankovič, and Eric Vigoda · 2022
Closest in time.
Independence testing for bounded degree Bayesian network
Arnab Bhattacharyya, Clément L Canonne, and Joy Qiping Yang · 2022
Closest in time.
Spectral gap in random bipartite biregular graphs and applications
Gerandy Brito, Ioana Dumitriu, and Kameron Decker Harris · 2022
Closest in time.
Topics and techniques in distribution testing: A biased but representative sample
Clément L. Canonne · 2022
Closest in time.
A spectral condition for spectral gap: Fast mixing in high-temperature Ising models
Ronen Eldan, Frederic Koehler, and Ofer Zeitouni · 2022
Closest in time.
A spectral independence view on hard spheres via block dynamics
Tobias Friedrich, Andreas Göbel, Martin S Krejca, and Marcus Pappik · 2022
Closest in time.
Rapid mixing from spectral independence beyond the Boolean domain
Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang · 2022
Closest in time.
Sampling approximately low-rank Ising models: MCMC meets variational methods
Frederic Koehler, Holden Lee, and Andrej Risteski · 2022
Closest in time.
From algorithms to connectivity and back: Finding a giant component in random k k -SAT
Zongchen Chen, Nitya Mani, and Ankur Moitra · 2023
Closest in time.
Fast sampling of satisfying assignments from random k k -SAT with applications to connectivity
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Heng Guo, Andrés Herrera-Poyatos, Nitya Mani, and Ankur Moitra · 2024
Closest in time.