Raffinement de la borne spectrale d'un faisceau de matrices
Random matrices and permutations, matrix integrals and integrable systems
Random matrices, magic squares and matching polynomials.
Random matrices, non-colliding processes and queues
Random walk centrality and a partition of Kemeny's constant
We consider an accessibility index for the states of a discrete-time, ergodic, homogeneous Markov chain on a finite state space; this index is naturally associated with the random walk centrality introduced by Noh and Reiger (2004) for a random walk on a connected graph. We observe that the vector of accessibility indices provides a partition of Kemeny's constant for the Markov chain. We provide three characterizations of this accessibility index: one in terms of the first return time to the state...
Range symmetric matrices in Minkowski space.
Ranges of Sylvester maps and a minimal rank problem.
Rank and inertia of submatrices of the Moore-Penrose inverse of a Hermitian matrix.
Rank and perimeter preserver of rank-1 matrices over max algebra
For a rank-1 matrix over max algebra, we define the perimeter of A as the number of nonzero entries in both a and b. We characterize the linear operators which preserve the rank and perimeter of rank-1 matrices over max algebra. That is, a linear operator T preserves the rank and perimeter of rank-1 matrices if and only if it has the form T(A) = U ⊗ A ⊗ V, or with some monomial matrices U and V.
Rank decomposition in zero pattern matrix algebras
For a block upper triangular matrix, a necessary and sufficient condition has been given to let it be the sum of block upper rectangular matrices satisfying certain rank constraints; see H. Bart, A. P. M. Wagelmans (2000). The proof involves elements from integer programming and employs Farkas' lemma. The algebra of block upper triangular matrices can be viewed as a matrix algebra determined by a pattern of zeros. The present note is concerned with the question whether the decomposition result referred...
Rank of matrices and the Pexider equation.
Rank of tensors of -out-of- functions: An application in probabilistic inference
Bayesian networks are a popular model for reasoning under uncertainty. We study the problem of efficient probabilistic inference with these models when some of the conditional probability tables represent deterministic or noisy -out-of- functions. These tables appear naturally in real-world applications when we observe a state of a variable that depends on its parents via an addition or noisy addition relation. We provide a lower bound of the rank and an upper bound for the symmetric border rank...
Rank, trace and determinant in Banach algebras: generalized Frobenius and Sylvester theorems
As a follow-up to a paper of Aupetit and Mouton (1996), we consider the spectral definitions of rank, trace and determinant applied to elements in a general Banach algebra. We prove a generalization of Sylvester's Determinant Theorem to Banach algebras and thereafter a generalization of the Frobenius inequality.
Ranked solutions of the matric equation .
Rank-one LMI approach to robust stability of polynomial matrices
Necessary and sufficient conditions are formulated for checking robust stability of an uncertain polynomial matrix. Various stability regions and uncertainty models are handled in a unified way. The conditions, stemming from a general optimization methodology similar to the one used in -analysis, are expressed as a rank-one LMI, a non-convex problem frequently arising in robust control. Convex relaxations of the problem yield tractable sufficient LMI conditions for robust stability of uncertain...
Ranks and independence of solutions of the matrix equation .
Ranks of permutative matrices
A new type of matrix, termed permutative, is defined and motivated herein. The focus is upon identifying circumstances under which square permutative matrices are rank deficient. Two distinct ways, along with variants upon them are given. These are a special kind of grouping of rows and a type of partition in which the blocks are again permutative. Other, results are given, along with some questions and conjectures.
Rate of convergence to the semi-circle law for the Deformed Gaussian Unitary Ensemble
It is shown that the Kolmogorov distance between the expected spectral distribution function of an n × n matrix from the Deformed Gaussian Ensemble and the distribution function of the semi-circle law is of order O(n −2/3+v ).
Rational algebra and MM functions
MM functions, formed by finite composition of the operators min, max and translation, represent discrete-event systems involving disjunction, conjunction and delay. The paper shows how they may be formulated as homogeneous rational algebraic functions of degree one, over (max, +) algebra, and reviews the properties of such homogeneous functions, illustrated by some orbit-stability problems.
Rational orthogonal versus real orthogonal.