Maximum likelihood estimation in the -model
From MaRDI portal
Publication:366958
Abstract: We study maximum likelihood estimation for the statistical model for undirected random graphs, known as the -model, in which the degree sequences are minimal sufficient statistics. We derive necessary and sufficient conditions, based on the polytope of degree sequences, for the existence of the maximum likelihood estimator (MLE) of the model parameters. We characterize in a combinatorial fashion sample points leading to a nonexistent MLE, and nonestimability of the probability parameters under a nonexistent MLE. We formulate conditions that guarantee that the MLE exists with probability tending to one as the number of nodes increases.
Recommendations
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- When the degree sequence is a sufficient statistic
- Maximum likelihood estimation for discrete exponential families and random graphs
- Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
- \(\beta\) models for random hypergraphs with a given degree sequence
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 5552899 (Why is no real title available?)
- scientific article; zbMATH DE number 17664 (Why is no real title available?)
- scientific article; zbMATH DE number 44577 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3602484 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- A sequential importance sampling algorithm for generating random graphs with prescribed degrees
- A survey of statistical network models
- Algebraic statistics for a directed random graph model with reciprocation
- An Exponential Family of Probability Distributions for Directed Graphs
- Complex networks. Structure, robustness and function.
- Computing and Combinatorics
- Connecting tables with zero-one entries by a subset of a Markov basis
- Exchangeable Rasch matrices
- From the zonotope construction to the Minkowski addition of convex polytopes
- Graph limits and exchangeable random graphs
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Likelihood inference in exponential families and directions of recession
- Limits of dense graph sequences
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- Maximum likelihood estimation in log-linear models
- Maximum likelihood estimation in the \(\beta\)-model
- Networks. An introduction.
- On the geometry of discrete exponential families with application to exponential random graph models
- On the toric algebra of graphical models
- Random graphs with a given degree sequence
- Relations among conditional probabilities
- Statistical analysis of network data. Methods and models
- Statistical mechanics of complex networks
- The Structure and Function of Complex Networks
- Threshold graphs and related topics
- Transforming contingency tables
- polymake: a framework for analyzing convex polytopes
Cited in
(57)- Non-asymptotic model selection for models of network data with parameter vectors of increasing dimension
- On the Rényi index of random graphs
- Semiparametric Analysis of Network Formation
- Signal detection in degree corrected ERGMs
- Markov Bases: A 25 Year Update
- Null models and community detection in multi-layer networks
- Maximum likelihood estimation in log-linear models
- Longitudinal network models and permutation‐uniform Markov chains
- A dynamic network model with persistent links and node-specific latent variables, with an application to the interbank market
- A note on asymptotic distributions in maximum entropy models for networks
- Approximate estimation in a class of directed networks
- Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm
- Permanental partition models and Markovian Gibbs structures
- A survey of discrete methods in (algebraic) statistics for networks
- Moments of uniform random multigraphs with fixed degree sequences
- Asymptotic distribution in directed finite weighted random graphs with an increasing bi-degree sequence
- Sandwiching dense random regular graphs between binomial random graphs
- On the number of non-zero elements of joint degree vectors
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- Edge differentially private estimation in the \(\beta\)-model via jittering and method of moments
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Bivariate gamma model
- Statistical inference in a directed network model with covariates
- Detection thresholds for the \(\beta\)-model on sparse graphs
- Consistency under sampling of exponential random graph models
- Consistent structure estimation of exponential-family random graph models with block structure
- A network Poisson model for weighted directed networks with covariates
- Asymptotic distribution in affiliation finite discrete weighted networks with an increasing degree sequence
- Asymptotics in theβ-model for networks with a differentially private degree sequence
- Asymptotic in undirected random graph models with a noisy degree sequence
- Concentration and consistency results for canonical and curved exponential-family models of random graphs
- Maximum likelihood estimation in the \(\beta\)-model
- Improved maximum likelihood estimation in a new class of beta regression models
- Statistics of the two star ERGM
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
- Maximum likelihood estimation of sparse networks with missing observations
- A note on undirected random graph models parameterized by the strengths of vertices
- Maximum likelihood estimation of the DDRCINAR(p) model
- A central limit theorem in the \(\beta \)-model for undirected random graphs with a diverging number of vertices
- \(\beta\) models for random hypergraphs with a given degree sequence
- Toric algebra of hypergraphs
- On the question of effective sample size in network modeling: an asymptotic inquiry
- On the maximum likelihood estimator in the generalized beta regression model
- Hierarchical models for independence structures of networks
- Asymptotic in the ordered networks with a noisy degree sequence
- A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015
- Estimating parameters of a directed weighted graph model with beta-distributed edge-weights
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- When the degree sequence is a sufficient statistic
- Time‐varying β‐model for dynamic directed networks
- Asymptotics of score test in the generalized \(\beta\)-model for networks
- Directed weighted random graphs with an increasing bi-degree sequence
- Maximum likelihood estimation for discrete exponential families and random graphs
- The $\beta$-Model—Maximum Likelihood, Cramér–Rao Bounds, and Hypothesis Testing
- Asymptotic distributions in affiliation networks with an increasing sequence
- Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters
- Asymptotic theory in network models with covariates and a growing number of node parameters
This page was built for publication: Maximum likelihood estimation in the \(\beta\)-model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q366958)
