Aspects of random graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Habilitation À Diriger Des Recherches Year : 2016

Aspects of random graphs


The present report aims at giving a survey of my work since the end of my PhD thesis "Spectral Methods for Reconstruction Problems". Since then I focussed on the analysis of properties of different models of random graphs as well as their connection to real-world networks. This report's goal is to capture these problems in a common framework. The very last chapter of this thesis about results in bootstrap percolation is different in the sense that the given graph is deterministic and only the decision of being active for each vertex is probabilistic; since the proof techniques resemble very much results on random graphs, we decided to include them as well. We start with an overview of the five random graph models, and with the description of bootstrap percolation corresponding to the last chapter. Some properties of these models are then analyzed in the different parts of this thesis.
Fichier principal
Vignette du fichier
Habilitation-12pt.pdf (642.29 Ko) Télécharger le fichier

Dates and versions

tel-01291970 , version 1 (22-03-2016)


  • HAL Id : tel-01291970 , version 1


Dieter Mitsche. Aspects of random graphs. Probability [math.PR]. Université de Nice Sophia-Antipolis, 2016. ⟨tel-01291970⟩
149 View
266 Download


Gmail Facebook Twitter LinkedIn More