Large Deviation Principle for the Maximal Eigenvalue of Inhomogeneous Erdős-Rényi Random Graphs

We consider an inhomogeneous Erdős-Rényi random graph G N with vertex set [ N ] = { 1 , ⋯ , N } for which the pair of vertices i , j ∈ [ N ] , i ≠ j , is connected by an edge with probability r ( i N , j N ) , independently of other pairs of vertices. Here, r : [ 0 , 1 ] 2 → ( 0 , 1 ) is a symmetric...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of theoretical probability 2022-12, Vol.35 (4), p.2413-2441
Hauptverfasser:	Chakrabarty, Arijit, Hazra, Rajat Subhra, Hollander, Frank den, Sfragara, Matteo
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Deviation Eigenvalues Graph theory Mathematics Mathematics and Statistics Principles Probability Theory and Stochastic Processes Statistics Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!