Random directed graph distributions and the triad census in social networks†

DOI10.1080/0022250X.1977.9989865zbMath0381.92021OpenAlexW4252188905MaRDI QIDQ4161142

Stanley Wasserman

Publication date: 1977

Published in: The Journal of Mathematical Sociology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0022250x.1977.9989865

Mathematics Subject Classification ID

Mathematical sociology (including anthropology) (91D99)

Related Items (13)

A tutorial on methods for the modeling and analysis of social network data ⋮ Asymptotic distributions in random graphs with applications to social networks ⋮ Asymptotic normality of graph statistics ⋮ Complex networks: structure and dynamics ⋮ Statistical inference for continuous‐time Markov processes with block structure based on discrete‐time network data ⋮ Dynamics of random graphs with bounded degrees ⋮ Parties and networks: Stochastic models for relationship networks ⋮ Enumeration and simulation methods for 0-1 matrices with given marginals ⋮ An efficient MCMC algorithm to sample binary matrices with fixed marginals ⋮ Transitivity in stochastic graphs and digraphs ⋮ Estimating a graph from triad counts ⋮ Transitivity and the path census in sociometry ⋮ Statistical evaluation of algebraic constraints for social networks

Cites Work

• The structural implications of measurement error in sociometry†
• Unnamed Item
• Unnamed Item

This page was built for publication: Random directed graph distributions and the triad census in social networks†