Book Chapter

Social networks, exponential random graph (p ∗) models for

G Robins

Computational Complexity: Theory, Techniques, and Applications | Published : 2012

Abstract

Article Outline: Glossary Definition of the Subject Introduction Notation and Terminology Dependence Hypotheses Bernoulli Random Graph (Erdös-Rényi) Models Dyadic Independence Models Markov Random Graphs Simulation and Model Degeneracy Social Circuit Dependence: Partial Conditional Dependence Hypotheses Social Circuit Specifications Estimation Goodness of Fit and Comparisons with Markov Models Further Extensions and Future Directions Bibliography Exponential random graph modelsExponential random graph model, also known as p∗ models, constitute a family of statistical models for socialnetworks. The importance of this modeling framework lies in its capacity to represent social structural effec..

View full abstract

Citation metrics