This article is within the scope of WikiProject Statistics, a collaborative effort to improve the coverage of statistics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.StatisticsWikipedia:WikiProject StatisticsTemplate:WikiProject StatisticsStatistics articles
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
This article was reviewed by member(s) of WikiProject Articles for creation. The project works to allow users to contribute quality articles and media files to the encyclopedia and track their progress as they are developed. To participate, please visit the project page for more information.Articles for creationWikipedia:WikiProject Articles for creationTemplate:WikiProject Articles for creationAfC articles
Latest comment: 9 years ago1 comment1 person in discussion
It'd be great to have plots for the impossibility thresholds, maybe marked with text "possible" / "impossible"
Overall this article is probably a little dense. Plots as above would help a little. But community structure is always a slightly lighter introduction; maybe we can point there for that purpose.
It'd be nice to expand the Algorithms section. Cite Hajek–Wu–Xu, Agarwal et al for SDP approaches; mention this "no-return random walks" idea from Massoulié to overcome spectral noise in constant-average-degree graphs, and also maybe cover some of the less recent techniques (e.g. Girvan–Newman modularity), though those are covered somewhat in community structure.
Say more about variants: censored block model, mixed-membership models, etc. These could each get a section.
Worth describing the statistical thresholds as being like the giant component / connectivity thresholds in ER random graphs, but with some oversampling?
Latest comment: 3 years ago1 comment1 person in discussion
I have added a self-created image of an assortative case of the stochastic block model with two communities. The image has also been uploaded to Wikimedia Commons.
Rosey9921 (talk) 04:04, 20 April 2021 (UTC)Reply
