Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry
Published in arXiv Preprint, 2025
We use eigenvalues of the graph laplacian to prove bounds on vertex congestion.
Recommended citation: Mukherjee, Sayan and Akiyama, Shinichiro. "Congestion bounds via Laplacian eigenvalues and their application to tensor networks with arbitrary geometry." arXiv Preprint arXiv:2510.02725 https://arxiv.org/abs/2510.02725