Spectral Embeddings of Degree-$\alpha$ Laplacians in Random Dot Product Graphs

arXiv:2608. 10845v1 Announce Type: cross Abstract: Spectral clustering methods for network data are commonly based on a few matrix representations, such as the adjacency matrix and the symmetric Laplacian.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

• rag