Papers
Topics
Authors
Recent
Search
2000 character limit reached

Exponential random graph models

Published 29 Oct 2012 in physics.soc-ph, cond-mat.dis-nn, and cs.SI | (1210.7828v1)

Abstract: Nowadays, exponential random graphs (ERGs) are among the most widely-studied network models. Different analytical and numerical techniques for ERG have been developed that resulted in the well-established theory with true predictive power. An excellent basic discussion of exponential random graphs addressed to social science students and researchers is given in [Anderson et al., 1999][Robins et al., 2007]. This essay is intentionally designed to be more theoretical in comparison with the well-known primers just mentioned. Given the interdisciplinary character of the new emerging science of complex networks, the essay aims to give a contribution upon which network scientists and practitioners, who represent different research areas, could build a common area of understanding.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.