The planted partition model (also known as the stochastic blockmodel) is a classical cluster-exhibiting random graph model that has been extensively studied in statistics, physics, and computer science. In its simplest form, the planted partition model is a model for random graphs on (Formula presented.) nodes with two equal-sized clusters, with an between-class edge probability of (Formula presented.) and a within-class edge probability of (Formula presented.). Although most of the literature on this model has focused on the case of increasing degrees (ie. (Formula presented.) as (Formula presented.)), the sparse case (Formula presented.) is interesting both from a mathematical and an applied point of view. A striking conjecture of Decelle...
Lectures #6–8 proposed several different “stability conditions ” on problem instances, of var-ious N...
The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, ...
We give an algorithm that, with high probability, recovers a planted k-partition in a random graph, ...
Graph clustering involves the task of partitioning nodes, so that the edge density is higher within ...
We consider a degree-corrected planted-partition model: a random graph on $n$ nodes with two equal-s...
International audienceThe labeled stochastic block model is a random graph model representing networ...
Abstract—The binary symmetric stochastic block model deals with a random graph of n vertices partiti...
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) f...
Abstract. A partitioning of a set of n items is a grouping of these items into k disjoint, equally s...
The planted bisection model is a random graph model in which the nodes are divided into two equal-si...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
The stochastic block model is a classical cluster-exhibiting random graph model that has been widely...
The stochastic block model is a classical clusterexhibiting random graph model that has been widely ...
Many popular random partition models, such as the Chinese restaurant process and its two-parameter e...
We consider the problem of recovering a planted partition such as a coloring, a small bisection, or ...
Lectures #6–8 proposed several different “stability conditions ” on problem instances, of var-ious N...
The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, ...
We give an algorithm that, with high probability, recovers a planted k-partition in a random graph, ...
Graph clustering involves the task of partitioning nodes, so that the edge density is higher within ...
We consider a degree-corrected planted-partition model: a random graph on $n$ nodes with two equal-s...
International audienceThe labeled stochastic block model is a random graph model representing networ...
Abstract—The binary symmetric stochastic block model deals with a random graph of n vertices partiti...
We consider the problem of recovering a planted partition (e.g., a small bisection or a large cut) f...
Abstract. A partitioning of a set of n items is a grouping of these items into k disjoint, equally s...
The planted bisection model is a random graph model in which the nodes are divided into two equal-si...
These notes are not necessarily an accurate representation of what happened in class. The notes writ...
The stochastic block model is a classical cluster-exhibiting random graph model that has been widely...
The stochastic block model is a classical clusterexhibiting random graph model that has been widely ...
Many popular random partition models, such as the Chinese restaurant process and its two-parameter e...
We consider the problem of recovering a planted partition such as a coloring, a small bisection, or ...
Lectures #6–8 proposed several different “stability conditions ” on problem instances, of var-ious N...
The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, ...
We give an algorithm that, with high probability, recovers a planted k-partition in a random graph, ...