1 citations · 1 across the 3 of their papers we have counts for
4 papers
A Note on Projection-Based Recovery of Clusters in Markov Chains
Sam Cole
Let be the transition matrix of a purely clustered Markov chain, i.e. a direct sum of irreducible stochastic matrices. Given a perturbation of $T…
Clusters in Markov Chains via Singular Vectors of Laplacian Matrices
Sam Cole, Steve Kirkland
Suppose that is a stochastic matrix. We propose an algorithm for identifying clusters in the Markov chain associated with . The algorithm is recursive in nature, and in orde…
Exact Recovery in the Hypergraph Stochastic Block Model: a Spectral Algorithm
Sam Cole, Yizhe Zhu
We consider the exact recovery problem in the hypergraph stochastic block model (HSBM) with blocks of equal size. More precisely, we consider a random -uniform hypergraph $H…
Recovering Nonuniform Planted Partitions via Iterated Projection
Sam Cole
In the planted partition problem, the vertices of a random graph are partitioned into "clusters," and edges between vertices in the same cluster and different clusters are…