A network is a representation for a collection of individuals or other unitsconnected in a pairwise fashion by relationships, such as friendship. Networks aretypically displayed visually as “graphs,” so that individuals correspond to the“nodes” of a graph, with the existence of a relationship indicated by an edgebetween pairs of nodes. Relationships can be univariate or multivariate,and the connections between individuals can be either directed (fromone to the other) or undirected. In terms of statistical science, a networkmodel is one that accounts for the structure of the network ties in terms ofthe probability that each network tie exists, whether conditional on allother ties, or as considered part of the distribution of the ensemble of ties.
A network with N nodes has \((_2^N )\) unordered pairs of nodes, and hence \(2(_2^N )\) possible directed edges. If the labels on edges reflect the nodes they link, as(i,j), Y ij represents the existence of an edge from individual i to j, and \(...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References and Further Reading
Anderson CJ, Wasserman S, Crouch B (1999) A p ∗ primer: logit models for social networks. Soc Netw 21:37–66
Barabási AL, Albert R (1999) Emergence of scaling in random networks. Science 286:509–512
Chung F, Lu L (2006) Complex graphs and networks. American Mathematical Society, Providence
Durrett R (2006) Random graph dynamics. Cambridge University Press, New York
Erdös P, Rényi A (1959) The evolution of random graphs. Magyar Tud Akad Mat Kutató Int Közl 5:17–61
Erdös P, Rényi A (1960) On random graphs. Publications Mathematicae 6:290
Frank O, Strauss D (1986) Markov graphs. J Am Stat Assoc 81:832–842
Gilbert EN (1959) Random graphs. Ann Math Stat 30:1141–1144
Goldenberg A, Zhang A, Fienberg SE, Airoldi E (2010) A survey of statistical network models. Foundations and trends in machine learning 2:129–233
Holland PW, Leinhardt S (1981) An exponential family of probability distributions for directed graphs. J Am Stat Assoc 76:33–65 (with discussion)
Kolaczyk ED (2009) Statistical analysis of network data. Springer, New York
Li L, Alderson D, Doyle JC, Willinger W (2006) Towards a theory of scale-free graphs: definition, proper ties, and implications. Internet Math 2(4):431–521
Newman MEJ (2004) Detecting community structure in networks. Eur J Phy B 38:321–330
Rinaldo A, Fienberg SE, Zhou Y (2009) On the geometry of discrete exponential families with application to exponential random graph models. Electron J Stat 3:446–484
Snijders TAB (2005) Models for longitudinal network data. In: Carrington P, Scott J, Wasserman S (eds) Models and methods for social network analysis, Chap 11. Cambridge University Press, New York, pp 215–247
Wasserman S (1980) Analyzing social networks as stochastic processes. J Am Stat Assoc 75:280–294
Watts D, Strogatz S (1998) Collective dynamics of “small-world” networks. Nature 393:440–442
Yule GU (1925) A mathematical theory of evolution, based on the conclusions of Dr. J. C. Willis, F.R.S. Philos Trans R Soc Lond B 213:21–87
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this entry
Cite this entry
Fienberg, S.E., Thomas, A.C. (2011). Network Models in Probability and Statistics. In: Lovric, M. (eds) International Encyclopedia of Statistical Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04898-2_403
Download citation
DOI: https://doi.org/10.1007/978-3-642-04898-2_403
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04897-5
Online ISBN: 978-3-642-04898-2
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering