spectra of large diluted but bushy random graphs
play

Spectra of large diluted but bushy random graphs Laurent M enard - PowerPoint PPT Presentation

Spectra of large diluted but bushy random graphs Laurent M enard Joint work with Nathana el Enriquez ModalX Universit e Paris Ouest Erd os-R enyi random graphs vertex set { 1 , . . . n } G ( n, p ) vertices linked by


  1. Spectra of large diluted but bushy random graphs Laurent M´ enard Joint work with Nathana¨ el Enriquez Modal’X Universit´ e Paris Ouest

  2. Erd˝ os-R´ enyi random graphs • vertex set { 1 , . . . n } G ( n, p ) • vertices linked by an edge independently with probability p

  3. Erd˝ os-R´ enyi random graphs • vertex set { 1 , . . . n } G ( n, p ) • vertices linked by an edge independently with probability p • symmetric Adjacency matrix A • if i � = j , P ( A i,j = 1) = 1 − P ( A i,j = 0) = p • for every i , A i,i = 0

  4. Erd˝ os-R´ enyi random graphs • vertex set { 1 , . . . n } G ( n, p ) • vertices linked by an edge independently with probability p • symmetric Adjacency matrix A • if i � = j , P ( A i,j = 1) = 1 − P ( A i,j = 0) = p • for every i , A i,i = 0 What does the spectrum of A look like ? • if np → 0 , single atom mass at 0 • if np → ∞ , semi circle law • if np → c > 0 , not much is known...

  5. Numerical simulations on diluted graphs with 5000 vertices c = 0 , 5

  6. Numerical simulations on diluted graphs with 5000 vertices c = 0 , 5 (zoomed in)

  7. Numerical simulations on diluted graphs with 5000 vertices c = 1

  8. Numerical simulations on diluted graphs with 5000 vertices c = 1 (zoomed in)

  9. Numerical simulations on diluted graphs with 5000 vertices c = 1 , 5

  10. Numerical simulations on diluted graphs with 5000 vertices c = 1 , 5 (zoomed in)

  11. Numerical simulations on diluted graphs with 5000 vertices c = 2

  12. Numerical simulations on diluted graphs with 5000 vertices c = 2 (zoomed in)

  13. Numerical simulations on diluted graphs with 5000 vertices c = 2 , 5

  14. Numerical simulations on diluted graphs with 5000 vertices c = 2 , 5 (zoomed in)

  15. Numerical simulations on diluted graphs with 5000 vertices c = 2 , 8

  16. Numerical simulations on diluted graphs with 5000 vertices c = 2 , 8 (zoomed in)

  17. Numerical simulations on diluted graphs with 5000 vertices c = 3

  18. Numerical simulations on diluted graphs with 5000 vertices c = 3 (zoomed in)

  19. Numerical simulations on diluted graphs with 5000 vertices c = 4

  20. Numerical simulations on diluted graphs with 5000 vertices c = 5

  21. Numerical simulations on diluted graphs with 5000 vertices c = 10

  22. Numerical simulations on diluted graphs with 5000 vertices c = 20

  23. ´ Etat de l’art n = 1 � µ c δ λ : empirical spectral distribution of G ( n, c/n ) n λ ∈ Sp( c − 1 / 2 A )

  24. ´ Etat de l’art n = 1 � µ c δ λ : empirical spectral distribution of G ( n, c/n ) n λ ∈ Sp( c − 1 / 2 A ) Fact : as n → ∞ , µ c n converges weakly to a probability measure µ c

  25. ´ Etat de l’art n = 1 � µ c δ λ : empirical spectral distribution of G ( n, c/n ) n λ ∈ Sp( c − 1 / 2 A ) Fact : as n → ∞ , µ c n converges weakly to a probability measure µ c Known properties of µ c : • if c → ∞ , µ c converges weakly to Wigner semi-circle law • unbounded support • dense set of atoms

  26. ´ Etat de l’art n = 1 � µ c δ λ : empirical spectral distribution of G ( n, c/n ) n λ ∈ Sp( c − 1 / 2 A ) Fact : as n → ∞ , µ c n converges weakly to a probability measure µ c Known properties of µ c : • if c → ∞ , µ c converges weakly to Wigner semi-circle law • unbounded support • dense set of atoms • µ c ( { 0 } ) known explicitly [Bordenave, Lelarge, Salez 2011]

  27. ´ Etat de l’art n = 1 � µ c δ λ : empirical spectral distribution of G ( n, c/n ) n λ ∈ Sp( c − 1 / 2 A ) Fact : as n → ∞ , µ c n converges weakly to a probability measure µ c Known properties of µ c : • if c → ∞ , µ c converges weakly to Wigner semi-circle law • unbounded support • dense set of atoms • µ c ( { 0 } ) known explicitly [Bordenave, Lelarge, Salez 2011] • µ c is not purely atomic iif c > 1 [Bordenave, Sen, Vir´ ag 2013]

  28. Asymptotic expansion of the spectrum

  29. Asymptotic expansion of the spectrum | x | k | dµ ( x ) | < ∞ , denote m k ( µ ) = x k dµ ( x ) � � If µ is a (signed) mesure and

  30. Asymptotic expansion of the spectrum | x | k | dµ ( x ) | < ∞ , denote m k ( µ ) = x k dµ ( x ) � � If µ is a (signed) mesure and Theorem: For every k ≥ 0 and as c → ∞ � 1 � m k ( µ c ) = m k ( σ ) + 1 c m k ( σ { 1 } ) + o c where σ is the semi-circle law having density 1 � 4 − x 2 1 | x | < 2 2 π and σ { 1 } is a measure with total mass 0 and density x 4 − 4 x 2 + 2 1 √ 1 | x | < 2 . 2 π 4 − x 2

  31. Asymptotic expansion of the spectrum – numerical simulations 100 matrices of size 10000 with c = 20 Histogram of µ c n Density of σ

  32. Asymptotic expansion of the spectrum – numerical simulations 100 matrices of size 10000 with c = 20 Histogram of c ( µ c n − σ ) Density of σ { 1 }

  33. Asymptotic expansion of the spectrum: second order (I) Proposition: For every k � 0 we have the following asymtotic expansion in c : � 1 � m k ( µ c ) = m k ( σ ) + 1 c m k ( σ { 1 } ) + 1 c 2 d k + o c 2 where the numbers d k are NOT the moments of a measure!

  34. Asymptotic expansion of the spectrum: second order (I) Proposition: For every k � 0 we have the following asymtotic expansion in c : � 1 � m k ( µ c ) = m k ( σ ) + 1 c m k ( σ { 1 } ) + 1 c 2 d k + o c 2 where the numbers d k are NOT the moments of a measure! The asymptotic expansion must take into account the fact that � 1 � µ c ( R \ [ − 2; 2]) = O . c 2

  35. Asymptotic expansion of the spectrum: second order (I) Proposition: For every k � 0 we have the following asymtotic expansion in c : � 1 � m k ( µ c ) = m k ( σ ) + 1 c m k ( σ { 1 } ) + 1 c 2 d k + o c 2 where the numbers d k are NOT the moments of a measure! The asymptotic expansion must take into account the fact that � 1 � µ c ( R \ [ − 2; 2]) = O . c 2 Dilation operator Λ α for measures defined by Λ α ( µ )( A ) = µ ( A/α ) for a measure µ and a Borel set A .

  36. Asymptotic expansion of the spectrum: second order (I) Proposition: For every k � 0 we have the following asymtotic expansion in c : � 1 � m k ( µ c ) = m k ( σ ) + 1 c m k ( σ { 1 } ) + 1 c 2 d k + o c 2 where the numbers d k are NOT the moments of a measure! The asymptotic expansion must take into account the fact that � 1 � µ c ( R \ [ − 2; 2]) = O . c 2 Dilation operator Λ α for measures defined by Λ α ( µ )( A ) = µ ( A/α ) for a measure µ and a Borel set A . For example, Λ α ( σ ) is supported on [ − 2 α ; 2 α ] .

  37. Asymptotic expansion of the spectrum: second order (II) Theorem: For every k ≥ 0 and as c → ∞ � 1 � � �� � σ + 1 σ { 1 } + 1 σ { 2 } m k ( µ c ) = m k Λ 1+ 1 c ˆ c 2 ˆ + o c 2 2 c σ { 1 } is a measure with null total mass and density where ˆ − x 4 − 5 x 2 + 4 √ 4 − x 2 1 | x | < 2 2 π σ { 2 } is a measure with null total mass and density and where ˆ − 2 x 8 − 17 x 6 + 46 x 4 − 325 8 x 2 + 21 4 √ 1 | x | < 2 . 4 − x 2 π

  38. Second order – numerical simulations 100 matrices of size 10000 with c = 20 σ { 1 } � � Density of Λ 1+ 1 ˆ 2 c � � µ c Histogram of c n − Λ 1+ 1 2 c ( σ )

  39. Second order – numerical simulations 100 matrices of size 10000 with c = 20 Histogram of c 2 � σ { 1 } �� σ + 1 σ { 2 } � µ c � � n − Λ 1+ 1 c ˆ Density of Λ 1+ 1 ˆ 2 c 2 c

  40. Edge of the Spectrum � 1 � � �� � σ + 1 σ { 1 } + 1 m k ( µ c ) = m k σ { 2 } Λ 1+ 1 c ˆ c 2 ˆ + o c 2 2 c The measure on the right hand side is supported on [ − 2 − 1 /c ; 2 + 1 /c ] .

  41. Edge of the Spectrum � 1 � � �� � σ + 1 σ { 1 } + 1 m k ( µ c ) = m k σ { 2 } Λ 1+ 1 c ˆ c 2 ˆ + o c 2 2 c The measure on the right hand side is supported on [ − 2 − 1 /c ; 2 + 1 /c ] . This suggests that for ε > 0 , as c → ∞ , � 1 �� � � �� � −∞ ; − 2 − 1 + ε 2 + 1 + ε µ c ∪ ; + ∞ = o . c 2 c c

  42. Edge of the Spectrum � 1 � � �� � σ + 1 σ { 1 } + 1 m k ( µ c ) = m k σ { 2 } Λ 1+ 1 c ˆ c 2 ˆ + o c 2 2 c The measure on the right hand side is supported on [ − 2 − 1 /c ; 2 + 1 /c ] . This suggests that for ε > 0 , as c → ∞ , � 1 �� � � �� � −∞ ; − 2 − 1 + ε 2 + 1 + ε µ c ∪ ; + ∞ = o . c 2 c c Thank you!

Recommend


More recommend