Content deleted Content added
RezaKhazar (talk | contribs) |
CoralisTree (talk | contribs) Added an example problem in the definition of the model |
||
Line 6:
* a partition of the vertex set <math>\{1,\ldots,n\}</math> into disjoint subsets <math>C_1,\ldots,C_r</math>, called ''communities'';
* a symmetric <math>r \times r</math> matrix <math>P</math> of edge probabilities.
The edge set is then sampled at random as follows: any two vertices <math>u \in C_i</math> and <math>v \in C_j</math> are connected by an edge with probability <math>P_{ij}</math>. An example problem is: given a graph with <math>n</math>vertices, where the edges are sampled as described, recover the groups <math>C_1,\ldots,C_r</math>.
== Special cases ==
| |||