A Survey of Statistical Network Models, Volume 2Now Publishers Inc, 2010 - 120 pages Networks are ubiquitous in science and have become a focal point for discussion in everyday life. Formal statistical models for the analysis of network data have emerged as a major topic of interest in diverse areas of study, and most of these involve a form of graphical representation. Probability models on graphs date back to 1959. Along with empirical studies in social psychology and sociology from the 1960s, these early works generated an active network community and a substantial literature in the 1970s. This effort moved into the statistical literature in the late 1970s and 1980s, and the past decade has seen a burgeoning network literature in statistical physics and computer science. The growth of the World Wide Web and the emergence of online networking communities such as Facebook, MySpace, and LinkedIn, and a host of more specialized professional network communities has intensified interest in the study of networks and network data. Our goal in this review is to provide the reader with an entry point to this burgeoning literature. We begin with an overview of the historical development of statistical network modeling and then we introduce a number of examples that have been studied in the network literature. Our subsequent discussion focuses on a number of prominent static and dynamic network models and their interconnections. We emphasize formal model descriptions, and pay special attention to the interpretation of parameters and their estimation. We end with a description of some open problems and challenges for machine learning and statistics. |
Table des matières
Introduction | 1 |
Motivation and DataSet Examples | 11 |
Static Network Models 25 22228 | 25 |
4 The p₁ Model for Social Networks | 33 |
Expressions et termes fréquents
adjacency matrix algorithm Barabási Bayesian biology blocks Carnegie Mellon University clustering Computer Science context continuous-time D. M. Blei Data Mining data set DCFM degree distribution directed graphs duplication-attachment model dynamic models e-mail E. M. Airoldi Enron Erdös ERGM estimation example exchangeable graph model exponential family exponential random graph function giant component inference Journal K. M. Carley latent positions latent space model Lecture Notes Leinhardt M. E. J. Newman M. S. Handcock machine learning Markov chain Mathematical maximum likelihood MCMC mixed membership network analysis network data network structure NIPS node-specific nodes observed P. E. Pattison p₁ p1 model pairs of nodes papers parameters power-law prediction preferential attachment probability random graph models reciprocation relations Research S. E. Fienberg sampling small-world networks snapshots social networks Springer Berlin/Heidelberg static statistical network modeling statistical physics stochastic blockmodel sufficient statistics T. A. B. Snijders tion undirected