Related papers: Some properties of substochastic matrices

We study properties of Cartesian products of digital images, using a variety of adjacencies that have appeared in the literature.

We study the eigenvalue problem for some special class of anti-triangular matrices. Though the eigenvalue problem is quite classical, as far as we know, almost nothing is known about properties of eigenvalues for anti-triangular matrices.…

We consider the problem of writing an arbitrary symmetric matrix as the difference of two positive semidefinite matrices. We start with simple ideas such as eigenvalue decomposition. Then, we develop a simple adaptation of the Cholesky that…

We characterize the identified sets of a wide range of stochastic choice models, including random utility, various models of boundedly-rational behavior, and dynamic discrete choice. In each of these settings, we show two distributions over…

In this paper we derive tail bounds on the norms of random submatrices with non-uniformly distributed supports. We apply these results to sparse approximation and conduct an analysis of the average case performance of thresholding,…

This note provides a counterexample to a proposition stated in [J. Differ. Equ. 261.4 (2016) 2528--2551] regarding the neighborhood of certain $4\times 4$ symplectic matrices.

We consider stochastic equations for the class of formal mappings. Existence and uniqueness of solution, as well as evolution property are proved.

Over an arbitrary field of positive characteristic we construct an example of a locally finite variety of Lie algebras which does not have a finite basis of its polynomial identities. As a consequence we construct varieties of Lie algebras…

We exploit the hidden symmetry structure of a recently proposed non-Hermitian Hamiltonian and of its Hermitian equivalent one. This sheds new light on the pseudo-Hermitian character of the former and allows access to a generalized quantum…

In this note we discover and prove some interesting and important relations among sub-matrices of Sylvester matrices and triangular toeplitz matrices. The main result is Hill's identity discovered by R. D. Hill which has an important…

We propose a generalization of the random matrix theory following the basic prescription of the recently suggested concept of superstatistics. Spectral characteristics of systems with mixed regular-chaotic dynamics are expressed as weighted…

We give a new characterization of tilted algebras by the existence of certain special subquivers in their Auslander-Reiten quiver. This result includes the existent characterizations of this kind and yields a way to obtain more tilted…

We analyze statistical properties of the complex system with conditions which manifests through specific constraints on the column/row sum of the matrix elements. The presence of additional constraints besides symmetry leads to new…

This note presents a summary and review of various conditions and characterizations for matrix stability (in particular diagonal matrix stability) and matrix stabilizability.

I present here some results on the statistical behaviour of large random matrices in an ensemble where the probability distribution is not a function of the eigenvalues only. The perturbative expansion can be cast in a closed form and the…

We address the construction of stable random matrix ensembles as the generalization of the stable random variables (Levy distributions). With a simple method we derive the Cauchy case, which is known to have remarkable properties. These…

We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite…

In this work, we analyze the variance of a stochastic estimator for computing Schatten norms of matrices. The estimator extracts information from a single sketch of the matrix, that is, the product of the matrix with a few standard Gaussian…

In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.

An ensemble of random unistochastic (orthostochastic) matrices is defined by taking squared moduli of elements of random unitary (orthogonal) matrices distributed according to the Haar measure on U(N) (or O(N), respectively). An ensemble of…