A Central Limit Theorem for Functions on Weighted Sparse Inhomogeneous Random Graphs
von Moritz Wemheuer
Datum der mündl. Prüfung:2023-06-13
Erschienen:2023-07-13
Betreuer:Prof. Dr. Anja Sturm
Gutachter:Prof. Dr. Anja Sturm
Gutachter:Prof. Dr. Dominic Schuhmacher
Dateien
Name:wemheuer-clt-inhom-rg.pdf
Size:762.Kb
Format:PDF
Zusammenfassung
Englisch
We prove a central limit theorem for a certain class of functions on weighted sparse inhomogeneous random graphs. The proof uses a perturbative form of Stein's method and relies on a careful analysis of the local structure of the underlying sparse inhomogeneous random graphs (as the number of vertices in the graph tends to infinity), which we carry out in detail, as well as a local approximation property of the function, which is satisfied for a number of combinatorial optimisation problems. Our results extend recent work by Cao (2021, Ann. Appl. Probab. 31) for Erdős–Rényi graphs.
Keywords: inhomogeneous random graphs; weighted graphs; central limit theorem; combinatorial optimisation; Erdős–Rényi graph; Stein's method