Cargando…
Fast Community Detection with Graph Sparsification
A popular model for detecting community structure in large graphs is the Stochastic Block Model (SBM). The exact parameters to recover the community structure of a SBM has been well studied, and many methods have been proposed to recover a nodes’ community membership. A popular approach is to use sp...
Autor principal: | Laeuchli, Jesse |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7206315/ http://dx.doi.org/10.1007/978-3-030-47426-3_23 |
Ejemplares similares
-
Faster Cut Sparsification of Weighted Graphs
por: Forster, Sebastian, et al.
Publicado: (2022) -
Topology-based sparsification of graph annotations
por: Danciu, Daniel, et al.
Publicado: (2021) -
Coverage-preserving sparsification of overlap graphs for long-read assembly
por: Jain, Chirag
Publicado: (2023) -
On the combinatorics of sparsification
por: Huang, Fenix WD, et al.
Publicado: (2012) -
Nonparametric Sparsification of Complex Multiscale Networks
por: Foti, Nicholas J., et al.
Publicado: (2011)