EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 30 (2026) ESAIM: PS, 30 (2026) 120-161 References
Open Access
Issue
ESAIM: PS
Volume 30, 2026
Page(s) 120 - 161
DOI https://doi.org/10.1051/ps/2025018
Published online 27 February 2026
  1. W.S. Robinson, A method for chronologically ordering archaeological deposits. Am. Antiq. 16 (1951) 293–301. [Google Scholar]
  2. W.F. Petrie, Sequences in prehistoric remains. J. Anthropol. Inst. Great Britain Ireland 29 (1899) 295–301. [Google Scholar]
  3. I. Liiv, Seriation and matrix reordering methods: an historical overview. Statist. Anal. Data Mining 3 (2010) 70–91. [Google Scholar]
  4. D.G. Corneil, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs. Discrete Appl. Math. 138 (2004) 371–379. [Google Scholar]
  5. J.E. Atkins, E.G. Boman and B. Hendrickson, A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput. 28 (1998) 297–310. [Google Scholar]
  6. H. Chuangpishit, M. Ghandehari, M. Hurshman, J. Janssen and N. Kalyaniwalla, Linear embeddings of graphs and graph limits. J. Combinat. Theory Ser. B 113 (2015) 162–184. [Google Scholar]
  7. L. Lovâsz, Large Networks and Graph Limits, Vol. 60. American Mathematical Society (2012). [Google Scholar]
  8. V. Bagaria, J. Ding, D. Tse, Y. Wu and J. Xu, Hidden Hamiltonian cycle recovery via linear programming. Oper. Res. 68 (2020) 53–70. [Google Scholar]
  9. T. Cai,, T. Liang and A. Rakhlin, On detection and structural reconstruction of small-world random networks. IEEE Trans. Netw. Sci. Eng. 4 (2017) 165–176. [Google Scholar]
  10. J. Ding, Y. Wu, J. Xu and D. Yang, Consistent recovery threshold of hidden nearest neighbor graphs. Proceedings of Thirty Third Conference on Learning Theory, Vol. 125 (2020) 1540–1553. [Google Scholar]
  11. Y. Issartel, C. Giraud and N. Verzelen, Minimax optimal seriation in polynomial time (2024) https://www.semanticscholar.org/paper/Minimax-optimal-seriation-in-polynomial-time-Issartel-Giraud/ba34785e6579da054149358453b7f368b61d929d. [Google Scholar]
  12. W.E. Donath and A.J. Hoffman, Lower bounds for the partitioning of graphs, in Selected Papers Of Alan J. Hoffman: With Commentary. World Scientific (2003) 437–442. [Google Scholar]
  13. U. Von Luxburg, A tutorial on spectral clustering. Statist. Comput. 17 (2007) 395–416. [Google Scholar]
  14. M. Avella-Medina, F. Parise, M. Schaub and S. Segarra, Centrality measures for graphons: accounting for uncertainty in networks. IEEE Trans. Netw. Sci. Eng. (2018). [Google Scholar]
  15. S. Chatterjee, Matrix estimation by universal singular value thresholding. Ann. Statist. 43 (2015) 177–214. [Google Scholar]
  16. F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zdeborova and P. Zhang, Spectral redemption in clustering sparse networks. Proc. Natl. Acad. Sci. U.S.A. 110 (2013) 20935–20940. [Google Scholar]
  17. U. Von Luxburg, M. Belkin and O. Bousquet, Consistency of spectral clustering. Ann. Statist. 36 (2008) 555–586. [Google Scholar]
  18. A. Daniely, N. Linial and M. Saks, Clustering is difficult only when it does not matter. preprint arXiv:1205.4891 (2012). [Google Scholar]
  19. J. Janssen and A. Smith, Reconstruction of line-embeddings of graphons. Electron. J. Statist. 16 (2022) 331–407. [Google Scholar]
  20. E. Abbe, Community detection and stochastic block models: recent developments. J. Mach. Learn. Res. 18 (2018) 1–86. [Google Scholar]
  21. F. Fogel, A. d'Aspremont and M. Vojnovic, Serialrank: spectral ranking using seriation, in Advances in Neural Information Processing Systems (2014) 900–908. [Google Scholar]
  22. I. Rocha, J. Janssen and N. Kalyaniwalla, Recovering the structure of random linear graphs. Linear Algebra Appl. 557 (2018) 234–264. [Google Scholar]
  23. C. Giraud, Y. Issartel and N. Verzelen, Localization in 1D non-parametric latent space models from pairwise affinities. Electron. J. Statist. 17 (2023) 1587–1662. [Google Scholar]
  24. N. Flammarion, C. Mao and P. Rigollet, Optimal rates of statistical seriation. Bernoulli 25 (2019) 623–653. [Google Scholar]
  25. A. Recanati, N. Servant, J.-P. Vert and A. d'Aspremont, Robust Seriation and Applications to Cancer Genomics. arXiv preprint arXiv:1806.00664 (2018). [Google Scholar]
  26. T.T. Cai and R. Ma, Matrix reordering for noisy disordered matrices: optimality and computationally efficient algorithms. IEEE Trans. Inform. Theory 70 (2024) 509–531. [Google Scholar]
  27. C. Mao, J. Weed and P. Rigollet, Minimax rates and efficient algorithms for noisy sorting. ALT (2019) https://proceedings.mlr.press/v83/mao18a.html. [Google Scholar]
  28. D. Glasscock, What is… a Graphon? Notices AMS 62 (2015). [Google Scholar]
  29. M. Reed, Methods of Modern Mathematical Physics: Functional Analysis. Elsevier (2012). [Google Scholar]
  30. D.E. Edmunds, A. Potter and C.A. Stuart, Non-compact positive operators. Proc. R. Soc. Lond. A 328 (1972) 67–81. [Google Scholar]
  31. K. Gustafson and J. Weidmann, On the essential spectrum. J. Math. Anal. Appl. 25 (1969) 121–127. [Google Scholar]
  32. G. Teschl, Mathematical methods in quantum mechanics. Grad. Stud. Math. 99 (2009) 106. [Google Scholar]
  33. I. Pinelis, Infimum upper bound (answer). MathOverflow. URL:https://mathoverflow.net/questions/324561/infimum-upper-bound (visited on 2021-09-10). [Google Scholar]
  34. F. Chung and M. Radcliffe, On the spectra of general random graphs. Electron. J. Combinatorics 18 (2011) 215. [Google Scholar]
  35. C. Davis and W.M. Kahan, The rotation of eigenvectors by a perturbation. SIAM J. Numer. Anal. 7 (1970) 1–46. [Google Scholar]
  36. P. Diaconis and R.L. Graham, Spearman's footrule as a measure of disarray. J. Roy. Statist. Soc. Ser. B (Methodological) 39 (1977) 262–268. [Google Scholar]
  37. E. Greene and J.A. Wellner, Exponential bounds for the hypergeometric distribution. Bernoulli 23 (2017) 1911. [Google Scholar]
  38. R.J. Serfling, Probability inequalities for the sum in sampling without replacement. Ann. Statist. 2018 (1974) 39–48. [Google Scholar]
  39. C. Mao, A. Pananjady and M.J. Wainwright, Breaking the 1/y/n barrier: faster rates for permutation-based models in polynomial time, in Proceedings of the 31st Conference on Learning Theory , edited by S. Bubeck, V. Perchet and P. Rigollet. Proceedings of Machine Learning Research Vol. 75 (2018) 2037–2042. [Google Scholar]
  40. E. Abbe, J. Fan, K. Wang and Y. Zhong, Entrywise eigenvector analysis of random matrices with low expected rank. Ann. Statist. 48 (2020) 1452–1474. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.