相关论文: Asymptotics for incidence matrix classes

We investigate the sparsity of null vectors of real symmetric matrices whose off-diagonal pattern of zero and nonzero entries is described by the adjacencies of a graph. We use the definition of the spark of a matrix, the smallest number of…

We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…

We study identification and inference in nonlinear dynamic systems defined on unknown interaction networks. The system evolves through an unobserved dependence matrix governing cross-sectional shock propagation via a nonlinear operator. We…

We study numerically and analytically the spectrum of incidence matrices of random labeled graphs on N vertices : any pair of vertices is connected by an edge with probability p. We give two algorithms to compute the moments of the…

We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…

A natural definition of the product of infinite matrices mimics the usual formulation of multiplication of finite matrices with the caveat (in the absence of any sense of convergence) that the intersection of the support of each row of the…

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of…

It is well known that any positive matrix can be scaled to have prescribed row and column sums by multiplying its rows and columns by certain positive scaling factors (which are unique up to a positive scalar). This procedure is known as…

A combinatorial rectangle may be viewed as a matrix whose entries are all +-1. The discrepancy of an m by n matrix is the maximum among the absolute values of its m row sums and n column sums. In this paper, we investigate combinatorial…

We consider a new class of matrices associated to a real square matrix $A$ and to a vector $\vec{c} \in \{-1,1\}^n$ such that $c_1=1$ by using a map $\varphi_{\vec{c}}$ which turns out to be a conjugation of a matrix $A$ by a signature…

A "simple trace formula" is used to derive an asymptotic result for class numbers of complex cubic orders.

We give a simpler proof of an earlier result giving an asymptotic estimate for the number of integral matrices, in large balls, with a given monic integral irreducible polynomial as their common characteristic polynomial. The proof uses…

We identify a relationship between a certain family of random walks on Euclidean lattices and difference matrices over cyclic groups. We then use the techniques of Fourier analysis to estimate the return probabilities of these random walks,…

The action of any lossless multilayer is described by a transfer matrix that can be factorized in terms of three basic matrices. We introduce a simple trace criterion that classifies multilayers in three classes with properties closely…

In this paper we give an asymptotic formula for a matrix integral which plays a crucial role in the approach of Diaconis et al. to random matrix eigenvalues. The choice of parameter for the asymptotic analysis is motivated by an invariant…

We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…

A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.

We characterize asymptotic collective behaviour of rectangular random matrices, the sizes of which tend to infinity at different rates: when embedded in a space of larger square matrices, independent rectangular random matrices are…

Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…

A set $A$ of nonnegative integers is an asymptotic basis of order $h$ if every sufficiently large integer can be represented as the sum of $h$ not necessarily distinct elements of $A$. The asymptotic basis $A$ is minimal if removing any…