Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Exponential random graph models

Known as: Exponential random graph model 
Exponential random graph models (ERGMs) are a family of statistical models for analyzing data about social and other networks.
Wikipedia

Related topics

Related topics

8 relations
Degree-preserving randomizationErdős–Rényi modelNetwork scienceRandom graph
Expand

Broader (1)

Network theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Understanding network formation in strategy research: Exponential random graph models
Research summary: This article uses Exponential Random Graph Models (ERGMs) to advance strategic management research, focusing on… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 3
Is this relevant?
2016
2016
Snowball sampling for estimating exponential random graph models for large networks
Abstract The exponential random graph model (ERGM) is a well-established statistical approach to modelling social network data… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Estimating and understanding exponential random graph models
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Exponential random graph models for multilevel networks
a b s t r a c t Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has… Expand
  • figure 1
  • figure 2
  • table 3
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Exponential Random Graph Models for Social Networks
Exponential random graph models (ERGMs) are increasingly applied to observed network data and are central to understanding social… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Inferential Network Analysis with Exponential Random Graph Models
Methods for descriptive network analysis have reached statistical maturity and general acceptance across the social sciences in… Expand
  • figure 1
  • figure 3
  • table 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Bayesian inference for exponential random graph models
Abstract Exponential random graph models are extremely difficult models to handle from a statistical viewpoint, since their… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Exponential random graph models for affiliation networks
  • P. Wang
  • Soc. Networks
  • 2009
    • Corpus ID: 14207326
Abstract Recent advances in Exponential Random Graph Models (ERGMs), or p ∗ models, include new specifications that give a much… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks
Abstract The new higher order specifications for exponential random graph models introduced by Snijders et al. [Snijders, T.A.B… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Markov Chain Monte Carlo Estimation of Exponential Random Graph Models
This paper is about estimating the parameters of the exponential random graph model, also known as the p∗ model, using… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE