Charles Bordenave
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
Charles Bordenave has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Pietro Caputo
Università Roma Tre, Rome, Italy
3 shared publications - Alexandre Proutiere
Microsoft Research
2 shared publications - Alice Guionnet
CNRS Université de Toulouse CNRS ENS Lyon
2 shared publications - Djalil Chafaï
Université Paris-Dauphine
2 shared publications - Pierre Germain
New York University, New York, USA
2 shared publications - Thomas Trogdon
Courant Institute of Mathematical Sciences New York University 251 Mercer St. New York 10012 NY USA
2 shared publications
Latest Publications
- 5 August 2017
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 170 (3-4) , 933-960
Random walk on sparse random digraphs
- 5 August 2017
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 170 (3-4) , 933-960
Random walk on sparse random digraphs
- 23 May 2017
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 354 (1) , 115-159
Delocalization at Small Energy for Heavy-Tailed Random Matrices
- 23 May 2017
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 354 (1) , 115-159
Delocalization at Small Energy for Heavy-Tailed Random Matrices
- Open Access
Delocalization at small energy for heavy-tailed random matrices
We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured thanks to a simple criterion related to the inverse participation ratio which computes an average ratio of L4 and L2-norms of vectors. In contrast, as a consequence of a previous result, for random matrices with sufficiently heavy tails, the eigenvectors associated to large enough eigenvalues are localized according to the same criterion. The proof is based on a new analysis of the fixed point equation satisfied asymptotically by the law of a diagonal entry of the resolvent of this matrix.
Open AccessDelocalization at small energy for heavy-tailed random matrices
We prove that the eigenvectors associated to small enough eigenvalues of an heavy-tailed symmetric random matrix are delocalized with probability tending to one as the size of the matrix grows to infinity. The delocalization is measured thanks to a simple criterion related to the inverse participation ratio which computes an average ratio of L4 and L2-norms of vectors. In contrast, as a consequence of a previous result, for random matrices with sufficiently heavy tails, the eigenvectors associated to large enough eigenvalues are localized according to the same criterion. The proof is based on a new analysis of the fixed point equation satisfied asymptotically by the law of a diagonal entry of the resolvent of this matrix.
- Open Access
- 6 November 2015
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 48 (48) , 485205
An extension of the Derrida–Lebowitz–Speer–Spohn equation
We show how the derivation of the Derrida–Lebowitz–Speer–Spohn equation can be prolonged to obtain a new equation, generalizing the models obtained in the paper by these authors. We then investigate its properties from both an analytical and numerical perspective. Specifically, a numerical method is presented to approximate solutions of the prolonged equation. Using this method, we investigate the relationship between the solutions of the prolonged equation and the Tracy–Widom GOE distribution.
- 6 November 2015
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 48 (48) , 485205
Open AccessAn extension of the Derrida–Lebowitz–Speer–Spohn equation
We show how the derivation of the Derrida–Lebowitz–Speer–Spohn equation can be prolonged to obtain a new equation, generalizing the models obtained in the paper by these authors. We then investigate its properties from both an analytical and numerical perspective. Specifically, a numerical method is presented to approximate solutions of the prolonged equation. Using this method, we investigate the relationship between the solutions of the prolonged equation and the Tracy–Widom GOE distribution.
- Open Access
An extension of the Derrida-Lebowitz-Speer-Spohn equation
Derrida, Lebowitz, Speer and Spohn have proposed a simplified model to describe the low temperature Glauber dynamics of an anchored Toom interface. We show how the derivation of the Derrida-Lebowitz-Speer-Spohn equation can be prolonged to obtain a new equation, generalizing the models obtained in the paper by these authors. We then investigate its properties from both an analytical and numerical perspective. Specifically, a numerical method is presented to approximate solutions of the prolonged equation. Using this method, we investigate the relationship between the solutions of the prolonged equation and the Tracy--Widom GOE distribution.
Open AccessAn extension of the Derrida-Lebowitz-Speer-Spohn equation
Derrida, Lebowitz, Speer and Spohn have proposed a simplified model to describe the low temperature Glauber dynamics of an anchored Toom interface. We show how the derivation of the Derrida-Lebowitz-Speer-Spohn equation can be prolonged to obtain a new equation, generalizing the models obtained in the paper by these authors. We then investigate its properties from both an analytical and numerical perspective. Specifically, a numerical method is presented to approximate solutions of the prolonged equation. Using this method, we investigate the relationship between the solutions of the prolonged equation and the Tracy--Widom GOE distribution.
- 5 November 2014
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 163 (1-2) , 149-222
Large deviations of empirical neighborhood distribution in sparse random graphs
- 5 November 2014
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 163 (1-2) , 149-222
Large deviations of empirical neighborhood distribution in sparse random graphs
- Open Access
- 6 December 2013
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 67 (4) , 621-669
Spectrum of Markov Generators on Sparse Random Graphs
We investigate the spectrum of the infinitesimal generator of the continuoustime random walk on a randomly weighted oriented graph. This is the non‐Hermitian random n × n matrix L defined by Ljk = Xjk if k ≠ j and Ljj = – Σk ≠ j Ljk, where (Xjk)j ≠ k are i.i.d. random weights. Under mild assumptions on the law of the weights, we establish convergence as n → ∞ of the empirical spectral distribution of L after centering and rescaling. In particular, our assumptions include sparse random graphs such as the oriented Erdős‐Rényi graph where each edge is present independently with probability p(n) → 0 as long as np(n) ≫ (log(n))6. The limiting distribution is characterized as an additive Gaussian deformation of the standard circular law. In free probability terms, this coincides with the Brown measure of the free sum of the circular element and a normal operator with Gaussian spectral measure. The density of the limiting distribution is analyzed using a subordination formula. Furthermore, we study the convergence of the invariant measure of L to the uniform distribution and establish estimates on the extremal eigenvalues of L.
- 6 December 2013
- Published by Wiley in Communications on Pure and Applied Mathematics
- Vol. 67 (4) , 621-669
Open AccessSpectrum of Markov Generators on Sparse Random Graphs
We investigate the spectrum of the infinitesimal generator of the continuoustime random walk on a randomly weighted oriented graph. This is the non‐Hermitian random n × n matrix L defined by Ljk = Xjk if k ≠ j and Ljj = – Σk ≠ j Ljk, where (Xjk)j ≠ k are i.i.d. random weights. Under mild assumptions on the law of the weights, we establish convergence as n → ∞ of the empirical spectral distribution of L after centering and rescaling. In particular, our assumptions include sparse random graphs such as the oriented Erdős‐Rényi graph where each edge is present independently with probability p(n) → 0 as long as np(n) ≫ (log(n))6. The limiting distribution is characterized as an additive Gaussian deformation of the standard circular law. In free probability terms, this coincides with the Brown measure of the free sum of the circular element and a normal operator with Gaussian spectral measure. The density of the limiting distribution is analyzed using a subordination formula. Furthermore, we study the convergence of the invariant measure of L to the uniform distribution and establish estimates on the extremal eigenvalues of L.
- 16 January 2013
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 157 (3-4) , 885-953
Localization and delocalization of eigenvectors for heavy-tailed random matrices
- 16 January 2013
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 157 (3-4) , 885-953
Localization and delocalization of eigenvectors for heavy-tailed random matrices
- 4 September 2011
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 307 (2) , 513-560
Spectrum of Non-Hermitian Heavy Tailed Random Matrices
- 4 September 2011
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 307 (2) , 513-560
Spectrum of Non-Hermitian Heavy Tailed Random Matrices
- Open Access
- 1 January 2010
- Published by American Institute of Mathematical Sciences (AIMS) in Networks and Heterogeneous Media
- Vol. 5 (1) , 31-62
A particle system in interaction with a rapidly varying environment: Mean field limits and applications
We study an interacting particle system whose dynamics depends on an interacting random environment. As the number of particles grows large, the transition rate of the particles slows down (perhaps because they share a common resource of fixed capacity). The transition rate of a particle is determined by its state, by the empirical distribution of all the particles and by a rapidly varying environment. The transitions of the environment are determined by the empirical distribution of the particles. We prove the propagation of chaos on the path space of the particles and establish that the limiting trajectory of the empirical measure of the states of the particles satisfies a deterministic differential equation. This deterministic differential equation involves the time averages of the environment process. We apply the results on particle systems to understand the behavior of computer networks where users access a shared resource using a distributed random Medium Access Control (MAC) algorithm. MAC algorithms are used in all Local Area Network (LAN), and have been notoriously difficult to analyze. Our analysis allows us to provide simple and explicit expressions of the network performance under such algorithms.
- 1 January 2010
- Published by American Institute of Mathematical Sciences (AIMS) in Networks and Heterogeneous Media
- Vol. 5 (1) , 31-62
Open AccessA particle system in interaction with a rapidly varying environment: Mean field limits and applications
We study an interacting particle system whose dynamics depends on an interacting random environment. As the number of particles grows large, the transition rate of the particles slows down (perhaps because they share a common resource of fixed capacity). The transition rate of a particle is determined by its state, by the empirical distribution of all the particles and by a rapidly varying environment. The transitions of the environment are determined by the empirical distribution of the particles. We prove the propagation of chaos on the path space of the particles and establish that the limiting trajectory of the empirical measure of the states of the particles satisfies a deterministic differential equation. This deterministic differential equation involves the time averages of the environment process. We apply the results on particle systems to understand the behavior of computer networks where users access a shared resource using a distributed random Medium Access Control (MAC) algorithm. MAC algorithms are used in all Local Area Network (LAN), and have been notoriously difficult to analyze. Our analysis allows us to provide simple and explicit expressions of the network performance under such algorithms.