The random greedy algorithm for finding a maximal independent set in a graph constructs a
maximal independent set by inspecting the graph's vertices in a random order, adding the …

Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard
task. Using scaling limits, we characterise the asymptotics of sequential degree-greedy …

This thesis deals with the study of parking models on random graphs and trees in a broad
sense. First we investigate two algorithms which enable us to find a large independent set of …

In this work, we propose a large-graph limit estimate of the matching coverage for several
matching algorithms, on general graphs generated by the configuration model. For a wide …

We consider an SIR model with vaccination strategy on a sparse configuration model
random graph. We show the convergence of the system when the number of nodes grows …

We investigate random sequential adsorption (RSA) on a random graph via the following
greedy algorithm: Order the n vertices at random, and sequentially declare each vertex …

In this paper, we present an approximation of the matching coverage on large bipartite
graphs, for local online matching algorithms based on the sole knowledge of the remaining …

Computing the size of maximum independent sets is an NPhard problem for fixed graphs.
Characterizing and designing efficient algorithms to compute (or approximate) this …

We consider exploration algorithms of the random sequential adsorption type both for
homogeneous random graphs and random geometric graphs based on spatial Poisson …

We prove a large deviation principle for a greedy exploration process on an Erd\" os-R\'enyi
(ER) graph when the number of nodes goes to infinity. To prove our main result, we use the …