Displaying 201 – 220 of 498

Showing per page

Line graphs: their maximum nullities and zero forcing numbers

Shaun Fallat, Abolghasem Soltani (2016)

Czechoslovak Mathematical Journal

The maximum nullity over a collection of matrices associated with a graph has been attracting the attention of numerous researchers for at least three decades. Along these lines various zero forcing parameters have been devised and utilized for bounding the maximum nullity. The maximum nullity and zero forcing number, and their positive counterparts, for general families of line graphs associated with graphs possessing a variety of specific properties are analysed. Building upon earlier work, where...

Linearization of Poisson actions and singular values of matrix products

Anton Alekseev, Eckhard Meinrenken, Chris Woodward (2001)

Annales de l’institut Fourier

We prove that the linearization functor from the category of Hamiltonian K -actions with group-valued moment maps in the sense of Lu, to the category of ordinary Hamiltonian K - actions, preserves products up to symplectic isomorphism. As an application, we give a new proof of the Thompson conjecture on singular values of matrix products and extend this result to the case of real matrices. We give a formula for the Liouville volume of these spaces and obtain from it a hyperbolic version of the Duflo...

Localization and delocalization for heavy tailed band matrices

Florent Benaych-Georges, Sandrine Péché (2014)

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

We consider some random band matrices with band-width N μ whose entries are independent random variables with distribution tail in x - α . We consider the largest eigenvalues and the associated eigenvectors and prove the following phase transition. On the one hand, when α l t ; 2 ( 1 + μ - 1 ) , the largest eigenvalues have order N ( 1 + μ ) / α , are asymptotically distributed as a Poisson process and their associated eigenvectors are essentially carried by two coordinates (this phenomenon has already been remarked for full matrices by Soshnikov...

Localization of dominant eigenpairs and planted communities by means of Frobenius inner products

Dario Fasino, Francesco Tudisco (2016)

Czechoslovak Mathematical Journal

We propose a new localization result for the leading eigenvalue and eigenvector of a symmetric matrix A . The result exploits the Frobenius inner product between A and a given rank-one landmark matrix X . Different choices for X may be used, depending on the problem under investigation. In particular, we show that the choice where X is the all-ones matrix allows to estimate the signature of the leading eigenvector of A , generalizing previous results on Perron-Frobenius properties of matrices with...

Maps on matrices that preserve the spectral radius distance

Rajendra Bhatia, Peter Šemrl, A. Sourour (1999)

Studia Mathematica

Let ϕ be a surjective map on the space of n×n complex matrices such that r(ϕ(A)-ϕ(B))=r(A-B) for all A,B, where r(X) is the spectral radius of X. We show that ϕ must be a composition of five types of maps: translation, multiplication by a scalar of modulus one, complex conjugation, taking transpose and (simultaneous) similarity. In particular, ϕ is real linear up to a translation.

Matrix rank/inertia formulas for least-squares solutions with statistical applications

Yongge Tian, Bo Jiang (2016)

Special Matrices

Least-Squares Solution (LSS) of a linear matrix equation and Ordinary Least-Squares Estimator (OLSE) of unknown parameters in a general linear model are two standard algebraical methods in computational mathematics and regression analysis. Assume that a symmetric quadratic matrix-valued function Φ(Z) = Q − ZPZ0 is given, where Z is taken as the LSS of the linear matrix equation AZ = B. In this paper, we establish a group of formulas for calculating maximum and minimum ranks and inertias of Φ(Z)...

Maximizing Spectral Radii of Uniform Hypergraphs with Few Edges

Yi-Zheng Fan, Ying-Ying Tan, Xi-Xi Peng, An-Hong Liu (2016)

Discussiones Mathematicae Graph Theory

In this paper we investigate the hypergraphs whose spectral radii attain the maximum among all uniform hypergraphs with given number of edges. In particular we characterize the hypergraph(s) with maximum spectral radius over all unicyclic hypergraphs, linear or power unicyclic hypergraphs with given girth, linear or power bicyclic hypergraphs, respectively.

Currently displaying 201 – 220 of 498