Présentation Marion Aguirrebengoa CBI Centre de Biologie Intégrative Toulouse
Cours/Séminaire
This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both
This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both
This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both
This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence
This course is concerned with some of the canonical non-stochastic models of online decision making. These models have their origin in works from the 1950's and 1960's, and went through a resurgence
This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both
This course treats some contemporary algorithms from computational linear algebra that involve random matrices. Rather than surveying the entire field, we focus on a few algorithms that are both
Conférence
A fundamental question in statistics is: how well can we fulfil a given aim given the data that one possesses? Answering this question sheds light on the possibilities, but also on the fundamental
A key question of current interest is: How are properties of optimization and sampling algorithms influenced by the properties of the loss function in noisy high-dimensional non-convex settings?
In this talk we consider detection and reconstruction of planted structures in Erdős-Rényi random graphs. For planted line graphs, we establish the following phase diagram. In a low density region
This talk is devoted to clustering problems. It amounts to partitionning a set of given points or the nodes of a given graph, in such a way that the groups are as homogeneous as possible. After
Inhomogeneous random graph models encompass many network models such as stochastic block models and latent position models. We consider the problem of the statistical estimation of the matrix of
In this talk, we present a non-asymptotic bound on the L2 distance between the spectrum of the probability matrix of a random graph and the spectrum of the integral operator. Then, we study the random
In this talk we will define notions of dimension for unimodular random graphs and point-stationary point processes. These notions are in spirit similar to the Minkowski dimension and the
Stable matchings were introduced in a seminal paper by Gale and Shapley (1962) and play an important role in economics. Following closely Holroyd, Pemantle, Peres and Schramm (2009), we shall
Documentaire
Kezako, la série documentaire qui répond à vos questions de science, aborde cette fois-ci la question "Pourquoi la tartine tombe toujours du coté beurré ?". N'hesitez pas à réagir ou à oser
Kezako, la série documentaire qui répond à vos questions de sciences traite de la question : "Pourquoi faut-il diminuer la vitesse pour limiter les embouteillages ?". N'hesitez pas à réagir et à poser
Vidéo pédagogique
TAM : sem 9 test chi deux conformite
sem 9 test du chi deux
TAM: sem 2, calculs des paramètres video
TAM: sem 1 Les types de variables utilisées en statistiques
TAM: sem 2,calculs des paramètres avec excel et R video
TAM: sem 3, statistiques descriptives
TAM: sem 6 les étapes de réalisation des tests d'hypothèses
TAM: sem 4, lois de probabilités