Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, November 12, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Ralph Keusch

Small-world phenomena on Geometric Inhomogeneous Random Graphs

Recently, with Geometric Inhomogeneous Random Graphs (GIRGs) we introduced a new model for the theoretical study of real-world networks. Typically, such networks exhibit so-called small-worlds: the average distance between two random vertices is very small, although the networks are sparse. In this talk, we show that GIRGs have good connectivity properties: we prove the existence of a giant component of linear size, polylogarithmic diameter and ultra-small average distance of order only log(log(n)) within the giant.
This is joint work with Karl Bringmann and Johannes Lengler. The talk is subsequent to Johannes' presentation on Tuesday where we have seen an overview of the model, the variants and the different results, but can be attended independently.

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

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