We consider relaxing the homogeneity assumption in exponential family random graph models (ERGMs) using binary latent class indicators. This may be interpreted as combining a posteriori blockmodelling with ERGMs, relaxing the independence assumptions of the former and the homogeneity assumptions of the latter. We propose a Markov chain Monte Carlo al- gorithm for drawing from the joint posterior of the model parameters and latent class indicator
Graphs are the primary mathematical representation for networks, with nodes or vertices correspondin...
In the study of social processes, the presence of unobserved heterogeneity is a regular concern. It...
Exponential random graph models (ERGMs) are a well-established family of statistical models for anal...
Exponential-family random graph models (ERGMs) represent the processes that govern the formation of...
We extend the well-known and widely used Exponential Random Graph Model (ERGM) by including nodal ra...
We present a selective review on probabilistic modeling of heterogeneity in random graphs....
We present a selective review on probabilistic modeling of heterogeneity in random graphs....
The most promising class of statistical models for expressing structural properties of social networ...
Markov chain Monte Carlo methods can be used to approximate the intractable normalizing constants th...
Bayesian inference for exponential random graph models Exponential random graph models are extremely...
We present a selective review on probabilistic modeling of heterogeneity in random graphs. We focus ...
We extend the well-known and widely used Exponential Random Graph Model (ERGM) by including nodal ra...
Markov chain Monte Carlo methods can be used to approximate the intractable normaliz-ing constants t...
Networks (graphs) are broadly used to represent relations between entities in a wide range of scient...
Graphs are the primary mathematical representation for networks, with nodes or vertices correspondin...
In the study of social processes, the presence of unobserved heterogeneity is a regular concern. It...
Exponential random graph models (ERGMs) are a well-established family of statistical models for anal...
Exponential-family random graph models (ERGMs) represent the processes that govern the formation of...
We extend the well-known and widely used Exponential Random Graph Model (ERGM) by including nodal ra...
We present a selective review on probabilistic modeling of heterogeneity in random graphs....
We present a selective review on probabilistic modeling of heterogeneity in random graphs....
The most promising class of statistical models for expressing structural properties of social networ...
Markov chain Monte Carlo methods can be used to approximate the intractable normalizing constants th...
Bayesian inference for exponential random graph models Exponential random graph models are extremely...
We present a selective review on probabilistic modeling of heterogeneity in random graphs. We focus ...
We extend the well-known and widely used Exponential Random Graph Model (ERGM) by including nodal ra...
Markov chain Monte Carlo methods can be used to approximate the intractable normaliz-ing constants t...
Networks (graphs) are broadly used to represent relations between entities in a wide range of scient...
Graphs are the primary mathematical representation for networks, with nodes or vertices correspondin...
In the study of social processes, the presence of unobserved heterogeneity is a regular concern. It...
Exponential random graph models (ERGMs) are a well-established family of statistical models for anal...