Block Dense Weighted Networks with Augmented Degree Correction
Not on the map. Why?
Abstract (arXiv)
Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We propose a new framework for generating and estimating dense weighted networks with potentially different connectivity patterns across different communities. The proposed model relies on a particular class of functions which map individual node characteristics to the edges connecting those nodes, allowing for flexibility while requiring a small number of parameters relative to the number of edges. By leveraging the estimation techniques, we also develop a bootstrap methodology for generating new networks on the same set of vertices, which may be useful in circumstances where multiple data sets cannot be collected. Performance of these methods are analyzed in theory, simulations, and real data.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 38 references that are in the map. First posted on arXiv 26 May 2021.
Builds on
12 of 38 references.
References · 12
- 2016Community Detection in Degree-Corrected Block Modelscited by 36
- 2016Network cross-validation by edge samplingcited by 26
- 2014Learning Latent Block Structure in Weighted Networkscited by 23
- 2019Bootstrapping Networks with Latent Space Structurecited by 12
- 2017Nonparametric weighted stochastic block modelscited by 10
- 2013Subsampling bootstrap of count features of networkscited by 8
- 2013Adapting the Stochastic Block Model to Edge-Weighted Networkscited by 7
- 2017Bootstrapping Exchangeable Random Graphscited by 7
- 2013Testing and Modeling Dependencies Between a Network and Nodal Attributescited by 5
- 2018A Bootstrap Method for Goodness of Fit and Model Selection with a Single Observed Networkcited by 5
- 2019Snowboot: Bootstrap Methods for Network Inferencecited by 2
- 2017Weighted network estimation by the use of topological graph metricscited by 1
Built on by
Not cited yet.