Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, November 06, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Stefanie Gerke (Royal Holloway University of London)

Successive minimal paths in complete graphs with random edge weights

It is known that in a complete graph with independent exponential edge weights the distance between two fixed vertices is asymptotically almost surely (a.a.s.) log n/n. We look at the cost X_k of kth minimal path between two fixed vertices, defined as the cheapest path in G after having deleted the previous k-1 minimal paths. We show that for k = o(n^{1/3}), X_k is a.a.s. 2k/n + \log n / n. We then indicate how this can be further improved. The talk is based on joint papers with P.~Balister, B.~Mezei and G.~Sorkin.

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

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