A survey of statistical network models
From MaRDI portal
Network design and communication in computer systems (68M10) Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Deterministic network models in operations research (90B10) Stochastic network models in operations research (90B15)
Abstract: 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.
Recommendations
Cited in
(only showing first 100 items - show all)- Exponential-family random graph models for valued networks
- Metric inference for social networks
- Fast community detection by SCORE
- Latent space modelling of multidimensional networks with application to the exchange of votes in Eurovision song contest
- Rate-optimal graphon estimation
- Tracking network dynamics: a survey using graph distances
- Discovering patterns in time-varying graphs: a triclustering approach
- Symmetric graph properties have independent edges
- Exchangeable trait allocations
- Validation of community robustness
- Dealing with reciprocity in dynamic stochastic block models
- A review of dynamic network models with latent variables
- Graph sampling
- Studying the effective brain connectivity using multiregression dynamic models
- Estimating a network from multiple noisy realizations
- A statistical social network model for consumption data in trophic food webs
- Portal nodes screening for large scale social networks
- A framework for imperfectly observed networks
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Consistency of community detection in networks under degree-corrected stochastic block models
- On the geometry of discrete exponential families with application to exponential random graph models
- Fusing data depth with complex networks: community detection with prior information
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing
- Network representation using graph root distributions
- Identifying overlapping terrorist cells from the Noordin Top actor-event network
- Public health interventions in the face of pandemics: network structure, social distancing, and heterogeneity
- Testing community structure for hypergraphs
- Null models and community detection in multi-layer networks
- Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model
- Uniform estimation in stochastic block models is slow
- A simple and efficient algorithm for modeling modular complex networks
- On equivalence of likelihood maximization of stochastic block model and constrained nonnegative matrix factorization
- Intensity estimation on geometric networks with penalized splines
- Graph link prediction in computer networks using Poisson matrix factorisation
- Optimal rates for community estimation in the weighted stochastic block model
- Spectral clustering-based community detection using graph distance and node attributes
- Posterior contraction rates for stochastic block models
- On the use of random graphs as null model of large connected networks
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Mixed membership stochastic blockmodels for heterogeneous networks
- Estimation of local degree distributions via local weighted averaging and Monte Carlo cross-validation
- Detecting structural changes in longitudinal network data
- Dynamic network models and graphon estimation
- A note on parallel sampling in Markov graphs
- Nonparametric inference for continuous-time event counting and link-based dynamic network models
- Consistency of spectral clustering in stochastic block models
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- A note on jointly modeling edges and node attributes of a network
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Degree-based moment estimation for ordered networks
- Nonparametric statistics of dynamic networks with distinguishable nodes
- Basic models and questions in statistical network analysis
- Multi-way blockmodels for analyzing coordinated high-dimensional responses
- Multiobjective blockmodeling for social network analysis
- The random subgraph model for the analysis of an ecclesiastical network in Merovingian Gaul
- Evolution of social networks
- On the question of effective sample size in network modeling: an asymptotic inquiry
- Empirical Bayes estimation for the stochastic blockmodel
- A tutorial on methods for the modeling and analysis of social network data
- Editorial of the special issue ``Networks and statistics
- A limit theorem for scaled eigenvectors of random dot product graphs
- A nonparametric view of network models and Newman–Girvan and other modularities
- A survey of discrete methods in (algebraic) statistics for networks
- Sparse factor model for co-expression networks with an application using prior biological knowledge
- scientific article; zbMATH DE number 434919 (Why is no real title available?)
- Micro- and macromodels of social networks. II: Identification and simulation experiments
- Comparative study for inference of hidden classes in stochastic block models
- Asymptotics of score test in the generalized \(\beta\)-model for networks
- Goodness of Fit of Logistic Regression Models for Random Graphs
- Node Features Adjusted Stochastic Block Model
- Symmetric graph properties have independent edges
- Topological features of online social networks
- Exponential random simplicial complexes
- Consistency under sampling of exponential random graph models
- Mixture models and exploratory analysis in networks
- Maximum likelihood estimation in the -model
- scientific article; zbMATH DE number 125307 (Why is no real title available?)
- scientific article; zbMATH DE number 1072402 (Why is no real title available?)
- scientific article; zbMATH DE number 1975289 (Why is no real title available?)
- Community detection and stochastic block models: recent developments
- Statistical inference on random dot product graphs: a survey
- Sparse graphs using exchangeable random measures
- Statistical modelling of network panel data: Goodness of fit
- The impact of random models on clustering similarity
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Exact \(p\)-values for network interference
- A testing based extraction algorithm for identifying significant communities in networks
- scientific article; zbMATH DE number 934450 (Why is no real title available?)
- Universal latent space model fitting for large networks with edge covariates
- Introduction: special issue of statistical analysis and data mining on networks
- Confidence sets for network structure
- Review of statistical network analysis: models, algorithms, and software
- Text mining in computational advertising
- Model selection and clustering in stochastic block models based on the exact integrated complete data likelihood
- Bayesian consensus clustering in multiplex networks
- scientific article; zbMATH DE number 7370527 (Why is no real title available?)
- Edge sampling using local network information
- Detecting overlapping communities in networks using spectral methods
- Investigating competition in financial markets: a sparse autologistic model for dynamic network data
- Graphical models for complex networks: an application to Italian museums
This page was built for publication: A survey of statistical network models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5190072)
