en
0.25
0.5
0.75
1.25
1.5
1.75
2
Community Detection via Random and Adaptive Sampling
Published on Jul 15, 20142650 Views
In this paper, we consider networks consisting of a finite number of non-overlapping communities. To extract these communities, the interaction between pairs of nodes may be sampled from a large avail
Related categories
Chapter list
Community Detection via Random and Adaptive Sampling00:00
Community detection in networks00:12
Stochastic Block (SB) model - 100:44
Stochastic Block (SB) model - 201:00
Stochastic Block (SB) model - 301:01
Stochastic Block (SB) model - 401:02
Stochastic Block (SB) model - 501:07
Stochastic Block (SB) model - 601:09
Sampling Framework01:19
Sampling Strategies02:06
Objectives03:35
Solvability and the SBM - 104:39
Solvability and the SBM - 205:16
Sparse graphs05:26
SBM05:54
Solvability - Generic Random Sampling - 106:30
Solvability - Adaptive Sampling - 106:39
Fundamental limits - 107:09
Fundamental limits - 207:35
Fundamental limits - 308:33
Fundamental limits - 409:55
Algorithms for non-adaptive sampling10:41
Performance - 112:10
Algorithms for adaptive sampling13:01
Performance - 214:18
Solvability - Generic Random Sampling - 214:57
Solvability - Adaptive Sampling - 215:22
SBM: A Numerical Example15:48
Summary16:24
Thanks!17:09