Metraipolis › archive › dc_7efe9323a93e

Spectral Embeddings of Degree-$α$ Laplacians in Random Dot Product Graphs — arXiv:2608.10845

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.10845
License (as archived)
CC0-1.0
Archived
2026-10-19T06:19:50.754Z
SHA-256 of the archived text
9db15e02ede2cc726e7faa6aa773057e1a60439a2a5cf4df1ff7922598a612d3
Stable URL of this page
https://metraipolis.com/documento/dc_7efe9323a93e

How to cite

Spectral Embeddings of Degree-$α$ Laplacians in Random Dot Product Graphs — arXiv:2608.10845 — arXiv (en), https://arxiv.org/abs/2608.10845 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7efe9323a93e (Metraipolis archive dc_7efe9323a93e, sha256 9db15e02ede2cc726e7faa6aa773057e1a60439a2a5cf4df1ff7922598a612d3)
BibTeX
@misc{dc7efe9323a93e,
  title = {Spectral Embeddings of Degree-$α$ Laplacians in Random Dot Product Graphs — arXiv:2608.10845},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.10845},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7efe9323a93e; sha256 9db15e02ede2cc726e7faa6aa773057e1a60439a2a5cf4df1ff7922598a612d3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.10845. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Spectral clustering methods for network data are commonly based on a few matrix representations, such as the adjacency matrix and the symmetric Laplacian. We study a continuum of degree-normalized spectral embeddings that includes these commonly used choices as special cases. Under a random dot product graph model, we establish a row-wise central limit theorem for this family of embeddings. The result provides an explicit description of how degree normalization affects both population geometry and the local uncertainty of embedded nodes. We use the limiting distributions to compare different normalizations in two-community stochastic block models through a projected-Gaussian Bayes-error diagnostic. These comparisons show that no single normalization is uniformly preferred. Instead, the favored normalization depends on network density, community imbalance, and block-probability structure. Typically, stronger normalization is favored in lower-density or more imbalanced settings. These results provide a unified distributional understanding of when and why alternative normalizations may improve spectral clustering.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-12 in cs.LG).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.10845 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T06:11:45.148Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).