Sadeghi, K;
Rinaldo, A;
(2020)
Hierarchical models for independence structures of networks.
Statistica Neerlandica
, 74
(3)
pp. 439-457.
10.1111/stan.12200.
Preview |
Text
1605.04565v2.pdf - Accepted Version Download (4MB) | Preview |
Abstract
We introduce a new family of network models, called hierarchical network models, that allow us to represent in an explicit manner the stochastic dependence among the dyads (random ties) of the network. In particular, each member of this family can be associated with a graphical model defining conditional independence clauses among the dyads of the network, called the dependency graph. Every network model with dyadic independence assumption can be generalized to construct members of this new family. Using this new framework, we generalize the Erdös–Rényi and the β models to create hierarchical Erdös–Rényi and β models. We describe various methods for parameter estimation, as well as simulation studies for models with sparse dependency graphs.
| Type: | Article |
|---|---|
| Title: | Hierarchical models for independence structures of networks |
| Open access status: | An open access version is available from UCL Discovery |
| DOI: | 10.1111/stan.12200 |
| Publisher version: | https://doi.org/10.1111/stan.12200 |
| Language: | English |
| Additional information: | This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions. |
| Keywords: | dependency graph, exponential random graph models, graphical models, log‐linear models, social network analysis |
| UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Maths and Physical Sciences > Dept of Statistical Science |
| URI: | https://discovery.ucl.ac.uk/id/eprint/10088904 |
Archive Staff Only
 |
View Item |
