Logo CIMPA

Extremal graph theory

Tomas Vetrik

Summary: 

Extremal problems in graph theory related to distances in graphs, diameter of a graph, vertex degrees, vertex-transitive graphs and Cayley graphs will be studied in the lectures. The lecturer will introduce those concepts, and present theorems and proofs of some theorems. The theory will be illustrated by a lot of examples. The lecturer will also include research topics with applications in computer science, such as the degree-diameter problem, in his lectures. 
 

Sat. 03 Jun, 2023 → Sun. 11 Jun, 2023

Multilevel optimization : from theory to applications in energy management

Didier Aussel

Summary: 

The aim of this course is fourfold, namely :

1. to introduce multi-leader-follower games
2. to explore the recent theoretical advances
3. to present some of the numerous applications of these optimization model
4. to present, in the case of Single-Leader-Follower games (SLMFG), the very recently  tested SOS1-numerical  scheme  to  determine,  numerically,  some solutions of these difficult problems.
 

Wed. 03 May, 2023 → Tue. 16 May, 2023

Modélisation en Epidémiologie

Patrick Tchepmo Djomegni

Summary: De ce cours, nous espĂ©rons que les Ă©tudiants auront des outils minimums pour modĂ©liser la propagation des maladies Ă©pidĂ©miques, et Ă©tudier des stratĂ©gies de contrĂŽle. Les Ă©tudiants acquerront de connaissances nouvelles qui les prĂ©pareront pour leurs travaux thĂšse (mĂ©moire). L’universitĂ© en bĂ©nĂ©ficiera aussi Ă  travers le renforcement des capacitĂ©s de ses futurs enseignants. 
 

Mon. 17 Apr, 2023 → Fri. 28 Apr, 2023

Mesures Aléatoires de Poisson

Etienne Pardoux

Summary: On prĂ©sente les mesures alĂ©atoires de Poisson, et comment celles-ci permettent de construire les processus de LĂ©vy, mais aussi les Ă©quations diffĂ©rentielles stochastiques Ă  sauts, ainsi que les processus de branchement Ă  espace d’état continu

Mon. 06 Feb, 2023 → Sat. 11 Feb, 2023

Automaticity

Didier Jean CAUCAL

Summary: In this automaticity course we will teach the recognition of infinite words by automata. We will study the complexity of these infinite words and the non-algebraicity of the irrational numbers they represent. We will discuss its extension via battery-powered automata.

Sat. 28 Jan, 2023 → Tue. 14 Feb, 2023

Branching Processes and their Applications

Ibrahima Drame

Summary: Galton Watson process :

                       - without immigration

                       - with immigration

                       - multitype (with a finite number of types)

Continuous time branching process :

    - with exponential lifetime distributions, i.e markovian branching process

Sun. 29 Jan, 2023 → Sat. 04 Feb, 2023

Mathematical Modeling of infectious diseases

Patrick Tchepmo Djomegni

Summary: In this course, students will be introduced to the mathematical modeling of infectious diseases. Basic knowledge on certain diseases (tuberculosis, HIV/AIDS, hepatitis, malaria
) will be provided. Only deterministic mathematical models will be studied. Since the models are expressed in the form of ordinary differential equations, most of them cannot be solved explicitly. The qualitative characteristics of the solutions will be studied.
 

Sun. 08 Jan, 2023 → Sun. 15 Jan, 2023

Lattices and codes : arithmetic for communication systems

Frédérique Oggier

Summary: In this course, we taught show how lattices and codes, both independently and jointly, are used in the context of communication systems. The course was structured as follows : 

  • Introduction to lattices and geometry of numbers
  • Introduction to linear codes and lattices from codes
  • Introduction to number fields and lattices from number fields
  • Introduction to quaternion algebras and codes from quaternion algebras
  • Practical aspects : channel modeling
Mon. 10 Mar, 2025 → Sat. 15 Mar, 2025