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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, December 08, 2011, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Ueli Peter

The Degree Sequence of Hyperbolic Random Graphs

Recently, Papadopoulos et al. introduced the following random graph model: Distribute $n$ points uniformly at random on the hyperbolic disc of radius $R$ and connect two points if and only if their hyperbolic distance is at most $R$.
We discuss why this might be a reasonable model for large real world graphs (i.e. the web graph, social networks and biological networks) by studying four different graph properties. We then present our analysis of the degree sequence of hyperbolic random graphs. This is joint work with Luca Gugelmann and Konstantinos Panagiotou.

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

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