Université Gustave Eiffel
Probabilités et statistiques
I am an Assistant Professor (Maître de Conférences) in Statistics at Université Gustave-Eiffel, and a member of LAMA (Laboratoire d’analyse et de mathématiques appliquées).
Classic network clustering tackles the problem of identifying sets of nodes (communities) that have similar connection patterns. However, in many scenarios nodes also have attributes that are correlated and can also be used to identify node clusters. Thus, network information (edges) and node information (attributes) can be jointly leveraged to design high-performance clustering…
This article studies the estimation of latent community memberships from pairwise interactions in a network of N nodes, where the observed interactions can be of arbitrary type, including binary, categorical, and vector-valued, and not excluding even more general objects such as time series or spatial point patterns. As a generative model for such…
The ebook edition of this title is Open Access and freely available to read online. This book is a general introduction to the statistical analysis of networks, and can serve both as a research monograph and as a textbook. Numerous fundamental tools and concepts needed for the analysis of networks are presented, such…
The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering. It resembles in concept the classical spectral clustering method but uses for partitioning the eigenvector associated with a higher-order eigenvalue. We…
In semi-supervised graph clustering setting, an expert provides cluster membership of few nodes. This little amount of information allows one to achieve high accuracy clustering using efficient computational procedures. Our main goal is to provide a theoretical justification why the graph-based semi-supervised learning works very well. Specifically, for the Stochastic Block Model in…
Ce livre sur l’oral de l’agrégation externe de mathématiques comporte des plans complets de 76 leçons d’algèbre et d’analyse. Sont principalement concernés les candidats à l’agrégation externe, mais ceux du concours interne ou du Capes pourront aussi y trouver des passages utiles. Les plans sont rédigés avec la rigueur attendue par le jury,…