Talks' abstracts > Corujo Rodriguez Josué

We consider a finite inhomogeneous random graph evolving in continuous time, where each vertex has a positive mass and each edge between two vertices appears at a rate equal to the product of their masses. In the special case of n vertices of equal mass 1, we recover the Erdős–Rényi random graph process, in which each edge appears after an exponential waiting time with rate 1. We show how the process recording the sizes of the connected components and the number of surplus edges can be encoded through an exploration process. We also show that this approach makes it possible to recover, in a simple way, some well-known results for the supercritical Erdős–Rényi random graph process.

Work in collaboration with Vlada Limic (CNRS, Université de Strasbourg).