✦ LIBER ✦

An introduction to exponential random graph (p*) models for social networks

✍ Scribed by Garry Robins; Pip Pattison; Yuval Kalish; Dean Lusher

Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 363 KB
Volume: 29
Category: Article
ISSN: 0378-8733
DOI: 10.1016/j.socnet.2006.08.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recent developments in exponential rando

Recent developments in exponential random graph (p*) models for social networks

✍ Garry Robins; Tom Snijders; Peng Wang; Mark Handcock; Philippa Pattison 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Closure, connectivity and degree distrib

Closure, connectivity and degree distributions: Exponential random graph (p*) models for directed social networks

✍ Garry Robins; Pip Pattison; Peng Wang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 1005 KB

New specifications for exponential random graph models. Sociological Methodology 36, exhibit substantial improvements in model fit compared with the commonly used Markov random graph models. Snijders et al., however, concentrated on non-directed graphs, with only limited extensions to directed graph

Missing data in networks: exponential ra

Missing data in networks: exponential random graph (p∗) models for networks with non-respondents

✍ Garry Robins; Philippa Pattison; Jodie Woolcock 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Survey studies of complete social networks often involve non-respondents, whereby certain people within the "boundary" of a network do not complete a sociometric questionnaire-either by their own choice or by the design of the study-yet are still nominated by other respondents as network partners. W

Techniques for analyzing dynamic random

Techniques for analyzing dynamic random graph models of web-like networks: An overview

✍ Aurel Cami; Narsingh Deo 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 835 KB

A comparison of various approaches to th

A comparison of various approaches to the exponential random graph model: A reanalysis of 102 student networks in school classes

✍ Miranda J. Lubbers; Tom A.B. Snijders 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 660 KB

A model for collaboration networks givin

A model for collaboration networks giving rise to a power-law distribution with an exponential cutoff

✍ Trevor Fenner; Mark Levene; George Loizou 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Recently several authors have proposed stochastic evolutionary models for the growth of complex networks that give rise to power-law distributions. These models are based on the notion of preferential attachment leading to the "rich get richer" phenomenon. Despite the generality of the proposed stoc