MoN15: Fifteenth Mathematics of Networks meeting

Orestis Georgiou (Toshiba) – Algebraic connectivity of keyhole random geometric graphs

The algebraic connectivity of graphs is an important measure of connectivity and how quickly a distributed synchronization process supported on the graph can reach consensus. We investigate a class of graphs consisting of two weakly connected graphs linked together by independent bridging links for which we derive analytic expressions for the algebraic connectivity. We then show how our results can affect wireless ad hoc networks in keyhole-like noisy deployments, and how we may control such deployments in order to improve network synchronizability.

Return to previous page

Contact: Keith Briggs (mailto:keith.briggs_at_bt_dot_com) or Richard G. Clegg (