Aurélien Decelle

Aurélien Decelle

Auto-generated profile, based on publicly available information

Aurélien Decelle

Complutense University of Madrid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 December 2011 in Physical Review E
Verified
Journal Article
Closed access
PDF file
ADAurelien Decelle
Aurelien Decelle
FKFlorent Krzakala
Florent Krzakala
CMCristopher Moore
Cristopher Moore
LZLenka Zdeborová
Lenka Zdeborová
In this paper we extend our previous work on the stochastic block model, a commonly used generative model for social and biological networks, and the problem of inferring functional groups or communities from the topology of the network. We use the cavity method of statistical physics to obtain an asymptotically exact analysis of the phase diagram. We describe in detail properties of the detectability-undetectability phase transition and the easy-hard phase transition for the community detection problem. Our analysis translates naturally into a belief propagation algorithm for inferring the group memberships of the nodes in an optimal way, i.e., that maximizes the overlap with the underlying group memberships, and learning the underlying parameters of the block model. Finally, we apply the algorithm to two examples of real-world networks and discuss its performance.

2 August 2011 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
ADAurelien Decelle
Aurelien Decelle
FKFlorent Krzakala
Florent Krzakala
CMCristopher Moore
Cristopher Moore
LZLenka Zdeborová
Lenka Zdeborová
We present an asymptotically exact analysis of the problem of detecting communities in sparse random networks generated by stochastic block models. Using the cavity method of statistical physics and its relationship to belief propagation, we unveil a phase transition from a regime where we can infer the correct group assignments of the nodes to one where these groups are undetectable. Our approach yields an optimal inference algorithm for detecting modules, including both assortative and disassortative functional modules, assessing their significance, and learning the parameters of the underlying block model. Our algorithm is scalable and applicable to real-world networks, as long as they are well described by the block model.

4 February 2021 in PLOS Genetics
Verified
Journal Article
Open access
PDF file
BYBurak Yelmen
Burak Yelmen
ADAurélien Decelle
Aurélien Decelle
LOLinda Ongaro
Linda Ongaro
DMDavide Marnetto
Davide Marnetto
CTCorentin Tallec
Corentin Tallec
FJFlora Jay
Flora Jay
Generative models have shown breakthroughs in a wide spectrum of domains due to recent advancements in machine learning algorithms and increased computational power. Despite these impressive achievements, the ability of generative models to create realistic synthetic data is still under-exploited in genetics and absent from population genetics. Yet a known limitation in the field is the reduced access to many genetic databases due to concerns about violations of individual privacy, although they would provide a rich resource for data mining and integration towards advancing genetic studies. In this study, we demonstrated that deep generative adversarial networks (GANs) and restricted Boltzmann machines (RBMs) can be trained to learn the complex distributions of real genomic datasets and generate novel high-quality artificial genomes (AGs) with none to little privacy loss. We show that our generated AGs replicate characteristics of the source dataset such as allele frequencies, linkage disequilibrium, pairwise haplotype distances and population structure. Moreover, they can also inherit complex features such as signals of selection. To illustrate the promising outcomes of our method, we showed that imputation quality for low frequency alleles can be improved by data augmentation to reference panels with AGs and that the RBM latent space provides a relevant encoding of the data, hence allowing further exploration of the reference dataset and features for solving supervised tasks. Generative models and AGs have the potential to become valuable assets in genetic studies by providing a rich yet compact representation of existing genomes and high-quality, easy-access and anonymous alternatives for private databases.

20 February 2014 in Physical Review Letters
Verified
Journal Article
Closed access
ADAurélien Decelle
Aurélien Decelle
FRFederico Ricci-Tersenghi
Federico Ricci-Tersenghi
In this Letter we propose a new method to infer the topology of the interaction network in pairwise models with Ising variables. By using the pseudolikelihood method (PLM) at high temperature, it is generally possible to distinguish between zero and nonzero couplings because a clear gap separate the two groups. However at lower temperatures the PLM is much less effective and the result depends on subjective choices, such as the value of the ${$\ell${}}_{1}$ regularizer and that of the threshold to separate nonzero couplings from null ones. We introduce a decimation procedure based on the PLM that recursively sets to zero the less significant couplings, until the variation of the pseudolikelihood signals that relevant couplings are being removed. The new method is fully automated and does not require any subjective choice by the user. Numerical tests have been performed on a wide class of Ising models, having different topologies (from random graphs to finite dimensional lattices) and different couplings (both diluted ferromagnets in a field and spin glasses). These numerical results show that the new algorithm performs better than standard PLM.

4 July 2018 in Journal of Statistical Physics
Verified
Journal Article
Closed access
PDF file
ADA. Decelle
A. Decelle
GFG. Fissore
G. Fissore
CFC. Furtlehner
C. Furtlehner

1 September 2017 in Europhysics Letters
Verified
Journal Article
Closed access
ADA. Decelle
A. Decelle
GFG. Fissore
G. Fissore
CFC. Furtlehner
C. Furtlehner