scientific article; zbMATH DE number 6982944
From MaRDI portal
Publication:4558517
zbMath1472.62123arXiv1601.05630MaRDI QIDQ4558517
John Palowitch, Andrew B. Nobel, Shankar Bhamidi
Publication date: 22 November 2018
Full work available at URL: https://arxiv.org/abs/1601.05630
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Parametric hypothesis testing (62F03) Central limit and other weak theorems (60F05) Applications of graph theory (05C90) Learning and adaptive systems in artificial intelligence (68T05) Paired and multiple comparisons; multiple testing (62J15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A testing based extraction algorithm for identifying significant communities in networks
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- The asymptotic number of non-negative integer matrices with given row and column sums
- Connected components in random graphs with given expected degree sequences
- Consistency of community detection in networks under degree-corrected stochastic block models
- A nonparametric view of network models and Newman–Girvan and other modularities
- Finding Planted Partitions in Random Graphs with General Degree Distributions
- Communities in Networks
- Power-Law Distributions in Empirical Data
- The Structure and Function of Complex Networks
- Estimation and Prediction for Stochastic Blockstructures
- Learning latent block structure in weighted networks
- A critical point for random graphs with a given degree sequence
- Clustering of sparse data via network communities—a prototype study of a large online market
- Fast unfolding of communities in large networks
- Computing Communities in Large Networks Using Random Walks
- Overlapping community detection in networks
- The average distances in random graphs with given expected degrees
This page was built for publication:
