Justin Salez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Justin Salez has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Charles Bordenave
Department of Electrical Engineering and Computer Science CNRS Université de Toulouse Institut de Mathématiques de Toulouse University of California Berkeley
1 shared publication - Marc Lelarge
DI/ENS INRIA PSL Research University Paris France
1 shared publication
Latest Publications
- 19 June 2015
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 25 (3) , 436-447
The Interpolation Method for Random Graphs with Prescribed Degrees
We consider large random graphs with prescribed degrees, as generated by the configuration model. In the regime where the empirical degree distribution approaches a limit μ with finite mean, we establish the systematic convergence of a broad class of graph parameters that includes the independence number, the maximum cut size, the logarithm of the Tutte polynomial, and the free energy of the anti-ferromagnetic Ising and Potts models. Contrary to previous works, our results are not a priori limited to the free energy of some prescribed graphical model. They apply more generally to any additive, Lipschitz and concave graph parameter. In addition, the corresponding limits are shown to be Lipschitz and concave in the degree distribution μ. This considerably extends the applicability of the celebrated interpolation method, introduced in the context of spin glasses, and recently related to the challenging question of right-convergence of sparse graphs.
- 19 June 2015
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 25 (3) , 436-447
The Interpolation Method for Random Graphs with Prescribed Degrees
We consider large random graphs with prescribed degrees, as generated by the configuration model. In the regime where the empirical degree distribution approaches a limit μ with finite mean, we establish the systematic convergence of a broad class of graph parameters that includes the independence number, the maximum cut size, the logarithm of the Tutte polynomial, and the free energy of the anti-ferromagnetic Ising and Potts models. Contrary to previous works, our results are not a priori limited to the free energy of some prescribed graphical model. They apply more generally to any additive, Lipschitz and concave graph parameter. In addition, the corresponding limits are shown to be Lipschitz and concave in the degree distribution μ. This considerably extends the applicability of the celebrated interpolation method, introduced in the context of spin glasses, and recently related to the challenging question of right-convergence of sparse graphs.
- 1 September 2013
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 50 (3) , 861-870
Joint Distribution of Distances in Large Random Regular Networks
We study the array of point-to-point distances in random regular graphs equipped with exponential edge lengths. We consider the regime where the degree is kept fixed while the number of vertices tends to ∞. The marginal distribution of an individual entry is now well understood, thanks to the work of Bhamidi, van der Hofstad and Hooghiemstra (2010). The purpose of this note is to show that the whole array, suitably recentered, converges in the weak sense to an explicit infinite random array. Our proof consists in analyzing the invasion of the network by several mutually exclusive flows emanating from different sources and propagating simultaneously along the edges.
- 1 September 2013
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 50 (3) , 861-870
Joint Distribution of Distances in Large Random Regular Networks
We study the array of point-to-point distances in random regular graphs equipped with exponential edge lengths. We consider the regime where the degree is kept fixed while the number of vertices tends to ∞. The marginal distribution of an individual entry is now well understood, thanks to the work of Bhamidi, van der Hofstad and Hooghiemstra (2010). The purpose of this note is to show that the whole array, suitably recentered, converges in the weak sense to an explicit infinite random array. Our proof consists in analyzing the invasion of the network by several mutually exclusive flows emanating from different sources and propagating simultaneously along the edges.
- 30 September 2012
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 157 (1-2) , 183-208
Matchings on infinite graphs
- 30 September 2012
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 157 (1-2) , 183-208
Matchings on infinite graphs