Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Theory of Combinatorial Algorithms
Prof. Emo Welzl and Prof. Bernd Gärtner
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, May 06, 2025, 12:15 pm
Duration: 30 minutes
Location: OAT S15
Speaker: Zylan Benjert (TU Delft)
One-dependent first passage percolation is a spreading process on a graph, where the transmission time through each edge depends on the direct surroundings of the edge. In particular, the transmission time between vertices is dependent on their degrees and spatial distance. As penalization increases the transmission time sweeps through four different phases: explosive, quasi-exponential, polynomial, and linear. To reproduce the theoretical results on real world networks we investigate the behavior of the 1-FFP process on the Gowalla dataset and compare it to empirical findings on synthetically generated GIRGs. (Joint work with J. Komjáthy, J. Lapinskas, J. Lengler, and U. Schaller)
Upcoming talks | All previous talks | Talks by speaker | 
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2026 2025 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
