Wireless random-access networks and spectra of random graphs

Author(s):
Sfragara, M. (0000-0002-2404-5161)
Published
2020
Publication type
Doctoral Thesis

Abstract

This thesis is divided into two parts. In Part I we study metastability properties of queue-based random-access protocols for wireless networks. The network is modeled

as a bipartite graph whose edges represent interference constraints. In Part II we study spectra of inhomogeneous Erdős-Rényi random graphs. We focus in particular

on the limiting spectral distribution of the adjacency and Laplacian matrices and on the largest eigenvalue of the adjacency matrix.

Wireless networksRandom-access protocolsMetastabilityTransition timeInhomogeneous Erdős-Rényi graphsEmpirical spectral distributionAdjacency matrixLaplacian matrixLargest eigenvalueLarge deviations
Defense date
2020-10-28
Language
English
Supervisor(s)
Hollander W.T.F. den, Borst S.C., Nardi F.R.
Committee member(s)
Eliel, E.R.; Edixhoven, S.J.; Baccelli, F.; Mandjes, M.R.H.; Miclo, L.
Qualification
Ph.D.
Degree granting institution
Mathematical Institute (MI), Faculty of Science, Leiden University, Leiden
hdl
1887/137987