scientific article; zbMATH DE number 6860854
From MaRDI portal
Publication:4637082
zbMath1444.62083arXiv1610.06511MaRDI QIDQ4637082
Shankar Bhamidi, James D. Wilson, John Palowitch, Andrew B. Nobel
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1610.06511
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational methods for problems pertaining to statistics (62-08) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items (6)
Hurdle Blockmodels for Sparse Network Modeling ⋮ Spectral and matrix factorization methods for consistent community detection in multi-layer networks ⋮ Semidefinite programming based community detection for node-attributed networks and multiplex networks ⋮ Covariate-Assisted Community Detection in Multi-Layer Networks ⋮ MultilayerExtraction ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Belief propagation, robust reconstruction and optimal recovery of block models
- A testing based extraction algorithm for identifying significant communities in networks
- Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel
- The asymptotic number of labeled graphs with given degree sequences
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- Consistency of community detection in networks under degree-corrected stochastic block models
- ABACUS: frequent pattern mining-based community discovery in multidimensional networks
- A nonparametric view of network models and Newman–Girvan and other modularities
- Finding Planted Partitions in Random Graphs with General Degree Distributions
- Mixed membership stochastic blockmodels
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- On Finding Graph Clusterings with Maximum Modularity
- Communities in Networks
- Stochastic Blockmodels for Directed Graphs
- Structure of triadic relations in multiplex networks
- On Clustering on Graphs with Multiple Edge Types
- Computing Communities in Large Networks Using Random Walks
- Modularity bounds for clusters located by leading eigenvectors of the normalized modularity matrix
This page was built for publication:
