On the geometry of discrete exponential families with application to exponential random graph models

@article{Fienberg2008OnTG,
  title={On the geometry of discrete exponential families with application to exponential random graph models},
  author={S. Fienberg and A. Rinaldo and Yi Zhou},
  journal={Electronic Journal of Statistics},
  year={2008},
  volume={3},
  pages={446-484}
}
There has been an explosion of interest in statistical models for analyzing network data, and considerable interest in the class of exponential random graph (ERG) models, especially in connection with diculties in computing maximum likelihood estimates. The issues associated with these diculties relate to the broader structure of discrete exponential families. This paper re-examines the issues in two parts. First we consider the clo- sure of k-dimensional exponential families of distribution… Expand
Concentration and consistency results for canonical and curved exponential-family models of random graphs
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structureExpand
Estimating and understanding exponential random graph models
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent usingExpand
CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS.
TLDR
It is shown that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM's expressive power. Expand
Consistent structure estimation of exponential-family random graph models with block structure
We consider the challenging problem of statistical inference for exponential-family random graph models based on a single observation of a random graph with complex dependence. To facilitateExpand
Limit theorems for exponential random graphs
We consider the edge-triangle model, a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. In the so-called replica symmetric regime,Expand
Exponential-Family Models of Random Graphs: Inference in Finite-, Super-, and Infinite Population Scenarios
TLDR
The core statistical notions of "sample" and "population" in the ERGM framework are clarified, and the process that generates the population graph from the observation process is separated, and likelihood-based inference in finite-, super-, and infinite-population scenarios are reviewed. Expand
DERGMs: Degeneracy-restricted exponential random graph models
TLDR
A new exponential family of models for random graphs that build on the standard ERGM framework is proposed, and a new parameter based on the graph-theoretic notion of degeneracy, a measure of sparsity whose value is low in real-worlds networks is introduced. Expand
Towards the geometry of estimation of distribution algorithms based on the exponential family
TLDR
The theoretical results of this paper lead to the definition of a new class algorithms for binary functions optimization based on Stochastic Natural Gradient Descent (SNGD), where the estimation of the parameters of the distribution is replaced by the direct update of the model parameters by estimating the natural gradient of the expected value of the fitness function. Expand
On the Limiting Behaviour of the Fundamental Geodesics of Information Geometry
TLDR
A substantially more complete account of the Information Geometry of extended exponential families is provided than has hitherto been the case and the importance and benefits of this novel formulation are illustrated through applications. Expand
A survey of discrete methods in (algebraic) statistics for networks
TLDR
An overview of open problems in this area of discrete mathematics from the point of view of a particular family of statistical models for networks called exponential random graph models, which are related to well-known concepts in commutative algebra and graph-theoretic concepts in computer science. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 67 REFERENCES
Recent developments in exponential random graph (p*) models for social networks
TLDR
The inclusion of a new higher order transitivity statistic allows estimation of parameters of exponential graph models for many (but not all) cases where it is impossible to estimate parameters of homogeneous Markov graph models. Expand
Assessing Degeneracy in Statistical Models of Social Networks
This paper presents recent advances in the statistical modeling of random graphs that have an impact on the empirical study of social networks. Statistical exponential family models (Wasserman andExpand
Markov Chain Monte Carlo Estimation of Exponential Random Graph Models
TLDR
This paper is about estimating the parameters of the exponential random graph model using frequentist Markov chain Monte Carlo (MCMC) methods, based on the Robbins-Monro algorithm for approximating a solution to the likelihood equation. Expand
An introduction to exponential random graph (p*) models for social networks
TLDR
The homogeneous Markov random graph models of Frank and Strauss are not appropriate for many observed networks, whereas the new model specifications of Snijders et al. are more suitable for social networks. Expand
An Exponential Family of Probability Distributions for Directed Graphs
Abstract Directed graph (or digraph) data arise in many fields, especially in contemporary research on structures of social relationships. We describe an exponential family of distributions that canExpand
Advances in exponential random graph (p*) models applied to a large social network
TLDR
This paper applies advances in both model parameterizations and computational algorithms to an examination of the structure observed in an adolescent friendship network of 1,681 actors from the National Longitudinal Study of Adolescent Health (AddHealth). Expand
Lectures on 0/1-Polytopes
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an introduction and invitation. Rather than heading for an extensive survey on 0/1polytopes I present some interestingExpand
Generalized maximum likelihood estimates for exponential families
For a standard full exponential family on $$\mathbb R^d$$ , or its canonically convex subfamily, the generalized maximum likelihood estimator is an extension of the mapping that assigns to the meanExpand
Discrete Multivariate Analysis: Theory and Practice
TLDR
Discrete Multivariate Analysis is a comprehensive text and general reference on the analysis of discrete multivariate data, particularly in the form of multidimensional tables, and contains a wealth of material on important topics. Expand
Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp
Spanning nearly sixty years of research, statistical network analysis has passed through (at least) two generations of researchers and models. Beginning in the late 1930's, the first generation ofExpand
...
1
2
3
4
5
...