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 A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, May 27, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Augusto Teixeira (D-MATH)

Random graphs left by a random walk

In this talk we consider a class of random graphs defined in terms of random walk trajectories. More precisely, consider a growing sequence of finite graphs G_n and a random walk running on each of them up to a specific given time. The set of sites not visited by the random walk (called the vacant set) is a random subgraph of G_n. In this talk we investigate the percolative properties of this random vacant set for some sequences G_n. This model undergoes a phase transition that resembles the one observed in Erdős-Rényi graphs and other percolative systems.

Joint work with J. Černý and D. Windisch.

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