Maximilien Dreveton

Orcid: 0000-0001-6613-0615

According to our database1, Maximilien Dreveton authored at least 13 papers between 2019 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Recovering Small Communities in the Planted Partition Model.
CoRR, April, 2025

Reducing Sensor Requirements by Relaxing the Network Metric Dimension.
Proc. ACM Meas. Anal. Comput. Syst., 2025

2024
Recovering Static and Time-Varying Communities Using Persistent Edges.
IEEE Trans. Netw. Sci. Eng., 2024

Why the Metric Backbone Preserves Community Structure.
Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models.
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024

2023
When Does Bottom-up Beat Top-down in Hierarchical Community Detection?
CoRR, 2023

Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Graph clustering and semi-supervised learning of non-binary, temporal and geometric networks. (Détection de communautés et apprentissage semi-supervisé dans des réseaux non-binaires, temporels et géométriques).
PhD thesis, 2022

2021
Recovering Communities in Temporal Networks Using Persistent Edges.
Proceedings of the Computational Data and Social Networks - 10th International Conference, 2021

2020
Higher-Order Spectral Clustering for Geometric Graphs.
CoRR, 2020

Estimation of Static Community Memberships from Temporal Network Data.
CoRR, 2020

Almost exact recovery in noisy semi-supervised learning.
CoRR, 2020

2019
Almost Exact Recovery in Label Spreading.
Proceedings of the Algorithms and Models for the Web Graph - 16th International Workshop, 2019


  Loading...