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, January 13, 2004, 12:15 pm

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

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

**Speaker**: Dieter Mitsche

The Hidden Cluster Problem on a random graph is defined as follows: given a graph randomly drawn from a distribution G(n,k,p,q) - a graph on n vertices with k clusters, where p denotes the probability of an edge between two vertices within the same cluster, q denotes the probability of an edge between two vertices in different clusters, p > q - the problem is to find the ('hidden') clusters planted in this graph via this distribution.

In this talk, I will sketch Frank McSherry's approach of solving this problem - in his paper "Spectral Partitioning of Random Graphs' he puts two vertices into the same cluster, if the norm of the difference between the columns in the projection matrix corresponding to these vertices is small.

Frank McSherry, Spectral Partitioning of Random Graphs, Proceedings of 42nd IEEE Symosium on Foundations of Computer Science (FOCS) 201, p. 529-537.

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

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