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, May 17, 2018, 12:15 pm

Duration: 30 minutes

Location: CAB G51

Speaker: Tobias Friedrich (Hasso Plattner Institute)

The Intrinsic Geometry of Scale-Free Networks

The node degrees of large real-world networks often follow a power-law distribution. Such scale-free networks can be social networks, internet topologies or many other networks. There is, however, no established and simple network model,which also has a high clustering of vertices as typically observed in real data. This talk will present several mathematical models of scale-free networks and introduce hyperbolic random graphs as a natural model that fulfils most properties of real world networks.


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