Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd GÃ¤rtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, March 23, 2004, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Zsolt Katona (Eötvös Lorand University, Budapest)

Consider the random graph model of Barabási and Albert, where we add a new vertex in every step and connect it to some old vertices with probabilities proportional to their degrees. If we connect it to only one of the old vertices this will be a tree. These graphs have been shown to have a power law degree distribution, the same as observed in some large real-world networks.

We are interested in the width of the tree and show that it is W(n) ~ n/sqrt(Pi log n) and this also holds for a slight generalization of the model with another constant. Then we see how this theoretical result can be applied to directory trees.

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