Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, November 04, 2010, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Luca Gugelmann
Krioukov et al.[1] recently published a paper in which they consider a graph model with many interesting properties. In particular it has a power-law degree sequence, and its average degree, power-law exponent and clustering coefficient are all independently adjustable. In its simplest form it consists of N vertices uniformly distributed on a disk of radius R in a 2-dimensional hyperbolic space of curvature -1. Two vertices are joined by an edge if their hyperbolic distance is at most R. In this talk we present the basic model and its extensions.
[1] D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá, “Hyperbolic Geometry of Complex Networks,” Physical Review E, vol. 82, Jun. 2010.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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