This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over specific domains in the complex space. In its real case analog, such studies were conducted in Sturm and Zhang [11]. In this paper it is shown that stronger results can be obtained for the complex Hermitian case. In part...

We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world, and random networks follow universal Gaussian orthogonal ensemble statistics of random matrix theory. Second, we show an analogy between the onset of small-world behavior, quantified by the s...

We study complex networks under random matrix theory (RMT) framework. Using nearest-neighbor and next-nearest-neighbor spacing distributions we analyze the eigenvalues of the adjacency matrix of various model networks, namely, random, scale-free, and small-world networks. These distributions follow the Gaussian orthogonal ensemble statistic of RMT. To probe long-range correlations in the eigenv...

— This work proposes a novel method of matrix factorization on the complex domain to obtain both intuitive features and high recognition results in a face recognition system. The real data matrix is transformed into a complex number based on the Euler representation of complex numbers. Base complex matrix factorization (CMF) is developed and two extensions including sparse complex matrix factor...

For a restricted class of potentials (harmonic+Gaussian potentials), we express the resolvent integral for the correlation functions of simple traces of powers of complex matrices of size N , in term of a determinant; this determinant is function of four kernels constructed from the orthogonal polynomials corresponding to the potential and from their Cauchy transform. The correlation functions ...

let $rin textbf{c}^{mtimes m}$ and $sin textbf{c}^{ntimes n}$ be nontrivial involution matrices; i.e., $r=r^{-1}neq pm~i$ and $s=s^{-1}neq pm~i$. an $mtimes n$ complex matrix $a$ is said to be an $(r, s)$-symmetric ($(r, s)$-skew symmetric) matrix if $ras =a$ ($ ras =-a$). the $(r, s)$-symmetric and $(r, s)$-skew symmetric matrices have a number of special properties and widely used in engi...

We present in this paper some fundamental tools for developing matrix analysis over the complex quaternion algebra. As applications, we consider generalized inverses, eigenvalues and eigenvectors, similarity, determinants of complex quaternion matrices, and so on. AMS Mathematics Subject Classification: 15A06; 15A24; 15A33

Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previous works, we introduced Matrix Graph Grammars (MGGs) as a purely algebraic approach for the study of graph grammars and graph dynamics, based on the representation of graphs by means of their adjacency matrices. MGGs ...

We describe an iterative scheme which allows us to calculate any multi-loop corre-lator for the complex matrix model to any genus using only the first in the chain of loop equations. The method works for a completely general potential and the results contain no explicit reference to the couplings. The genus g contribution to the m–loop correlator depends on a finite number of parameters, namely...

In this paper, it has been shown that the complex matrix variate Dirichlet type I density factors into the complex matrix variate beta type I densities. Similar result has also been derived for the complex matrix variate Dirichlet type II density. Also, by using certain matrix transformations, the complex matrix variate Dirichlet distributions have been generated from the complex matrix beta di...