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: Tuesday, November 10, 2015, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Johannes Lengler

Geometric Inhomogeneous Random Graphs

I will present a new model for social and technological networks that we invented recently, so-called Geometric Inhomogeneous Random Graphs (GIRGs). The model generalize the (celebrated but complicated) model of hyperbolic random graphs, but our model is nevertheless much simpler. I will review the different variants of our model, and the different results that we could obtain (many of them are new even for the special case of hyperbolic random graphs).

I will not give any proof details in this talk. The subsequent MiSe talk by Ralph Keusch (on Thursday) will show the proof of some main results. Both talks can be attended independently.

All results are joint work with Karl Bringmann and Ralph Keusch.

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