# Seminars

GALaC organizes or participates in three different regular seminars.

## GALaC team seminar

The GALaC team seminar is organized once a month on Friday at 14:30 in the Ada Lovelace building at LRI. Recent and up-coming seminars

## Plateau Saclay Combinatorics Seminar

The Plateau Saclay Combinatorics Seminar is held every Wednesday morning at 11 AM in room Flajolet (top floor on the left) at LIX. It is co-organized by the Combi team of LIX and the GALaC team. The mailing list for this seminar is combi_lix_lri@services.cnrs.fr. Subscribe to this ...

## Plateau Saclay Algorithms Seminar

The Plateau Saclay Algorithms Seminar is held every other Friday afternoon in LIX. This working group is partially supported by Labex DigiCosme (Digital worlds: distributed data, programs and architectures). If you do wish (or not) to receive any emails from this seminar, you can subscribe or unsubscribe from the mailing ...

## Self-Stabilization and Byzantine Tolerance for Maximal Matching

Summary: We analyse the impact of transient and Byzantine faults on the construction of a maximal matching in a general network. In particular, we consider the self-stabilizing algorithm called AnonyMatch presented by Cohen et al. in PPL'2016 for computing such a matching. Since self-stabilization is transient fault tolerant, we ...

## Fighting epidemics with the maximum spectral subgraph

Summary: Recent developments in mathematical epidemiology have identified a relationship between the time to extinction of an epidemic spreading over a network and the spectral radius of the underlying graph i.e. the largest eigenvalue of its adjacency matrix. At the same time, new generation networking technologies such as NFV ...

## Bijections for tree-decorated maps and applications to random maps

We introduce a new family of maps, namely tree-decorated maps where the tree is not necessarily spanning. To study this class of maps, we define a bijection which allows us to deduce combinatorial results, recovering as a corollary some results about spanning-tree decorated maps, and to understand local limits. Finally ...

Translations: fr