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: Tuesday, July 11, 2023, 12:15 pm

Duration: 30 minutes

Location: OAT X 11

Speaker: Rouzbeh Hasheminezhad

The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks

Scale-free networks, beyond their hallmark skewed degree distribution, are commonly described by their robust-yet-fragile nature. This prevailing characterization suggests that scale-free networks are more robust against random failures, yet more vulnerable to targeted attacks, when compared with random graphs of the same size. In this seminar talk, we will challenge this traditional portrayal, presenting both experimental and theoretical results that offer a fresh understanding of the robustness of scale-free networks.

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