BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv5.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20220316T153000
DTEND;TZID=UTC:20220316T163000
DTSTAMP:20241004T144241
CREATED:20220314T110128Z
LAST-MODIFIED:20220314T110138Z
UID:6626-1647444600-1647448200@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Theodore Kolokolnikov (Dalhousie)
DESCRIPTION: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 and as well as the full spectrum distribution. For an integer d in [3\,8]\, we find families of random semi-regular graphs that have higher algebraic connectivity than a random d-regular graphs with the same number of vertices and edges. On the other hand\, we show that regular graphs beat semi-regular graphs when d >8. More generally\, we study random semi-regular graphs whose average degree is d\, not necessary an integer. This provides a natural generalization of a d-regular graph in the case of a non-integer d. We characterise their algebraic connectivity in terms of a root of a certain 6th-degree polynomial. Finally\, we construct a small-world-type network of average degree 2.5 with a relatively high algebraic connectivity. We also propose some related open problems and conjectures.
URL:https://aarms.math.ca/event/atlantic-graph-theory-seminar-theodore-kolokolnikov-dalhousie/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar
ORGANIZER;CN="Jason%20Brown":MAILTO:jason.brown@dal.ca
END:VEVENT
END:VCALENDAR