Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Date and Time: Thursday, October 30, 2025, 12:15 pm

Duration: 30 minutes

Location: OAT S15

Speaker: Felix Quernheim

α > τ−2 - The Final Frontier: These are the Lower Bounds for Distances in GIRGS

We investigate polylogarithmic lower bounds for graph distances in complex networks, specifically focusing on Scale Free Percolation (SFP) and Geometric Inhomogeneous Random Graphs (GIRGs). We present different strategies for reasoning about polylogarithmic lower bounds in these models. We also explain how one can transfer arguments from SFP to GIRGs. Finally, we address a known gap between reported bounds in the parameter regime α ∈ (1, 2) and τ > 3, specifically when α > τ−2. Although we cannot close this gap yet, we present ideas that we believe to be fruitful towards this goal.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2025  2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login