Date - Heure / Date - Hour
Date(s) - 12/11/2020
10h30 - 11h30
Graph Mining by Vertex Dismantlings
When considering the topology of complex networks, an important question is how local topological constraints impact the overall topology of the network. This issue is addressed from a mathematical perspective by examining some particular families of graphs. For these graphs, the results of an exploration of the vertices in an order determined by the properties of their neighbourhood may lead to the conclusion that global properties exist. We review classic results and some more recent generalizations that use simplicial geometry. These families of graphs can be used as models for the construction of large networks whose topology can be controlled by local actions.
La présentation se fera en français.