The problem of clustering or “community detection” in large random graphs has received a lot of attention recently. One thoroughly studied model is the so called “stochastic block model” (SBM), which models random undirected graphs with multiple communities.
In the present project, we aim at studying the community detection problem in directed random graphs. Interesting questions arise from the fact that the graph is directed.
Reference about the SBM:
Prerequisites for this project:
A taste for theory and a good background in analysis/probability!