Detection thresholds for the \(\beta\)-model on sparse graphs
From MaRDI portal
Publication:1650079
DOI10.1214/17-AOS1585zbMath1392.62131arXiv1608.01801MaRDI QIDQ1650079
Subhabrata Sen, Sumit Mukherjee, Rajarshi Mukherjee
Publication date: 29 June 2018
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01801
Nonparametric hypothesis testing (62G10) Asymptotic properties of nonparametric inference (62G20) Random graphs (graph-theoretic aspects) (05C80) Minimax procedures in statistical decision theory (62C20)
Related Items (4)
A note on undirected random graph models parameterized by the strengths of vertices ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Maximum likelihood estimation for discrete exponential families and random graphs ⋮ Testing degree corrections in stochastic block models
Cites Work
- Unnamed Item
- Innovated higher criticism for detecting sparse signals in correlated noise
- Maximum likelihood estimation in the \(\beta\)-model
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- On combinatorial testing problems
- Random graphs with a given degree sequence
- The method of moments and degree distributions for network models
- Global testing under sparse alternatives: ANOVA, multiple comparisons and the higher criticism
- The sparse Poisson means model
- Community detection in sparse random networks
- Searching for a trail of evidence in a maze
- Nonparametric goodness-of-fit testing under Gaussian models
- Higher criticism for detecting sparse heterogeneous mixtures.
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Detection boundary in sparse regression
- Hypothesis testing for high-dimensional sparse binary regression
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Emergence of Scaling in Random Networks
- Asymptotics in undirected random graph models parameterized by the strengths of vertices
- Near-Optimal Detection of Geometric Objects by Fast Multiscale Methods
- Connecting tables with zero-one entries by a subset of a Markov basis
- Algebraic statistics for a directed random graph model with reciprocation
- An Exponential Family of Probability Distributions for Directed Graphs
- The number of graphs and a random graph with a given degree sequence
- Collective dynamics of ‘small-world’ networks
- A central limit theorem in the -model for undirected random graphs with a diverging number of vertices
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
This page was built for publication: Detection thresholds for the \(\beta\)-model on sparse graphs
