Article Outline
Glossary
Definition of the Subject
Introduction
Notation and Terminology
Dependence Hypotheses
Bernoulli Random Graph (Erdös–Rényi) Models
Dyadic Independence Models
Markov Random Graphs
Simulation and Model Degeneracy
Social Circuit Dependence: Partial Conditional Dependence Hypotheses
Social Circuit Specifications
Estimation
Goodness of Fit and Comparisons with Markov Models
Further Extensions and Future Directions
Bibliography
Exponential random graph models , also known as p ∗ models , constitute a family of statistical models for socialnetworks. The importance of this modeling framework lies in its capacity to represent social structural effects commonly observed in many human socialnetworks, including general degree‐based effects as well as reciprocity and transitivity, and at the node-level, homophily and attribute‐basedactivity and popularity effects.The models can be derived from explicit hypotheses about dependencies among network ties. They are parametrized in termsof the prevalence of small subgraphs (configurations) in the network and can be interpreted as describing the combinations of local social processes fromwhich a given network emerges. The models are estimable from data and readily simulated.Versions of the models have been proposed for univariateand multivariate networks, valued networks, bipartite graphs and for longitudinal network data. Nodal attribute data can be incorporated in socialselection models, and through an analogous framework for social influence models.
The modeling approach was first proposed in the statistical literature in the mid-1980s, building on previous work in the spatial statistics andstatistical mechanics literature. In the 1990s, the models were picked up and extended by the social networks research community. In this century, withthe development of effective estimation and simulation procedures, there has been a growing understanding of certain inadequacies in the originalform of the models. Recently developed specifications for these models have shown a substantial improvement in fitting real social network data, tothe point where for many network data sets a large number of graph features can be successfully reproduced by the fitted models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Abbreviations
- Alternating independent-2-paths:
-
A parameter (and statistic) in new specification models; a particular combination of k‑independent-2-path counts into the one statistic.
- Alternating k-stars:
-
A Markov parameter (and statistic) in the new specification models; a particular combination of Markov k‑star counts into the one statistic; equivalent to geometrically weighted degree counts; useful for modeling the degree distribution.
- Alternating k‑triangles:
-
A parameter (and statistic) in the new specification models; a particular combination of k‑triangle counts into the one statistic; equivalent to weighted shared partners.
- Cyclic triad:
-
A Markov graph configuration: in a directed network, ties ij, jk and ki are observed among actors \( { i, j } \), and k.
- Degeneracy (or near‐degeneracy):
-
When a model implies that very few distinct graphs are probable, often only empty or complete graphs; degenerate models cannot be good models for social network data.
- Dependence assumption:
-
Theoretical assumption about dependencies among possible network ties; determines the type of parameters in the model.
- Dyad independence:
-
Assumes that dyads are independent of one another; the model includes edge and reciprocity parameters, and possibly also node or dyad attributes.
- Dyad-wise shared partners:
-
A parameter (and statistic) in the higher order models; equivalent to alternating independent 2-paths.
- Edge-wise shared partner distribution:
-
Distribution of the number of dyads who are themselves related and who have a fixed number of shared partners.
- Edge-wise shared partners:
-
A parameter (and statistic) in the higher order models; equivalent to alternating k‑triangles.
- Geometrically weighted degree counts:
-
A statistic (and parameter) in the new specification models: a sum of degree counts with geometrically decreasing weights; equivalent to alternating k-stars.
- Homogeneity assumption:
-
Assumption about which parameters to equate, to make a model identifiable.
- k‑independent-2-paths:
-
Configurations in the higher order models; equivalent to k‑triangles but without the base.
- k‑in-star:
-
A Markov graph configuration: in a directed graph, k arcs are directed to the one actor.
- k‑out-star:
-
A Markov graph configuration: in a directed graph, k arcs are expressed by the one actor.
- k‑triangle:
-
A configuration in higher order models; in a non‐directed graph, the combination of k triangles, each sharing the one edge (the base of the k‑triangle).
- k‑star:
-
A Markov graph configuration: in a non‐directed graph, k edges are expressed by the one actor.
- Markov dependence assumption:
-
Introduced by Frank and Strauss [9], proposes that, conditional on the rest of the graph, two possible ties are independent of each other unless they share an actor.
- Mixed-star:
-
A Markov graph configuration: a two path in a directed graph.
- Monte Carlo Markov chain maximum likelihood estimation (MCMCMLE):
-
Method of estimation based on computer simulation; more principled than pseudolikelihood.
- Network configuration:
-
A small subgraph that may be observed in the data and that is represented by parameters in the model: e. g. reciprocated ties, triangles.
- Parameters:
-
Relate to specific network configurations that may be observed in the graph; a large positive parameter is interpreted as the presence of more of the configurations than might be expected from chance (given the other effects in the model); a large negative parameter signifies the relative absence of the configuration.
- Partial dependence assumption:
-
Assumption for dependencies among possible ties created by the presence of other ties; permits models with higher order configurations than Markov configurations.
- Pseudo‐likelihood estimation:
-
An approximate method of estimation using logistic regression; does not produce reliable standard errors.
- p 1 Model:
-
An early dyad independence model, including popularity and expansiveness effects.
- p 2 Model:
-
Elaboration of p 1 model, where popularity and expansiveness effects are random, and independent variables may be used to predict ties.
- Simple random graphs, Bernoulli graphs, Erdös–Rényi graphs:
-
Assume that edges are independent of one another and are observed with a given probability.
- Social circuit dependence:
-
Two possible ties are conditionally dependent when, if observed, they would create a 4-cycle.
- Transitive triad:
-
A Markov graph configuration: in a directed network, ties ij, jk and ik are observed among actors \( { i, j } \), and k.
- Triangle:
-
A Markov graph configuration: in a non‐directed network, a clique of three actors, ties ij, jk and ik are observed among actors \( { i, j } \), and k.
Bibliography
Primary Literature
Besag J (1974) Spatial interaction and the statistical analysis of lattice systems. J R Stat Soc Ser B 36:96–127
Burda Z, Jurkiewicz J, Kryzwicki A (2004) Network transitivity and matrix models. Phys Rev E69:026106
Corander J, Dahmström K, Dahmström P (1998) Maximum likelihood estimation for Markov graphs, Research report. Department of Statistics, Stockholm University, Stockholm
Corander J, Dahmström K, Dahmström P (2002) Maximum likelihood estimation for exponential random graph models. In: Hagberg J (ed) Contributions to social network analysis, information theory and other topics in statistics: A festschrift in honour of Ove Frank.Department of Statistics, Stockholm University, Stockholm
Crouch B, Wasserman S (1998) Fitting \( { p^{\ast} } \): Monte Carlo maximum likelihood estimation. International Conference on Social Networks, Sitges, Spain, May 28–31
Dahmström K, Dahmström P (1993) ML‐estimation of the clustering parameter in a Markov graph model, Research report. Department of Statistics, Stockholm University, Stockholm
Erdös P, Rényi A (1959) On random graphs. I. Publicationes Mathematicae (Debrecen) 6:290–297
Frank O (1981) A Survey of Statistical Methods for Graph Analysis. Sociol Methodol 12:110–155
Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81:832–842
Gile K, Handcock M (2006) Model-based assessment of the impact of missing data on inference for networks. University of Washington, CSS working paper 66
Goodreau S (2007) Advanced in exponential random graph (p ∗) models applied to a large social network. Soc Netw 29:231–248
Häggström O, Jonasson J (1999) Phase transition in the random triangle model. J Appl Probab 36:1101–1115
Handcock M (2002) Statistical models for social networks: Degeneracy and inference. In: Breiger R, Carley K, Pattison P (eds) Dynamic social network modeling and analysis. National Academies Press, Washington, pp 229–240
Handcock M (2003) Assessing degeneracy in statistical models of social networks. University of Washington CSS Working Paper no 39
Holland P, Leinhardt S (1981) An exponential family of probability distributions for directed graphs (with discussion). J Am Stat Assoc 76:33–65
Hunter D (2007) Curved exponential family models for social networks. Soc Netw 29:216–230
Hunter D, Handcock M (2006) Inference in curved exponential families for networks.J Comput Graph Stat 15:565–583
Hunter D, Goodreau S, Handcock M (2008) Goodness of fit of social network models.J Am Stat Assoc 103:248–258
Jonasson J (1999) The random triangle model. J Appl Probab 36:852–867
Koehly L, Pattison P (2005) Random graph models for social networks: multiple relations or multiple raters. In: Carrington P, Scott J, Wasserman S (eds) Models and methods in social network analysis. Cambridge University Press, New York, pp 162–191
Koskinen J (2004) Essays on Bayesian inference for social networks. Department of statistics, Stockholm University, Stockholm
Lazega E, Pattison P (1999) Multiplexity, generalized exchange and cooperation in organizations. Soc Netw 21:67–90
Lomi A, Pattison P (2006) Manufacturing relations: An empirical study of the organization of production across multiple networks. Organ Sci 17:313–332
Moreno J, Jennings H (1938) Statistics of social configurations. Sociometry 1:342–374
Padgett JF, Ansell CK (1993) Robust action and the rise of the Medici, 1400-1434. Am J Sociol 98:1259–1319
Park J, Newman M (2004) Solution of the 2-star model of a network. Phys Rev E70:066146
Pattison P, Robins G (2002) Neighborhood‐based models for social networks. Sociol Methodol 32:301–337
Pattison P, Robins G (2004) Building models for social space: Neighbourhood based models for social networks and affiliation structures. Mathematiques des science humaines 168:11–29
Pattison P, Wasserman S (1999) Logit models and logistic regressions for social networks, II. Multivariate relations. Br J Math Stat Psychol 52:169–194
Pattison P, Robins G, Wang P, Snijders TAB, Koskinen J (2006) The co‐evolution of multiple networks. Sunbelt XXVI International Social Networks Conference, Vancouver, April 2006
Pearson M, Steglich C, Snijders TAB (2006) Homophily and assimilation among sport‐active adolescent substance users. Connections 27:51–67
Rapoport A (1953) Spread of information through a population with a socio‐structural bias: I. assumption of transitivity. Bull Math Biophys 15:523–533
Rapoport A (1957) Contributions to the theory of random and biased nets. Bull Math Biophys 19:257–277
Robins G, Morris M (2007) Advances in exponential random graph (p ∗) models. Soc Netw 29:169–172
Robins G, Pattison P (2005) Interdependencies and social processes: Generalized dependence structures. In: Carrington P, Scott J, Wasserman S (eds) Models and Methods in Social Network Analysis. Cambridge University Press, New York, pp 192–214
Robins G, Pattison P, Wasserman S (1999) Logit models and logistic regressions for social networks, III. Valued relations. Psychometrika 64:371–394
Robins G, Elliott P, Pattison P (2001) Network models for social selection processes.Soc Netw 23:1–30
Robins G, Pattison P, Elliott (2001) Network models for social influence processes.Psychometrika 66:161–190
Robins G, Pattison P, Woolcock J (2005) Social networks and small worlds. Am J Sociol 110:894–936
Robins G, Pattison, Kalish Y, Lusher D (2007) An introduction to exponential random graph (p ∗) models for social networks. Soc Netw 29:173–191
Robins G, Snijders TAB, Wang P, Handcock M, Pattison P (2007) Recent developments in exponential random graph (p ∗) models for social networks. Soc Netw 29:192–215
Skvoretz J, Faust K (1999) Logit models for affiliation networks. Sociol Methodol 29:253–280
Snijders TAB (1991) Enumeration and simulation methods for 0–1 matrices with given marginals. Psychometrika 56:397–417
Snijders TAB (2001) The statistical evaluation of social network dynamics. Sociol Methodol 31:361–395
Snijders TAB (2002) Markov chain Monte Carlo estimation of exponential random graph models. J Soc Struct 3:2
Snijders TAB (2006) Statistical methods for network dynamics. In: Luchini S et al (eds) Proceedings of the XLIII Scientific Meeting, Italian Statistical Society, pp 281–296
Snijders TAB, van Duijn MAJ (2002) Conditional maximum likelihood estimation under various specifications of exponential random graph models. In: Hagberg J (ed) Contributions to social network analysis, information theory, and other topics: A festschrift in honour of Ove Frank. Department of Statistics, University of Stockholm, Stockholm, pp 117–134
Snijders TAB, Pattison P, Robins G, Handcock M (2006) New specifications for exponential random graph models. Sociol Methodol 36:99–153
Snijders TAB, Steglich C, Schweinberger M (2007) Modeling the co‐evolution of networks and behavior. In: van Montfort K, Oud H, Satorra A (eds) Longitudinal models in the behavioral and related sciences. Lawrence Erlbaum, Hillsdale, pp 41–71
Steglich C, Snijders TAB, West P (2006) Applying SIENA: An illustrative analysis of the coevolution of adolescents' friendship networks, taste in music, and alcolhol consumption.Methodology 2:48–56
Strauss D (1986) On a general class of models for interaction. SIAM Rev 28:513–527
Strauss D, Ikeda M (1990) Pseudo‐likelihood estimation for social networks. J Am Stat Assoc 85:204–212
van Duijn M, Snijders TAB, Zijlstra B (2004) p2: a random effects model with covariates for directed graphs. Stat Neerlandica 58:234–254
Wang P (2006) Exponential random graph (p ∗) models for affiliation networks.Postgraduate diploma thesis, University of Melbourne
Wasserman S, Pattison P (1996) Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p ∗. Psychometrika 61:401–425
Wasserman S, Robins G (2005) An Introduction to Random Graphs, Dependence Graphs, and p*. In: Carrington P, Scott J, Wasserman S (eds) Models and Methods in Social Network Analysis. Cambridge University Press, New York, pp 148–161
Zhao Y, Robins G (2006) Multiple networks: Comparing QAP and exponential random graph (p*) models. Sunbelt XXVI International Social Networks Conference, Vancouver, April 2006
Books and Reviews
Agneessens F, Roose H, Waege H (2004) Choices of theatre events: p ∗ models for affiliation networks with attributes. Metodoloski Zvezki 1:419–439
Anderson C, Wasserman S, Crouch B (1999) A p ∗ primer: Logit models for social networks. Soc Netw 21:37–66
Baddeley A, Möller J (1989) Nearest‐neighbour Markov point processes and random sets.Int Stat Rev 57:89–121
Boer P, Huisman M, Snijders TAB, Zeggelink E (2003) StOCNET: an open software system for the advanced analysis of social networks. ProGAMMA/ICS, Groningen
Brieger R (1981) Comment on An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76:51–53
Butts CT (2008) Social network analysis: A methodological introduction. Asian J Soc Psychol 11:13–41
Contractor N, Wasserman S, Faust K (2006) Testing multi‐theoretical multilevel hypotheses about organizational networks: An analytic framework and empirical example. Acad Manag J 31:681–703
Frank O (1981) A survey of statistical methods for graph analysis. Sociol Methodol 11:110–155
Frank O (1991) Statistical analysis of change in networks. Stat Neerlandica 95:283–293
Frank O, Nowicki K (1993) Exploratory statistical analysis of networks. Quo Vadis, Graph Theory? Ann Discret Math 55:349–366
Handcock M, Hunter D, Butts C, Goodreau S, Morris M (2006) Statnet: An R package for the statistical analysis and simulation of social networks.University of Washington, Washington
Koehly L, Goodreau S, Morris M (2004) The link between exponential random graph models and loglinear models for networks. Sociol Methodol 34:241–270
Lazega E, van Duijn M (1997) Position in formal structure, personal characteristics and choices of advisors in a law firm: A logistic regression model for dyadic network data. Soc Netw 19:375–397
Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chkovskii D, Alon U (2002) Network motifs: simple building blocks of complex networks. Science 298:824–827
Monge P, Contractor N (2003) Theories of communication networks. Oxford University Press, New York
Newman M (2003) The structure and function of complex networks. SIAM Rev 45:167–256
Pattison P, Robins GL (2008) Probabilistic network theory. In: Rudas T (ed) Handbook of Probability: Theory with Applications. Sage, Thousand Oaks, pp 291–312
Pattison P, Wasserman S (2002) Multivariate random graph distributions: applications to social network analysis. In: Hagberg J (ed) Contributions to social network analysis, information theory and other topics in statistics: A festschrift in honour of Ove Frank. Department of Statistics, University of Stockholm, Stockholm, pp 74–100
Robins G, Pattison P (2001) Random graph models for temporal processes in social networks. J Math Sociol 25:5–41
Robins G, Pattison P, Woolcock J (2004) Models for social networks with missing data.Soc Netw 26:257–283
Schweinberger M, Snijders TAB (2003) Settings in social networks: A measurement model.Sociol Methodol 33:307–341
Wang P, Robins G, Pattison P (2006) PNet: Program for the estimation and simulation of p*exponential random graph models, User Manual. School of Behavioural Science, University of Melbourne, Melbourne
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag
About this entry
Cite this entry
Robins, G. (2012). Social Networks, Exponential Random Graph (p *) Models for. In: Meyers, R. (eds) Computational Complexity. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-1800-9_182
Download citation
DOI: https://doi.org/10.1007/978-1-4614-1800-9_182
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-1799-6
Online ISBN: 978-1-4614-1800-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering