![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Maximilien Dreveton
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j1]Konstantin Avrachenkov
, Maximilien Dreveton
, Lasse Leskelä
:
Recovering Static and Time-Varying Communities Using Persistent Edges. IEEE Trans. Netw. Sci. Eng. 11(2): 2087-2099 (2024) - [c4]Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser, Patrick Thiran:
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models. COLT 2024: 1451-1485 - [i7]Maximilien Dreveton, Alperen Gözeten, Matthias Grossglauser, Patrick Thiran:
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models. CoRR abs/2402.15432 (2024) - [i6]Maximilien Dreveton, Charbel Chucri, Matthias Grossglauser, Patrick Thiran:
Why the Metric Backbone Preserves Community Structure. CoRR abs/2406.03852 (2024) - 2023
- [c3]Maximilien Dreveton, Felipe S. Fernandes, Daniel R. Figueiredo:
Exact recovery and Bregman hard clustering of node-attributed Stochastic Block Model. NeurIPS 2023 - [i5]Maximilien Dreveton, Daichi Kuroda, Matthias Grossglauser, Patrick Thiran:
When Does Bottom-up Beat Top-down in Hierarchical Community Detection? CoRR abs/2306.00833 (2023) - [i4]Maximilien Dreveton, Felipe S. Fernandes, Daniel R. Figueiredo:
Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Model. CoRR abs/2310.19854 (2023) - 2022
- [b1]Maximilien Dreveton:
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). Côte d'Azur University, France, 2022 - 2021
- [c2]Konstantin Avrachenkov
, Maximilien Dreveton
, Lasse Leskelä:
Recovering Communities in Temporal Networks Using Persistent Edges. CSoNet 2021: 243-254 - 2020
- [i3]Konstantin Avrachenkov, Maximilien Dreveton:
Almost exact recovery in noisy semi-supervised learning. CoRR abs/2007.14717 (2020) - [i2]Konstantin Avrachenkov, Maximilien Dreveton, Lasse Leskelä:
Estimation of Static Community Memberships from Temporal Network Data. CoRR abs/2008.04790 (2020) - [i1]Konstantin Avrachenkov, Andrei Bobu, Maximilien Dreveton:
Higher-Order Spectral Clustering for Geometric Graphs. CoRR abs/2009.11353 (2020)
2010 – 2019
- 2019
- [c1]Konstantin Avrachenkov
, Maximilien Dreveton
:
Almost Exact Recovery in Label Spreading. WAW 2019: 30-43
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-07 00:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint