Asymptotic distributions in random graphs with applications to social networks
From MaRDI portal
Publication:3989499
DOI10.1111/j.1467-9574.1991.tb01311.xzbMath0764.92025MaRDI QIDQ3989499
Publication date: 28 June 1992
Published in: Statistica Neerlandica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-9574.1991.tb01311.x
survey; orthogonal projection; Bernoulli graphs; induced subgraph counts; asymptotic distributions of general subgraph counts; graph distributions; uniform graphs
91D30: Social networks; opinion dynamics
05C90: Applications of graph theory
05C80: Random graphs (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistical inference for a class of modified power series distributions with applications to random mapping theory
- When are small subgraphs of a random graph normally distributed?
- Asymptotic normality of graph statistics
- Survey sampling in graphs
- A graph theoretic approach to similarity relations
- On a random mapping (T, Pj)
- A functional limit theorem for random graphs with applications to subgraph count statistics
- Markov Graphs
- Random association of symmetric arrays
- Asymptotic Poisson distributions with applications to statistical analysis of graphs
- Asymptotic normality of triad counts in random digraphs
- Transitivity in stochastic graphs and digraphs
- An Exponential Family of Probability Distributions for Directed Graphs
- Random directed graph distributions and the triad census in social networks†
- Models for binary directed graphs and their applications
- Matrix measures for transitivity and balance*
- Stochastic Blockmodels for Directed Graphs
- Cluster Inference by Using Transitivity Indices in Empirical Graphs
- Multiple comparisons and sums of dissociated random variables
- Probability Distributions Related to Random Mappings
- Random Mappings with a Single Attracting Center
- Random mappings with an attracting center: Lagrangian distributions and a regression function
