相关论文: Somewhat stochastic matrices
We describe a random matrix approach that can provide generic and readily soluble mean-field descriptions of the phase diagram for a variety of systems ranging from QCD to high-T_c materials. Instead of working from specific models, phase…
In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…
The paper deals with the convergence properties of the products of random (row-)stochastic matrices. The limiting behavior of such products is studied from a dynamical system point of view. In particular, by appropriately defining a dynamic…
We study a general mass transport model on an arbitrary graph consisting of $L$ nodes each carrying a continuous mass. The graph also has a set of directed links between pairs of nodes through which a stochastic portion of mass, chosen from…
We compute spectra of large stochastic matrices $W$, defined on sparse random graphs, where edges $(i,j)$ of the graph are given positive random weights $W_{ij}>0$ in such a fashion that column sums are normalized to one. We compute spectra…
We study random products of matrices in SL_2(C) from the point of view of holomorphic dynamics. For non-elementary measures with finite first moment we obtain the exponential convergence towards the stationary measure in Sobolev norm. As a…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…
Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…
We tackle the problem of conditioning probabilistic programs on distributions of observable variables. Probabilistic programs are usually conditioned on samples from the joint data distribution, which we refer to as deterministic…
We describe several algorithms for matrix completion and matrix approximation when only some of its entries are known. The approximation constraint can be any whose approximated solution is known for the full matrix. For low rank…
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…
In this paper we give a simple, short, and self-contained proof for a non-trivial upper bound on the probability that a random $\pm 1$ symmetric matrix is singular.
Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…
In a paper that appeared in 2010, C. Tone proved a multivariate central limit theorem for some strictly stationary random fields of random vectors satisfying certain mixing conditions. The "normalization" of a given "partial sum" (or "block…
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…
A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb N$ is finitely colored, there must be some $\vec{x}$ with entries from $\mathbb N$ such that all entries of $A\vec{x}$ are in some color class. In…
We obtain an explicit analytical sufficient condition on $E$ that ensures the monotonicity of the matrix $M+E$, where $M$ is an $M$-matrix.
A finite or infinite matrix $A$ is image partition regular provided that whenever $\mathbb N$ is finitely colored, there must be some $\vec{x}$ with entries from $\mathbb N$ such that all entries of $A\vec{x}$ are in some color class. In…
An interval matrix is a matrix whose entries are intervals in the set of real numbers. We generalize this concept, which has been broadly studied, to other fields. Precisely we define a rational interval matrix to be a matrix whose entries…