Seriation of T{\oe}plitz and latent position matrices: optimal rates and
computational trade-offs
Seriation of T{\oe}plitz and latent position matrices: optimal rates and
computational trade-offs
In this paper, we consider the problem of seriation of a permuted structured matrix based on noisy observations. The entries of the matrix relate to an expected quantification of interaction between two objects: the higher the value, the closer the objects. A popular structured class for modelling such matrices is …