Displaying 341 – 360 of 498

Showing per page

On-line Ramsey theory.

Grytczuk, J.A., Hałuszczak, M., Kierstead, H.A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Orbit measures, random matrix theory and interlaced determinantal processes

Manon Defosseux (2010)

Annales de l'I.H.P. Probabilités et statistiques

A connection between representation of compact groups and some invariant ensembles of hermitian matrices is described. We focus on two types of invariant ensembles which extend the gaussian and the Laguerre Unitary ensembles. We study them using projections and convolutions of invariant probability measures on adjoint orbits of a compact Lie group. These measures are described by semiclassical approximation involving tensor and restriction multiplicities. We show that a large class of them are determinantal....

Partial sum of eigenvalues of random graphs

Israel Rocha (2020)

Applications of Mathematics

Let G be a graph on n vertices and let λ 1 λ 2 ... λ n be the eigenvalues of its adjacency matrix. For random graphs we investigate the sum of eigenvalues s k = i = 1 k λ i , for 1 k n , and show that a typical graph has s k ( e ( G ) + k 2 ) / ( 0 . 99 n ) 1 / 2 , where e ( G ) is the number of edges of G . We also show bounds for the sum of eigenvalues within a given range in terms of the number of edges. The approach for the proofs was first used in Rocha (2020) to bound the partial sum of eigenvalues of the Laplacian matrix.

Patterns with several multiple eigenvalues

J. Dorsey, C.R. Johnson, Z. Wei (2014)

Special Matrices

Identified are certain special periodic diagonal matrices that have a predictable number of paired eigenvalues. Since certain symmetric Toeplitz matrices are special cases, those that have several multiple 5 eigenvalues are also investigated further. This work generalizes earlier work on response matrices from circularly symmetric models.

Pentadiagonal Companion Matrices

Brydon Eastman, Kevin N. Vander Meulen (2016)

Special Matrices

The class of sparse companion matrices was recently characterized in terms of unit Hessenberg matrices. We determine which sparse companion matrices have the lowest bandwidth, that is, we characterize which sparse companion matrices are permutationally similar to a pentadiagonal matrix and describe how to find the permutation involved. In the process, we determine which of the Fiedler companion matrices are permutationally similar to a pentadiagonal matrix. We also describe how to find a Fiedler...

Perron-Frobenius and Krein-Rutman theorems for tangentially positive operators

Adam Kanigowski, Wojciech Kryszewski (2012)

Open Mathematics

We study several aspects of a generalized Perron-Frobenius and Krein-Rutman theorems concerning spectral properties of a (possibly unbounded) linear operator on a cone in a Banach space. The operator is subject to the so-called tangency or weak range assumptions implying the resolvent invariance of the cone. The further assumptions rely on relations between the spectral and essential spectral bounds of the operator. In general we do not assume that the cone induces the Banach lattice structure into...

Poisson convergence for the largest eigenvalues of heavy tailed random matrices

Antonio Auffinger, Gérard Ben Arous, Sandrine Péché (2009)

Annales de l'I.H.P. Probabilités et statistiques

We study the statistics of the largest eigenvalues of real symmetric and sample covariance matrices when the entries are heavy tailed. Extending the result obtained by Soshnikov in (Electron. Commun. Probab.9 (2004) 82–91), we prove that, in the absence of the fourth moment, the asymptotic behavior of the top eigenvalues is determined by the behavior of the largest entries of the matrix.

Currently displaying 341 – 360 of 498