Follow
Lorenzo Dall'Amico
Lorenzo Dall'Amico
ISI Foundation
Verified email at isi.it - Homepage
Title
Cited by
Cited by
Year
Revisiting the Bethe-Hessian: improved community detection in sparse heterogeneous graphs
L Dall'Amico, R Couillet, N Tremblay
Advances in Neural Information Processing Systems, 4039-4049, 2019
272019
Optimal laplacian regularization for sparse spectral community detection
L Dall’Amico, R Couillet, N Tremblay
ICASSP 2020-2020 IEEE International Conference on Acoustics, Speech and …, 2020
132020
How does latent liquidity get revealed in the limit order book?
L Dall’Amico, A Fosset, JP Bouchaud, M Benzaquen
Journal of Statistical Mechanics: Theory and Experiment 2019 (1), 013404, 2019
122019
A unified framework for spectral clustering in sparse graphs
L Dall’Amico, R Couillet, N Tremblay
Journal of Machine Learning Research 22 (217), 1-56, 2021
112021
Community detection in sparse time-evolving graphs with a dynamical Bethe-Hessian
L Dall'Amico, R Couillet, N Tremblay
Advances in Neural Information Processing Systems, 2020
82020
Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs
L Dall'Amico, R Couillet, N Tremblay
IOP Publishing 2021 (9), 093405, 2021
62021
Community Detection in Sparse Realistic Graphs: Improving the Bethe Hessian
L Dall’Amico, R Couillet
ICASSP 2019-2019 IEEE International Conference on Acoustics, Speech and …, 2019
62019
Classification spectrale par la laplacienne déformée dans des graphes réalistes
L Dall'Amico, R Couillet, N Tremblay
XXVIIème colloque GRETSI (GRETSI 2019), 2019
22019
Estimating household contact matrices structure from easily collectable metadata
L Dall'Amico, J Kleynhans, L Gauvin, M Tizzoni, M Makhasi, N Wolter, ...
arXiv preprint arXiv:2210.07034, 2022
2022
Spectral methods for graph clustering
L Dall'Amico
Université Grenoble Alpes [2020-....], 2021
2021
A mechanism for the latent liquidity revealing into the limit order book
L Dall'Amico
Politecnico di Torino, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–11