• Corpus ID: 3344994

Optimal Single Sample Tests for Structured versus Unstructured Network Data

@inproceedings{Bresler2018OptimalSS,
title={Optimal Single Sample Tests for Structured versus Unstructured Network Data},
author={Guy Bresler and Dheeraj M. Nagaraj},
booktitle={COLT},
year={2018}
}
• Published in COLT 17 February 2018
• Computer Science, Mathematics
We study the problem of testing, using only a single sample, between mean field distributions (like Curie-Weiss, Erd\H{o}s-R\'enyi) and structured Gibbs distributions (like Ising model on sparse graphs and Exponential Random Graphs). Our goal is to test without knowing the parameter values of the underlying models: only the \emph{structure} of dependencies is known. We develop a new approach that applies to both the Ising and Exponential Random Graph settings based on a general and natural…
20 Citations
Goodness-of-Fit Tests for Inhomogeneous Random Graphs
• Mathematics, Computer Science
ICML
• 2020
This paper derives the optimal minimax sample complexities for the goodness-of-fit problem in various natural norms, such as the Frobenius norm and the operator norm, and proposes practical implementations of natural test statistics, using their asymptotic distributions and through the parametric bootstrap.
Limits on Testing Structural Changes in Ising Models
• Computer Science
NeurIPS
• 2020
Novel information-theoretic limits on detecting sparse changes in Ising models are presented, suggesting that testing of graphical models may not be amenable to concepts such as restricted strong convexity leveraged for sparsity pattern recovery, and algorithm development instead should be directed towards detection of large changes.
Logistic-Regression with peer-group effects via inference in higher order Ising models
• Computer Science
AISTATS
• 2020
This work model binary outcomes on a network as a higher-order spin glass, where the behavior of an individual depends on a linear function of their own vector of covariates and some polynomial function of others, capturing peer-group effects.
Statistical Estimation from Dependent Data
• Computer Science
ICML
• 2021
We consider a general statistical estimation problem wherein binary labels across different observations are not independent conditioned on their feature vectors, but dependent, capturing settings
Phase Transitions for Detecting Latent Geometry in Random Graphs
• Mathematics, Computer Science
ArXiv
• 2019
It is proved that the random intersection graph converges in total variation to G(n, p) when d = \tilde{\omega}(n^3) and does not if $d = o(n*3)$, resolving an open problem in Fill et al. (2018).
A Stein Goodness of fit Test for Exponential Random Graph Models
• Mathematics
• 2021
We propose and analyse a novel nonparametric goodness-of-fit testing procedure for exchangeable exponential random graph models (ERGMs) when a single network realisation is observed. The test
Modern challenges in distribution testing
The goal of this dissertation is to identify and address several contemporary challenges in distribution testing and make progress in answering the following questions.
High Dimensional Logistic Regression Under Network Dependence
• Computer Science
• 2021
A penalized maximum pseudo-likelihood method for estimating the network peer-effect and the effect of the covariates (the regression coefficients), which, in addition to handling the high-dimensionality of the parameters, conveniently avoids the computational intractability of the maximum likelihood approach.
Stein’s method for stationary distributions of Markov chains and application to Ising models
• Mathematics
The Annals of Applied Probability
• 2019
We develop a new technique, based on Stein's method, for comparing two stationary distributions of irreducible Markov Chains whose update rules are close enough'. We apply this technique to compare
STEIN’S METHOD FOR STATIONARY DISTRIBUTIONS OF MARKOV CHAINS AND APPLICATION TO ISING MODELS1
• Mathematics
• 2019
We develop a new technique, based on Stein’s method, for comparing two stationary distributions of irreducible Markov chains whose update rules are close in a certain sense. We apply this technique

References

SHOWING 1-10 OF 31 REFERENCES
Two-Sample Tests for Large Random Graphs Using Network Statistics
• Mathematics, Computer Science
COLT
• 2017
The main contribution of the paper is a general formulation of the problem based on concentration of network statistics, and consequently, a consistent two-sample test that arises as the natural solution for this problem.
Testing for high‐dimensional geometry in random graphs
• Computer Science, Mathematics
Random Struct. Algorithms
• 2016
The proof of the detection lower bound is based on a new bound on the total variation distance between a Wishart matrix and an appropriately normalized GOE matrix and a conjecture for the optimal detection boundary is made.
Testing Bayesian Networks
• Computer Science
IEEE Transactions on Information Theory
• 2020
This work initiates a systematic investigation of testing high-dimensional structured distributions by focusing on testing Bayesian networks – the prototypical family of directed graphical models, and develops the first non-trivial efficient testing algorithms for these problems and corresponding information-theoretic lower bounds.
Testing Network Structure Using Relations Between Small Subgraph Probabilities
• Mathematics
ArXiv
• 2017
The results show how global structural characteristics of networks can be inferred from local subgraph frequencies, without requiring the global community structure to be explicitly estimated.
A Statistical Model for Motifs Detection
• Computer Science, Mathematics
IEEE Transactions on Information Theory
• 2018
A statistical model for the problem of finding subgraphs with specified topology in an otherwise random graph and two polynomial-time algorithms for solving the same problem: a spectral algorithm and a semidefinite programming (SDP) relaxation.
Exponential random graphs behave like mixtures of stochastic block models
• Mathematics, Computer Science
The Annals of Applied Probability
• 2018
This work generalizes some of the results in a paper by Chatterjee and Diaconis from the dense regime to the sparse regime and strengthens their bounds from the cut-metrics to the one-metric.
Stein’s method for stationary distributions of Markov chains and application to Ising models
• Mathematics
The Annals of Applied Probability
• 2019
We develop a new technique, based on Stein's method, for comparing two stationary distributions of irreducible Markov Chains whose update rules are close enough'. We apply this technique to compare
Universality of the mean-field for the Potts model
• Mathematics
• 2015
We consider the Potts model with q colors on a sequence of weighted graphs with adjacency matrices $$A_n$$An, allowing for both positive and negative weights. Under a mild regularity condition on
Concentration inequalities for polynomials of contracting Ising models
• Mathematics
• 2017
We study the concentration of a degree-$d$ polynomial of the $N$ spins of a general Ising model, in the regime where single-site Glauber dynamics is contracting. For $d=1$, Gaussian concentration was
Concentration Inequalities - A Nonasymptotic Theory of Independence
• Mathematics
Concentration Inequalities
• 2013
Deep connections with isoperimetric problems are revealed whilst special attention is paid to applications to the supremum of empirical processes.