Mittagsseminar (by J. Lengler, K. Bringmann, B. Gärtner, M. Hoffmann, R. Kyng, D.Steurer, V. Traub)

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

Duration: 30 minutes

Location: OAT S15

Speaker: Kostas Lakis

The Diameter of GIRGs

We show a logarithmic upper bound (tight up to constant factors) on the diameter of any component in the GIRG model, provided the distribution of degrees has infinite variance (the same regime where typical distances are doubly logarithmic). The proof is mainly based on some arguments from classical percolation theory. An interesting twist compared to previous similar works is that we replace the use of topology in arguments concerning the connectivity of boundaries of connected sets in graphs similar to Z^d. Instead of using topology, we use graph-theoretic concepts from a paper of Adam Timar ("Boundary-connectivity via graph theory", 2011) to establish the connectivity of the aforementioned sets. In the end of the talk I will present a puzzle about a random graph which is similar in spirit to G(n, p). Solving this puzzle would lead to a slight but interesting generalization of our results.

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

Previous talks by year:   2026  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