Projet ANR GrHyDy - Kickoff meeting

Workshop on geometric random graph models and percolation

Kickoff meeting October 19-20 (online)


Zoom link:

Meeting ID: 931 056 889 80
Password: 405055






In complex networks, it has been empirically observed that many networks typically are scale-free and exhibit a non-vanishing clustering coefficient. Models of complex networks that naturally exhibits these properties are random graph models in the hyperbolic plane, such as the random hyperbolic graph model by Krioukov et al. and other variants. In this project we aim to analyze rigorously parameters related to the flow/exchange of information in random hyperbolic graphs, arguably one of the most important parameters of complex networks. Our goal is to contribute to establish the foundation for these random graph models; in particular we aim at analyzing percolation together with component sizes, broadcasting times of rumors, hitting times of random walks, and extinction times of the contact process. Our second objective is also to set up a dynamic graph model and to analyze the aforementioned parameters in the dynamic setup.


Schedule  (all times shown are CEST)

Tuesday, October 19

  • 9h00-9h30: Bruno Schapira (Univ. Aix-Marseille): Contact process on the hyperbolic random graph (Abstract) (Slides)
  • 9h30-10h00: Daniel Valesin (Univ. Groningen): Shape theorem for first-passage percolation on random geometric graphs (Abstract) (Slides)


  • 10h30-11h00: Julia Komjathy (TU Delft): 1-dependent first passage percolation (Abstract) (Slides)
  • 11h00-11h30: Zsolt Bartha (TU Eindhoven): Degree-penalized contact processes (Abstract)


  • 15h30-16h00: Joe Yukich (Lehigh Univ.): Isolated and extreme points in hyperbolic random geometric graphs (Abstract) (Slides)
  • 16h00-16h30: Josep Díaz (UPC Barcelona): Reconstruction in RGG: Breaking the Θ(r) error (Abstract) (Slides)


  • 17h00-17h30: Lyuben Lichev (ICJ, Univ. Lyon): The giant component after percolation of product graphs (Abstract) (Slides)
  • 17h30-18h00: Marcos Kiwi (U. Chile): Cover and Hitting Times of Hyperbolic Random Graphs (Abstract)
  • 18h00-18h30: Markus Schepers (Johannes-Gutenberg-Univ. Mainz): How to apply hyperbolic random graphs and their dynamics to the spreading of infectious diseases? (Abstract)

Wednesday, October 20

  • 9h00-9h30: Christian Hirsch (Univ. Groningen): Rare Events in Random Geometric Graphs (Abstract) (Slides)
  • 9h30-10h00: Tobias Müller (Univ. Groningen): Percolation on hyperbolic Poisson-Voronoi tessellations (Abstract)


  • 10h30-11h00: Bas Lodewijks (ICJ, Univ. Lyon): Large degrees in weighted recursive graphs with random bounded weights (Abstract) (Slides)
  • 11h00-11h30: Joost Jorritsma (TU Eindhoven). Graph-distance evolution in growing preferential attachment graphs (Abstract)


  • 15h30-16h00: Lucas Flammant (UPHF Valenciennes): TBA
  • 16h00-16h30: Arne Grauer (U. Köln): Chemical distance in geometric random graphs with long edges and scale-free degree distribution (Abstract)


  • 17h00-17h30: Lukas Lüchtrath (U. Köln): Percolation phase transition in weight-dependent random connection models (Abstract)
  • 17h30-18h00: John Fernley (ENS Lyon): The Contact Process on a Graph Adapting to Infection Density (Abstract)
  • 18h00-18h30: Daniel Willhalm (Univ. Groningen): Upper large deviations for power-weighted edge lengths in spatial random networks (Abstract)



  • Dieter Mitsche (dmitsche AT
  • Pascale Villet (pascale.villet AT