Network Theory

Working Group Network Theory

Date/Time Talk details
30/06/2021
11:00 am - 12:00 pm
Maxime Mouchet - Algorithms for generating random permutations
09/06/2021
11:00 am - 12:00 pm
Pierre Popineau - Around the Poisson-Voronoi tessellation
19/05/2021
11:00 am - 12:00 pm
Michel Davydov - Existence of fixed points for the ./GI/1 queue
28/04/2021
11:00 am - 12:00 pm
Céline Comte - Exponential families
07/04/2021
11:00 am - 12:00 pm
Quentin Lutz and Élie de Panafieu - Design of algorithms for the production of training data
17/03/2021
11:00 am - 12:00 pm
Thomas Bonald - Ensemble methods
24/02/2021
11:00 am - 12:00 pm
Fabien Mathieu - A Mathematical Theory of Communication: Discrete Noisy Systems (2)
17/02/2021
11:00 am - 12:00 pm
Fabien Mathieu - A Mathematical Theory of Communication: Discrete Noisy Systems (1)
03/02/2021
11:00 am - 12:00 pm
Marc-Olivier Buob - Edit distances, string alignments and dynamic programming
20/01/2021
11:00 am - 12:00 pm
Lorenzo Maggi - A tutorial on Bayesian optimization with Gaussian processes
1 2 3 4 5 6 7 8 9 10

Presentation

Topic: Theory that can be used to study networks.

Audience: The reading group Network Theory is intended for researchers in mathematics and computer science interested in networks, but anyone can attend online.

Practical details: The sessions are held every third Wednesday from 10:30 am to 11:30 pm (Central European Summer Time), in the premises of the Lincs and online. To receive the invitations, register to the mailing list. Videos, slides and notebooks of previous sessions are on the website.

Coordinator: François Durand (fradurand@gmail.com).

Description:

In the reading group Network Theory, members present works from the scientific or technical literature to the other members. Our field of interest covers all theoretical aspects that can be used by researchers dealing with networks (graphs, telecommunication networks, social networks, power grids, etc). This includes general theoretical tools that are not specific to networks.

Here is a non-exhaustive list of topics: algorithmics, analysis, analytic combinatorics, game theory, graph theory, information theory, linear algebra, machine learning, natural language processing, networks architecture, probability theory, queueing theory, statistics, stochastic geometry, theoretical physics.

As a speaker:

  • You may present a paper, a set of papers, a book chapter, or prepare a short introduction course to a given topic.
  • You do not need to be a specialist of what you present.
  • Please do not present your own work.