Exponential random graph models

We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of… (More)

We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations… (More)

Modern multilevel analysis, whereby outcomes of individuals within groups take into account group membership, has been… (More)

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of… (More)

Exponential random graph models are extremely difficult models to handle from a statistical viewpoint, since their normalising… (More)

Methods for descriptive network analysis have reached statistical maturity and general acceptance across the social sciences in… (More)

For exponential random graph models, under quite general conditions, it is proved that induced subgraphs on node sets… (More)

Statistical modeling of social networks as complex systems has always been and remains a challenge for social scientists… (More)

The most promising class of statistical models for expressing structural properties of social networks observed at one moment in… (More)

This paper is about estimating the parameters of the exponential random graph model, also known as the p∗ model, using… (More)