相关论文: Asymptotics for incidence matrix classes

We consider high-dimensional estimation problems where the number of parameters diverges with the sample size. General conditions are established for consistency, uniqueness, and asymptotic normality in both unpenalized and penalized…

Sample correlation matrices are employed ubiquitously in statistics. However, quite surprisingly, little is known about their asymptotic spectral properties for high-dimensional data, particularly beyond the case of "null models" for which…

We consider unimodular matrices $M$ such that neither $M$ nor $M^{-1}$ contain zero entries. Matrices typically exhibit a trade-off: small $M$ imply large $M^{-1}$. We investigate rare cases where both remain small, classify these matrices…

In this paper we develop the following general approach. We study asymptotic behavior of the entropy numbers not for an individual smoothness class, how it is usually done, but for the collection of classes, which are defined by integral…

Lonesum matrices are matrices that are uniquely reconstructible from their row and column sum vectors. These matrices are enumerated by the poly-Bernoulli numbers that are related to the multiple zeta values and have a rich literature in…

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

We find an asymptotic enumeration formula for the number of simple $r$-uniform hypergraphs with a given degree sequence, when the number of edges is sufficiently large. The formula is given in terms of the solution of a system of equations.…

A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…

We completely classify the asymptotic behavior of the number of alternating sign matrices classically avoiding a single permutation pattern, in the sense of [Johansson and Linusson 2007]. In particular, we give a uniform proof of an…

The one-class classification problem is a well-known research endeavor in pattern recognition. The problem is also known under different names, such as outlier and novelty/anomaly detection. The core of the problem consists in modeling and…

Let d=(d_1,d_2,..., d_n) be a vector of non-negative integers. We study the number of symmetric 0-1 matrices whose row sum vector equals d. While previous work has focussed on the case of zero diagonal, we allow diagonal entries to equal 1.…

It has been an open problem to find the Moore-Penrose inverses of the incidence, Laplacian, and signless Laplacian matrices of families of graphs except trees and unicyclic graphs. Since the inverse formulas for an odd unicyclic graph and…

In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions are exact, we can identify the distributions of basic…

A novel method of asymptotic factorization of $n \times n$ matrix functions is proposed. Considered class of matrices is motivated by certain problems originated in the elasticity theory. An example is constructed to illustrate…

Analogously to the quantum case considered in Cruz-de-la-Rosa and Guerrero-Poblete (Open Syst. Inf. Dyn. 32, 2550005, 2025), this work proposes a graph-theoretic approach to studying non-equilibrium properties in Markov chains. We prove…

A real $n$-by-$n$ idempotent matrix $A$ with all entries having the same absolute value is called {\it absolutely flat}. We consider the possible ranks of such matrices and herein characterize the triples: size, constant, and rank for which…

We study asymptotic infinitesimal distributions of Gaussian Unitary Ensembles with permuted entries. We show that for random uniform permutations, the asymptotically permuted GUE matrix has a null infinitesimal distribution. Moreover, we…

Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…

We investigate the rank of random (symmetric) sparse matrices. Our main finding is that with high probability, any dependency that occurs in such a matrix is formed by a set of few rows that contains an overwhelming number of zeros. This…

Power nonnegative matrices are defined as complex matrices having at least one nonnegative integer power. We exploit the possibility of deriving a Perron Frobenius-like theory for these matrices, obtaining three main results and drawing…