Networks

Lectures 2014

2017

 2016

2015

2014

 

2014

 

  • Local CLT for some convolution equations and for weakly self-avoiding walks
    L. Avena. Invited speaker at the Material Modeling Seminar, Weierstrass Institut, Berlin, Germany, 22 January 2014.

  • On some random forests with determinantal roots
    L. Avena. invited speaker at “G´eanpyl : colloque de cloture”. University of Nantes, France, 3 July 2014
  • On some random forests with determinantal roots
    L. Avena. 37th Conference on Stochasitic Processes and their Applications, invited speaker in the invited session organized by Claudio Landim, Buenos Aires, Argentina, 28 July-1 August 2014.

  • On some random forests with determinantal roots
    L. Avena. Escola Braseleira de Probabilidade, Mambucaba, Brazil, 3-9 August 2014.

  • On some random forests with determinantal roots
    L. Avena. Invited speaker at the Workshop of the Leverhulme International Network Grant 'Laplacians, Random Walks, Bose Gas, Quantum Spin Systems'. University of Bristol, United Kindom,15-19 September 2014.

  • On some random forest with determinantal roots
    L. Avena. Invited speaker at the 'Mark Kac Seminar', Utrecht, 10 October 2014.

  • On some random forest with determinantal roots
    L. Avena. , Invited speaker at the 'Oberseminar Stochastics'. Bonn, Germany, 30 October 2014.'

  • A random walk driven by an exclusion process: hydrodynamic limits and path large deviations
    L. Avena. 11December 2014, TU Delft, The Netherlands

  • Key note lecture at 26th International Teletraffic Congress
    O.J. Boxma. Karlskrona, Sweden. 9-11 September 2014.
  • Extremal geometry of a Brownian porous medium
    F. den Hollander. Mathemtisches Kolloquium, Institut für Mathematische Statistik,

    Munster, Germany, 23 January 2014.

  • Random walk in dynamic random environment
    F. den Hollander. Workshop at University of Erlangen-Nurnberg, Germany, 27-28 February 2014.

  • Random Walk in Dynamic Random Environment
    F. den Hollander. Probabiltiy and statistics seminar. Technion, Haifa, Israel, 8 April 2014.

  • Annealed scaling for a charged polymer
    F. den Hollander. Meeting of ANR project Mememo2 at CIRM, Marseille, France, 2-6 June 2014.

  • Random Walk in Dynamic Random Environment
    F. den Hollander. Workshop at Bath University, United Kingdom, 23-27 June 2014.

  • 5 Lectures on Random Walk in Dynamic Random Environment
    F. den Hollander. Mini-course at summer school in Bedlewo, Poland, 6-10 October 2014.

  • Annealed Scaling for a Charged Polymer
    F. den Hollander. Workshop at Stellenbosch University. Stellenbosch, South Africa, 3-8 November 2014.

  • Breaking of Ensemble Equivalence in Complex Networks
    F. den Hollander. Workshop at Lorentz Center, Leiden, 17-21 November 2014.

  • A Near-Optimal Planarization Algorithm

    B.M.P. Jansen. 25th ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), 7 January 2014, Portland, Oregon, USA.
  • A Near-Optimal Planarization Algorithm

    B.M.P. Jansen. Dagstuhl Seminar 14071: Graph Modification Problems, 13 February 2014, Dagstuhl, Germany.
  • New developments in Circuit Complexity: From Circuit-SAT Algorithms to Circuit Lower Bounds

    B.M.P. Jansen. UiB Winter School on Algorithms, 20 March 2014, Finse, Norway.
  • Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes

    B.M.P. Jansen. Institute of Mathematical Sciences, 17 April 2014, Chennai, India.
  • Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes

    B.M.P. Jansen. University of Bergen Algorithm Colloquium, 9 May 2014, Bergen, Norway.
  • The Power of Preprocessing

    B.M.P. Jansen. Eindhoven University of Technology, 13 July 2014, Eindhoven, The Netherlands.
  • Parameterized Algorithms: The Basics

    B.M.P. Jansen. School on Parameterized Algorithms and Complexity, 18 August 2014, Będlewo, Poland.
  • Parameterized Algorithms: Randomized Algorithms

    B.M.P. Jansen. School on Parameterized Algorithms and Complexity, 18 August 2014, Będlewo, Poland
  • Parameterized Algorithms: Advanced Kernelization Techniques

    B.M.P. Jansen. School on Parameterized Algorithms and Complexity, 20 August 2014, Będlewo, Poland.
  • Turing Kernelization for Finding Long Paths and Cycles in Restricted Graph Classes

    B.M.P. Jansen. 22nd European Symposium on Algorithms (ESA 2014), 8 September 2014, Wrocław, Poland.
  • The Power of Preprocessing

    B.M.P. Jansen. Eindhoven University of Technology, 29 September 2014, Eindhoven, The Netherlands.
  • Characterizing the Easy-to-Find Subgraphs from the Viewpoint of Polynomial-Time Algorithms, Kernels, and Turing Kernels

    B.M.P. Jansen. Max Planck Institut für Informatik, 7 October 2014, Saarbrücken, Germany.
  • Pleased to meet you

    B.M.P. Jansen. Department Dialogue, Eindhoven University of Technology, 16 October 2014, Eindhoven, The Netherlands.
  • Parameterized Algorithmics

    B.M.P. Jansen. Networks Project Meeting, 17 October 2014, Amsterdam, The Netherlands.
  • Uniform Kernelization Complexity of Hitting Forbidden Minors

    B.M.P. Jansen. Dagstuhl Seminar 14451: Optimality and tight results in parameterized complexity, 5 November 2014, Dagstuhl, Germany
  • Convergence Rates for Hierarchical Gibbs Samplers
    O. Jovanovski. Probability seminar, University of Leiden, 9 October 2014.

  • Time Scaling results for Markov-modulated infinite-server systems and OU processes 
    M.R.H. Mandjes. Key Note, European Conference on Queueing Theory, Gent, Belgium.
  • Time scaling results for Markov-modulated infinite-server systems and OU processes
    M.R.H. Mandjes. Math. Seminar, IBM Yorktown Heights, USA.

  • Time scaling results for Markov-modulated infinite-server systems and OU processes
    M.R.H. Mandjes. University of Lausanne, Switzerland.

  • Optimized appointment scheduling
    M.R.H. Mandjes.Seminar Business Analytics, Vrije Universiteit Amsterdam.