It Is Better to Be Semi-Regular When You Have a Low Degree

We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity as well as the full spectrum distribution. For an integer <inline-formula><math xmlns="http://w...

Full description

Saved in:
Bibliographic Details
Main Author: Theodore Kolokolnikov
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Entropy
Subjects:
Online Access:https://www.mdpi.com/1099-4300/26/12/1014
Tags: Add Tag
No Tags, Be the first to tag this record!