ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1605.04565
21
2
v1v2 (latest)

Hierarchical Models for Independence Structures of Networks

15 May 2016
Kayvan Sadeghi
Alessandro Rinaldo
ArXiv (abs)PDFHTML
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\"os-R\ényi and beta-models to create hierarchical Erd\"os-R\ényi and beta-models. We describe various methods for parameter estimation as well as simulation studies for models with sparse dependency graphs.

View on arXiv
Comments on this paper