Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
en:projects:mth:lthi9 [2016/04/11 21:39]
leveque
en:projects:mth:lthi9 [2016/04/11 22:17] (current)
leveque
Line 1: Line 1:
-====== Community detection in directed graphs ======+===== Community detection in directed graphs ===== 
 +\\
  
 +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.
  
-[[https://​ipgwww.epfl.ch/​doku.php?​id=en:​projects|Back to Projects page]]+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:** Deshpande-Abbe-Montanari (2015)\\ 
 +\\ 
 + 
 +**Prerequisites for this project:** a taste for theory and a good background in analysis/​probability! \\ 
 +\\ 
 + 
 +**Contact:​** olivier.leveque#​epfl.ch (LTHI)\\ 
 +\\ 
 + 
 + 
 +[[https://​ipgwww.epfl.ch/​doku.php?​id=en:​projects|Back to projects menu]]
  

Last modified:: %2016/%04/%11 %21:%Apr