Groupies in multitype random graphs
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random b...
| Main Author: | |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Springer International Publishing
2016
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4937013/ |