Lutz Warnke

 Lutz Warnke

Lutz Warnke

Master of Science ETH in Computer Science

  • DPhil Student

eMail: L.Warnke@dpmms.cam.ac.uk
Contact Form

Phone Number(s):

Reception/Secretary: +44 1865 273525
Direct: 01865 615173

Departmental Address:

Mathematical Institute
24-29 St Giles'
Oxford
OX1 3LB
England

Research Interests: 
My advisor is Oliver Riordan. My fields of interest include Random Graphs, Stochastic Processes, Probabilistic Methods, Asymptotic Enumeration and other related topics.
Prizes, Awards and Scholarships: 
  • Research Fellowship at Peterhouse, Cambridge (starting October 2012)
  • Merton College Graduate Prize Scholarship
  • Scatcherd European Scholarship
  • EPSRC Research Studentship
  • Willi-Studer-Award, ETH Zürich
  • ETH Zürich Excellence Scholarship
Major/Recent Publications: 
Teaching: 
Tutor at University of Oxford:
  • Probability A for St Edmund Hall (HT12)

Class tutor at University of Oxford:

  • Martingales through Measure Theory (MT11)
  • Probabilistic Combinatorics (HT11)
  • Probabilistic Combinatorics (HT10)

Teaching Assistant/Tutor at FU/TU Berlin: for (Pre-)Doc-Course on Probabilistic and Enumerative Combinatorics

  • Differential Equation Methods for Stochastic Processes (October 2010)

Teaching Assistant at University of Oxford:

  • Graph Theory (MT09)

Teaching Assistant/Tutor at ETH Zürich:

  • Discrete Mathematics (F08)
  • Randomized Algorithms and Probabilistic Methods (F07)
  • Discrete Mathematics (S07)
  • Theory of Computation (W06/07)

Further Details: 
Recent Talks:

  • The evolution of Achlioptas processes
    New Trends and Directions in Combinatorics workshop, BIRS (Banff), August 20, 2012
  • Explosive Percolation Is Continuous
    Theory Seminar, Microsoft Research, Redmond, July 13, 2012
  • The evolution of Achlioptas processes
    Two One-Day Colloquia in Combinatorics, Queen Mary, University of London, Mai 16, 2012
  • Convergence of Achlioptas processes via differential equations with unique solutions
    Workshop on Probabilistic techniques in Graph Theory, University of Birmingham, March 26, 2012
  • Explosive Percolation Is Continuous
    MDS Block Course Mini-Conference, FU Berlin, March 9, 2012
  • Explosive Percolation Is Continuous
    Combinatorics Seminar, University of Cambridge, March 1, 2012
  • Explosive Percolation Is Continuous
    Pure mathematics seminar, Royal Holloway, University of London, February 21, 2012
  • The early evolution of Achlioptas processes
    Combinatorics Seminar, University of Oxford, January 31, 2012
  • Explosive Percolation Is Continuous
    CABDyN Network Journal Club, University of Oxford, December 1, 2011
  • Explosive Percolation Is Continuous
    Combinatorics Seminar, University of Birmingham, November 17, 2011
  • Explosive Percolation Is Continuous
    Warwick-Weizmann 2011 Workshop, University of Warwick, September 15, 2011
  • Explosive Percolation
    Memphis-Budapest Summer School in Combinatorics, Budapest, August 15, 2011
  • Achlioptas process phase transitions are continuous
    15th International Conference on Random Structures and Algorithms, Atlanta, May 25, 2011
  • Achlioptas process phase transitions are continuous
    DIMAP Seminar, University of Warwick, May 17, 2011
  • Achlioptas process phase transitions are continuous
    Combinatorics Seminar, University of Oxford, May 10, 2011
  • Achlioptas process phase transitions are continuous
    Mittagsseminar, ETH Zürich, April 28, 2011
  • The C_\ell-free process
    Combinatorics Seminar, University of Oxford, February 8, 2011
  • When does the K_4-free process stop?
    MDS (Pre-)Doc-Course Mini-Conference, FU Berlin, October 15, 2010
  • When does the K_4-free process stop?
    Combinatorics Seminar, University of Memphis, October 8, 2010
  • The random greedy triangle-packing algorithm
    DIMAP Workshop on Extremal and Probabilistic Combinatorics, Petersfield, July 23, 2010
  • Dense subgraphs in the H-free process
    21st Postgraduate Combinatorics Conference, Queen Mary, University of London, July 7, 2010
  • On the Evolution of K_{\ell+1}-free Graphs
    Young Researchers in Mathematics 2010, University of Cambridge, March 27, 2010
  • A deletion method for local subgraph counts
    Mittagsseminar, ETH Zürich, December 17, 2009
  • On the Evolution of K_{\ell+1}-free Graphs
    Mittagsseminar, ETH Zürich, September 9, 2009

Conferences/Workshops/Summer Schools: