MOMENT PROPERTIES OF SUBGRAPH COUNTS IN STOCHASTIC GRAPHS
Annals of the New York Academy of SciencesPublished 1 May 1979
Ove Frank
Citations26
SJR quartileQ1
SJR score1.46
SNIP1.73
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
S ummary Statistical analysis of stochastic graph models can be based on subgraph counts. General formulas are given which may be used to derive expected values, variances, and covariances of such graph statistics. Three different stochastic graph models are used as illustrations. Moments are given for certain dyad and triad counts in a graph with stochastically independent edge occurrences. Moments are also given for some subgraph count estimators which are based on a partially erased graph or a sampled subgraph.
Keywords
MathematicsPhysics and Astronomy
American Journal of SociologyA Method for Detecting Structure in Sociometric Data
490 Citations1970Paul W. Holland, Samuel Leinhardt
This model contains as special cases a number of previously suggested models, including the structural balance model of Cartwright and Harary, Davis's clustering model, and the ranked-clusters model of Davis and Leinhardt.
Transactions of the American Mathematical SocietyThe number of linear, directed, rooted, and connected graphs
129 Citations1955Frank Harary
Journal of Mathematical SociologyRandom directed graph distributions and the triad census in social networks†
68 Citations1977Stanley Wasserman
Methods are presented for calculating the mean and the covariance matrix of the triad census for the uniform distribution that conditions on the number of choices made by each individual in the social network.
Canadian Journal of MathematicsEnumeration Of Labelled Graphs
63 Citations1956E. N. Gilbert
The number of connected linear graphs having V vertices labelled 1, …, V and λ (unlabelled) lines is found below and similar formulas are found for graphs in which slings, lines “in parallel,” or both are allowed and for directed graphs with or without slings or parallel lines.
Statistics & DecisionsStatistical inference on graphs
43 Citations2006Gérard Biau, Kevin Bleakley
The problem of graph inference, or graph reconstruction, is to predict the presence or absence of edges between a set of given points known to form the vertices of a graph is shown to be random, with a probability distribution that possibly depends on the size of the graph.
Lecture notes in mathematicsEstimating the connectivity of a graph
18 Citations1972Michael Capobianco
STRUCTURE INFERENCE AND STOCHASTIC GRAPHS
14 Citations1968Ove Frank