Title: Increasing paths in random temporal graphs

Speaker: Gábor Lugosi (ICREA and Universitat Pompeu Fabra)

Abstract: Motivated by modeling time dependent processes on networks like social interactions and infection spread, we consider a version of the classical Erdős–Rényi random graph G(n,p) where each edge has a distinct random time stamp, and connectivity is constrained to sequences of edges with increasing time stamps. We study the lengths of increasing paths: the lengths of the shortest and longest paths between typical vertices, the maxima of these lengths from a given vertex, as well as the maxima between any two vertices; this covers the (temporal) diameter.

This talk is based on joint work with Nicolas Broutin and Nina Kamčev.

May 20, from 3:30 p.m. to 4:30 p.m. (Rio de Janeiro local time)

Local: This meeting will take place at room C116 - Bloco C - CT – Instituto de Matemática – UFRJ.

Organizers: Giulio Iacobelli e Maria Eulalia Vares

More complete information about the seminars can be found HERE.