We propose and analyse a novel nonparametric goodness-of-fit testing procedure for exchangeable exponential random graph model (ERGM) when a single network realisation is observed. The test determines how likely it is that the observation is generated from a target unnormalised ERGM density. Our test statistics are derived of kernel Stein discrepancy, a divergence constructed via Stein’s method using functions from a reproducing kernel Hilbert space (RKHS), combined with a discrete Stein operator for ERGMs. The test is a Monte Carlo test using simulated networks from the target ERGM. We show theoretical properties for the testing procedure w.r.t a class of ERGMs. Simulation studies and real network applications are presented
The exponential-family random graph models (ERGMs) have emerged as an important framework for modeli...
Exponential random graph models (ERGMs) are increasingly applied to observed network data and are ce...
A complete survey of a network in a large population may be prohibitively difficult and costly. So i...
International audienceThe degrees are a classical and relevant way to study the topology of a networ...
We describe some of the capabilities of the ergm package and the statistical theory underlying it. T...
The most promising class of statistical models for expressing structural properties of social networ...
Exponential Family Random Graph Models (ERGM) are increasingly used in the study of social networks....
The Erd\"os Renyi graph is a popular choice to model network data as it is parsimoniously parametriz...
Graphs are the primary mathematical representation for networks, with nodes or vertices correspondin...
When using snowball sampling to estimate exponential random graph model (ERGM) parameters for very l...
Random graphs are matrices with independent 0–1 elements with probabilities determined by a small nu...
The degree variance has been proposed for many years to study the topology of a network. It can be u...
Exponential-family random graph models (ERGMs) represent the processes that govern the formation of...
The exponential-family random graph models (ERGMs) have emerged as an important framework for modeli...
Exponential random graph models (ERGMs) are increasingly applied to observed network data and are ce...
A complete survey of a network in a large population may be prohibitively difficult and costly. So i...
International audienceThe degrees are a classical and relevant way to study the topology of a networ...
We describe some of the capabilities of the ergm package and the statistical theory underlying it. T...
The most promising class of statistical models for expressing structural properties of social networ...
Exponential Family Random Graph Models (ERGM) are increasingly used in the study of social networks....
The Erd\"os Renyi graph is a popular choice to model network data as it is parsimoniously parametriz...
Graphs are the primary mathematical representation for networks, with nodes or vertices correspondin...
When using snowball sampling to estimate exponential random graph model (ERGM) parameters for very l...
Random graphs are matrices with independent 0–1 elements with probabilities determined by a small nu...
The degree variance has been proposed for many years to study the topology of a network. It can be u...
Exponential-family random graph models (ERGMs) represent the processes that govern the formation of...
The exponential-family random graph models (ERGMs) have emerged as an important framework for modeli...
Exponential random graph models (ERGMs) are increasingly applied to observed network data and are ce...
A complete survey of a network in a large population may be prohibitively difficult and costly. So i...