Fetching the paper…
Reading the bibliography…
Given samples from an unknown multivariate distribution $p$, is it possible to distinguish whether $p$ is the product of its marginals versus $p$ being far from every product distribution? Similarly, is it possible to distinguish whether $p$ equals a given distribution $q$ versus $p$ and $q$ being far from each other? These problems of testing independence and goodness-of-fit have received enormous attention in statistics, information theory, and theoretical computer science, with sample-optimal algorithms known in several interesting regimes of parameters.
Beitrag zur theorie des ferromagnetismus
Ernst Ising · 1925
Earlier work this paper cites.
The Design of Experiments
Ronald A. Fisher · 1935
Earlier work this paper cites.
Central limit theorem for nonstationary Markov chains. I
Roland L. Dobrushin · 1956
Earlier work this paper cites.
Approximating discrete probability distributions with dependence trees
C.K. Chow and C.N. Liu · 1968
Earlier work this paper cites.
The description of a random field by means of conditional probabilities and conditions of its regularity
PL Dobruschin · 1968
Earlier work this paper cites.
Rigorous results for Ising ferromagnets of arbitrary spin
Robert B. Griffiths · 1969
Earlier work this paper cites.
Convergence of estimates under dimensionality restrictions
Lucien Le Cam · 1973
Earlier work this paper cites.
The analysis of categorical data from complex sample surveys: Chi-squared tests for goodness of fit and independence in two-way tables
Jon N.K. Rao and Alastair J. Scott · 1981
Earlier work this paper cites.
Markov random field image models and their applications to computer vision
Stuart Geman and Christine Graffigne · 1986
Earlier work this paper cites.
Learning, local interaction, and coordination
Glenn Ellison · 1993
Earlier work this paper cites.
Property testing and its connection to learning and approximation
Oded Goldreich, Shafi Goldwasser, and Dana Ron · 1996
Earlier work this paper cites.
Testing that distributions are close
Tuğkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, and Patrick White · 2000
Earlier work this paper cites.
On testing expansion in bounded-degree graphs
Oded Goldreich and Dana Ron · 2000
Earlier work this paper cites.
Testing random variables for independence and identity
Tuğkan Batu, Eldar Fischer, Lance Fortnow, Ravi Kumar, Ronitt Rubinfeld, and Patrick White · 2001
Earlier work this paper cites.
Sublinear algorithms for testing monotone and unimodal distributions
Tuğkan Batu, Ravi Kumar, and Ronitt Rubinfeld · 2004
Earlier work this paper cites.
Inferring Phylogenies
Joseph Felsenstein · 2004
Earlier work this paper cites.
Concentration Inequalities with Exchangeable Pairs
Sourav Chatterjee · 2005
Earlier work this paper cites.
Exact Kolmogorov and total variation distances between some familiar discrete distributions
José A. Adell and Pedro Jodrá · 2006
Earlier work this paper cites.
Learning factor graphs in polynomial time and sample complexity
Pieter Abbeel, Daphne Koller, and Andrew Y. Ng · 2006
Earlier work this paper cites.
Consistent estimation of the basic neighborhood of Markov random fields
Imre Csiszár and Zsolt Talata · 2006
Earlier work this paper cites.
A simple condition implying rapid mixing of single-site dynamics on spin systems
Thomas P. Hayes · 2006
Earlier work this paper cites.
The spread of obesity in a large social network over 32 years
Nicholas A. Christakis and James H. Fowler · 2007
Earlier work this paper cites.
A probabilistic graphical model for joint answer ranking in question answering
Jeongwoo Ko, Eric Nyberg, and Luo Si · 2007
Earlier work this paper cites.
Dobrushin conditions and systematic scan
Martin Dyer, Leslie Ann Goldberg, and Mark Jerrum · 2008
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.
Markov Chains and Mixing Times
David A. Levin, Yuval Peres, and Elizabeth L. Wilmer · 2009
Earlier work this paper cites.
Lecture notes for Bayesian modeling and inference, 2010
Michael Jordan · 2010
Earlier work this paper cites.
The spread of innovations in social networks
Andrea Montanari and Amin Saberi · 2010
Earlier work this paper cites.
High-dimensional Ising model selection using ℓ 1 \ell_{1} -regularized logistic regression
Pradeep Ravikumar, Martin J. Wainwright, and John D. Lafferty · 2010
Earlier work this paper cites.
Learning graphical models for hypothesis testing and classification
Sujay Sanghavi, Vincent Tan, and Alan Willsky · 2010
Earlier work this paper cites.
Error exponents for composite hypothesis testing of Markov forest distributions
Vincent Y.F. Tan, Animashree Anandkumar, and Alan S. Willsky · 2010
Earlier work this paper cites.
Competitive closeness testing
Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, and Shengjun Pan · 2011
Earlier work this paper cites.
Testing monotonicity of distributions over general partial orders
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfeld, and Paul Valiant · 2011
Earlier work this paper cites.
Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel’s conjecture
Constantinos Daskalakis, Elchanan Mossel, and Sébastien Roch · 2011
Cited alongside, same era.
Gibbs Measures and Phase Transitions
Hans-Otto Georgii · 2011
Cited alongside, same era.
On learning discrete graphical models using greedy methods
Ali Jalali, Christopher C. Johnson, and Pradeep K. Ravikumar · 2011
Cited alongside, same era.
On learning discrete graphical models using group-sparse regularization
Ali Jalali, Pradeep K. Ravikumar, Vishvas Vasuki, and Sujay Sanghavi · 2011
Cited alongside, same era.
Testing symmetric properties of distributions
Paul Valiant · 2011
Cited alongside, same era.
Categorical Data Analysis
Alan Agresti · 2012
Cited alongside, same era.
Distribution testing lower bounds via reductions from communication complexity
Eric Blais, Clément L. Canonne, and Tom Gur · 2017
Closest in time.
Testing Bayesian networks
Clément L. Canonne, Ilias Diakonikolas, Daniel M. Kane, and Alistair Stewart · 2017
Closest in time.
Concentration of multilinear functions of the Ising model with applications to network data
Constantinos Daskalakis, Nishanth Dikkala, and Gautam Kamath · 2017
Closest in time.
Near-optimal closeness testing of discrete histogram distributions
Ilias Diakonikolas, Daniel M. Kane, and Vladimir Nikishkin · 2017
Closest in time.
Square Hellinger subadditivity for Bayesian networks and its applications to identity testing
Constantinos Daskalakis and Qinxuan Pan · 2017
Closest in time.
Lower bounds for two-sample structural change detection in Ising and Gaussian models
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Approximating and testing k-histogram distributions in sub-linear time
Piotr Indyk, Reut Levi, and Ronitt Rubinfeld · 2012
Cited alongside, same era.
Taming big probability distributions
Ronitt Rubinfeld · 2012
Cited alongside, same era.
Information-theoretic limits of selecting binary graphical models in high dimensions
Narayana P. Santhanam and Martin J. Wainwright · 2012
Cited alongside, same era.
Testing k-modal distributions: Optimal algorithms via reductions
Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, and Paul Valiant · 2013
Cited alongside, same era.
Testing properties of collections of distributions
Reut Levi, Dana Ron, and Ronitt Rubinfeld · 2013
Cited alongside, same era.
Hardness of parameter estimation in graphical models
Guy Bresler, David Gamarnik, and Devavrat Shah · 2014
Cited alongside, same era.
Aditya Gangrade, Bobak Nazer, and Venkatesh Saligrama · 2017
Closest in time.
Introduction to Property Testing
Oded Goldreich · 2017
Closest in time.
Mixing time estimation in reversible Markov chains from a single sample path
Daniel Hsu, Aryeh Kontorovich, David A. Levin, Yuval Peres, and Csaba Szepesvári · 2017
Closest in time.
Information theoretic properties of Markov random fields, and their algorithmic applications
Linus Hamilton, Frederic Koehler, and Ankur Moitra · 2017
Closest in time.
Learning graphical models using multiplicative weights
Adam Klivans and Raghu Meka · 2017
Closest in time.
Property testing in high dimensional Ising models
Matey Neykov and Han Liu · 2017
Closest in time.
An automatic inequality prover and instance optimal identity testing
Gregory Valiant and Paul Valiant · 2017
Closest in time.
Learning and testing causal models with interventions
Jayadev Acharya, Arnab Bhattacharyya, Constantinos Daskalakis, and Saravanan Kandasamy · 2018
Closest in time.
Optimal single sample tests for structured versus unstructured network data
Guy Bresler and Dheeraj Nagaraj · 2018
Closest in time.
Hypothesis testing for high-dimensional multinomials: A selective review
Sivaraman Balakrishnan and Larry Wasserman · 2018
Closest in time.
Testing symmetric markov chains from a single trajectory
Constantinos Daskalakis, Nishanth Dikkala, and Nick Gravin · 2018
Closest in time.
Sample-optimal identity testing with high probability
Ilias Diakonikolas, Themis Gouleakis, John Peebles, and Eric Price · 2018
Closest in time.
Which distribution distances are sublinearly testable?
Constantinos Daskalakis, Gautam Kamath, and John Wright · 2018
Closest in time.
The minimax learning rate of normal and Ising undirected graphical models
Luc Devroye, Abbas Mehrabian, and Tommy Reddad · 2018
Closest in time.
Concentration inequalities for polynomials of contracting Ising models
Reza Gheissari, Eyal Lubetzky, and Yuval Peres · 2018
Closest in time.
Higher order concentration for functions of weakly dependent random variables
Friedrich Götze, Holger Sambale, and Arthur Sinulis · 2018
Closest in time.
Modern Challenges in Distribution Testing
Gautam Kamath · 2018
Closest in time.
Global testing against sparse alternatives under Ising models
Rajarshi Mukherjee, Sumit Mukherjee, and Ming Yuan · 2018
Closest in time.
Sparse logistic regression learns all discrete pairwise graphical models
Shanshan Wu, Sujay Sanghavi, and Alexandros G. Dimakis · 2018
Closest in time.
A note on concentration for polynomials in the Ising model
Radosław Adamczak, Michał Kotowski, Bartłomiej Polaczyk, and Michał Strzelecki · 2019
Closest in time.
Lower bounds for testing graphical models: Colorings and antiferromagnetic Ising models
Ivona Bezakova, Antonio Blanca, Zongchen Chen, Daniel Štefankovič, and Eric Vigoda · 2019
Closest in time.
A general asymptotic framework for distribution-free graph-based two-sample tests
Bhaswar B. Bhattacharya · 2019
Closest in time.
Statistical windows in testing for the initial distribution of a reversible markov chain
Quentin Berthet and Varun Kanade · 2019
Closest in time.
Private identity testing for high-dimensional distributions
Clément L. Canonne, Gautam Kamath, Audra McMillan, Jonathan Ullman, and Lydia Zakynthinou · 2019
Closest in time.
Learning from weakly dependent data under Dobrushin’s condition
Yuval Dagan, Constantinos Daskalakis, Nishanth Dikkala, and Siddhartha Jayanti · 2019
Closest in time.
Regression from dependent observations
Constantinos Daskalakis, Nishanth Dikkala, and Ioannis Panageas · 2019
Closest in time.
Testing identity of multidimensional histograms
Ilias Diakonikolas, Daniel M. Kane, and John Peebles · 2019
Closest in time.
On testing for parameters in Ising models
Rajarshi Mukherjee and Gourab Ray · 2019
Closest in time.