Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 08, 2011, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Ueli Peter
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.
Automatic MiSe System Software Version 1.4803M | admin login