Weighted Exponential Random Graph Models: Scope and Large Network Limits

Shankar Bhamidi, Suman Chakraborty, Skyler Cranmer, Bruce A. Desmarais, Jr.

Research output: Contribution to journalArticle

Abstract

We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration flows and neuroscience. Analogous to fundamental results derived for standard (unweighted) exponential random graph models in the work of Chatterjee and Diaconis, we derive limiting results for the structure of these models as the number of nodes goes to infinity. Our results are applicable for a wide variety of base measures including measures with unbounded support. We also derive sufficient conditions for continuity of functionals in the specification of the model including conditions on nodal covariates. Finally we include a number of open problems to spur further understanding of this model especially in the context of applications.

Original languageEnglish (US)
Pages (from-to)704-735
Number of pages32
JournalJournal of Statistical Physics
Volume173
Issue number3-4
DOIs
StatePublished - Nov 1 2018

Fingerprint

Graph Model
Random Graphs
Model
econometrics
Weighted Networks
Neuroscience
neurology
Econometrics
Migration
Covariates
Open Problems
continuity
functionals
infinity
Limiting
Trace
specifications
Infinity
Specification
Sufficient Conditions

All Science Journal Classification (ASJC) codes

  • Statistical and Nonlinear Physics
  • Mathematical Physics

Cite this

Bhamidi, Shankar ; Chakraborty, Suman ; Cranmer, Skyler ; Desmarais, Jr., Bruce A. / Weighted Exponential Random Graph Models : Scope and Large Network Limits. In: Journal of Statistical Physics. 2018 ; Vol. 173, No. 3-4. pp. 704-735.
@article{c564176ce6054b20a6b547219d99e763,
title = "Weighted Exponential Random Graph Models: Scope and Large Network Limits",
abstract = "We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration flows and neuroscience. Analogous to fundamental results derived for standard (unweighted) exponential random graph models in the work of Chatterjee and Diaconis, we derive limiting results for the structure of these models as the number of nodes goes to infinity. Our results are applicable for a wide variety of base measures including measures with unbounded support. We also derive sufficient conditions for continuity of functionals in the specification of the model including conditions on nodal covariates. Finally we include a number of open problems to spur further understanding of this model especially in the context of applications.",
author = "Shankar Bhamidi and Suman Chakraborty and Skyler Cranmer and {Desmarais, Jr.}, {Bruce A.}",
year = "2018",
month = "11",
day = "1",
doi = "10.1007/s10955-018-2103-0",
language = "English (US)",
volume = "173",
pages = "704--735",
journal = "Journal of Statistical Physics",
issn = "0022-4715",
publisher = "Springer New York",
number = "3-4",

}

Weighted Exponential Random Graph Models : Scope and Large Network Limits. / Bhamidi, Shankar; Chakraborty, Suman; Cranmer, Skyler; Desmarais, Jr., Bruce A.

In: Journal of Statistical Physics, Vol. 173, No. 3-4, 01.11.2018, p. 704-735.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Weighted Exponential Random Graph Models

T2 - Scope and Large Network Limits

AU - Bhamidi, Shankar

AU - Chakraborty, Suman

AU - Cranmer, Skyler

AU - Desmarais, Jr., Bruce A.

PY - 2018/11/1

Y1 - 2018/11/1

N2 - We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration flows and neuroscience. Analogous to fundamental results derived for standard (unweighted) exponential random graph models in the work of Chatterjee and Diaconis, we derive limiting results for the structure of these models as the number of nodes goes to infinity. Our results are applicable for a wide variety of base measures including measures with unbounded support. We also derive sufficient conditions for continuity of functionals in the specification of the model including conditions on nodal covariates. Finally we include a number of open problems to spur further understanding of this model especially in the context of applications.

AB - We study models of weighted exponential random graphs in the large network limit. These models have recently been proposed to model weighted network data arising from a host of applications including socio-econometric data such as migration flows and neuroscience. Analogous to fundamental results derived for standard (unweighted) exponential random graph models in the work of Chatterjee and Diaconis, we derive limiting results for the structure of these models as the number of nodes goes to infinity. Our results are applicable for a wide variety of base measures including measures with unbounded support. We also derive sufficient conditions for continuity of functionals in the specification of the model including conditions on nodal covariates. Finally we include a number of open problems to spur further understanding of this model especially in the context of applications.

UR - http://www.scopus.com/inward/record.url?scp=85049568453&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85049568453&partnerID=8YFLogxK

U2 - 10.1007/s10955-018-2103-0

DO - 10.1007/s10955-018-2103-0

M3 - Article

AN - SCOPUS:85049568453

VL - 173

SP - 704

EP - 735

JO - Journal of Statistical Physics

JF - Journal of Statistical Physics

SN - 0022-4715

IS - 3-4

ER -