Working Group Network Theory
| Date/Time | Talk details |
|---|---|
|
20/01/2021 11:00 am - 12:00 pm |
Lorenzo Maggi - A tutorial on Bayesian optimization with Gaussian processes |
|
06/01/2021 11:00 am - 12:00 pm |
François Durand - Multi-winner voting rules |
|
09/12/2020 11:00 am - 12:00 pm |
Théo Delemazure - Voting in Networks |
|
25/11/2020 11:00 am - 12:00 pm |
Michel Davydov - An introduction to mean field theory |
|
04/11/2020 10:45 am - 12:15 pm |
Pierre Popineau - Fluid limits : a useful tool to study the stability of queuing networks |
|
07/10/2020 11:00 am - 12:00 pm |
François Durand - Zap Stochastic Approximation and Reinforcement Learning
Paris-Rennes Room (EIT Digital), 75013 Paris |
|
09/09/2020 11:00 am - 12:00 pm |
Ludovic Noirie - Quantum Internet |
|
15/07/2020 11:00 am - 12:00 pm |
François Baccelli - Contact process on point processes, part II |
|
24/06/2020 11:00 am - 12:00 pm |
François Baccelli - Contact process on point processes, part I |
|
10/06/2020 11:00 am - 12:00 pm |
Fabien Mathieu - A Mathematical Theory of Communication: Discrete Noiseless Systems |
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.