On the geometry of discrete exponential families with application to exponential random graph models
From MaRDI portal
Publication:1951987
DOI10.1214/08-EJS350zbMath1326.62071arXiv0901.0026OpenAlexW2043764434MaRDI QIDQ1951987
Publication date: 27 May 2013
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.0026
Point estimation (62F10) Random graphs (graph-theoretic aspects) (05C80) Parametric inference (62F99) Graphical methods in statistics (62A09)
Related Items (32)
Reciprocity in directed networks ⋮ Varying-coefficient models for dynamic networks ⋮ Natural gradient flow in the mixture geometry of a discrete exponential family ⋮ Computing with Fisher geodesics and extended exponential families ⋮ Minimum distance estimators of population size from snowball samples using conditional estimation and scaling of exponential random graph models ⋮ Using contrastive divergence to seed Monte Carlo MLE for exponential-family random graph models ⋮ Consistency under sampling of exponential random graph models ⋮ Maximum likelihood estimation in the \(\beta\)-model ⋮ Concentration and consistency results for canonical and curved exponential-family models of random graphs ⋮ Asymptotic structure of constrained exponential random graph models ⋮ Analyzing complex functional brain networks: fusing statistics and network science to understand the brain ⋮ Practical Network Modeling via Tapered Exponential-Family Random Graph Models ⋮ Local structure graph models with higher‐order dependence ⋮ Hierarchical models for independence structures of networks ⋮ Conditional inference of Poisson models and information geometry: an ancillary review ⋮ Geometry and applied statistics ⋮ Long range search for maximum likelihood in exponential families ⋮ Likelihood inference in exponential families and directions of recession ⋮ The log-linear group-lasso estimator and its asymptotic properties ⋮ Estimating and understanding exponential random graph models ⋮ Maximum likelihood estimation in log-linear models ⋮ Critical phenomena in exponential random graphs ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Asymptotic structure and singularities in constrained directed graphs ⋮ Phase transitions in edge-weighted exponential random graphs: near-degeneracy and universality ⋮ Maximum likelihood estimation for discrete exponential families and random graphs ⋮ Exponential-family random graph models for valued networks ⋮ Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs ⋮ Computationally efficient likelihood inference in exponential families when the maximum likelihood estimator does not exist ⋮ Consistent structure estimation of exponential-family random graph models with block structure ⋮ On the phase transition curve in a directed exponential random graph model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Closures of exponential families
- Likelihood inference in exponential families and directions of recession
- Polyhedral conditions for the nonexistence of the MLE for hierarchical log-linear models
- On the toric algebra of graphical models
- Goodness of Fit of Social Network Models
- Markov Graphs
- An Exponential Family of Probability Distributions for Directed Graphs
- Lectures on Polytopes
- Information projections revisited
- Convex cores of measures on R d
- A note on the existence of the posterior distribution for a class of mixed models for binomial responses
- A Survey of Statistical Network Models
- Convex Analysis
This page was built for publication: On the geometry of discrete exponential families with application to exponential random graph models
