Mixing time and cutoff for simple random walks on the Chung-Lu directed graph

Giacomo PASSUELLO
Università degli studi di Padova

Date(s) : 07/05/2024   iCal
14 h 30 min - 15 h 30 min

In this talk, we consider a simple random walk defined on a
Chung-Lu directed graph. This is an inhomogeneous random network that
extends the Erdős-Renyi random digraph, where edges are included
independently according to given Bernoulli laws. In this non-reversible
setting, we will focus on the convergence toward the equilibrium of the
dynamics. In particular, under the assumption that average out-degrees grow
logarithmically in the size n of the graph (weakly dense regime), we will
establish a cutoff phenomenon at the entropic time of order
log(n)/loglog(n). We will show that, on a precise time window, the cutoff
profile is given by the Gaussian tail function. Our analysis provides a
relaxation, to a soft-constrained model, of the cutoff result proved by
Bordenave, Caputo, and Salez for the directed configuration model, where
degrees are deterministically fixed.
Joint work with A. Bianchi.

Emplacement
Salle de séminaire de l'I2M à St Charles

Catégories



Retour en haut 

Secured By miniOrange