English
Related papers

Related papers: Asymptotic enumeration of sparse nonnegative integ…

200 papers

Let S=(s_1,s_2,..., s_m) and T = (t_1,t_2,..., t_n) be vectors of non-negative integers with sum_{i=1}^{m} s_i = sum_{j=1}^n t_j. Let B(S,T) be the number of m*n matrices over {0,1} with j-th row sum equal to s_j for 1 <= j <= m and k-th…

Combinatorics · Mathematics 2007-05-23 E. Rodney Canfield , Catherine Greenhill , Brendan D. McKay

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

Combinatorics · Mathematics 2009-06-12 E. Rodney Canfield , Brendan D. McKay

We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular…

Combinatorics · Mathematics 2013-01-22 Brendan D. McKay , Jeanette C. McLeod

We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…

Combinatorics · Mathematics 2010-04-06 Alexander Barvinok , J. A. Hartigan

We discuss the problem of counting {\em incidence matrices}, i.e. zero-one matrices with no zero rows or columns. Using different approaches we give three different proofs for the leading asymptotics for the number of matrices with $n$ ones…

Combinatorics · Mathematics 2009-11-11 Peter Cameron , Thomas Prellberg , Dudley Stark

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

Combinatorics · Mathematics 2008-08-21 Alexander Barvinok

The number of non-negative integer matrices with given row and column sums appears in a variety of problems in mathematics and statistics but no closed-form expression for it is known, so we rely on approximations of various kinds. Here we…

Computation · Statistics 2024-01-25 Maximilian Jerdee , Alec Kirkley , M. E. J. Newman

Let J and J* be subsets of Z+ such that 0,1\in J and 0\in J*. For infinitely many n, let k=(k_1,..., k_n) be a vector of nonnegative integers whose sum M is even. We find an asymptotic expression for the number of multigraphs on the vertex…

Combinatorics · Mathematics 2013-09-24 Catherine Greenhill , Brendan D McKay

We represent the number of mxn non-negative integer matrices (contingency tables) with prescribed row sums and column sums as the expected value of the permanent of a non-negative random matrix with exponentially distributed entries. We…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok

We define {\em incidence matrices} to be zero-one matrices with no zero rows or columns. A classification of incidence matrices is considered for which conditions of symmetry by transposition, having no repeated rows/columns, or…

Combinatorics · Mathematics 2007-05-23 Peter Cameron , Thomas Prellberg , Dudley Stark

Let $r \geq 2$ be a fixed integer. For infinitely many $n$, let $\boldsymbol{k} = (k_1,..., k_n)$ be a vector of nonnegative integers such that their sum $M$ is divisible by $r$. We present an asymptotic enumeration formula for simple…

Combinatorics · Mathematics 2015-07-13 Vladimir Blinovsky , Catherine Greenhill

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.…

Combinatorics · Mathematics 2012-03-12 Brendan D. McKay , Catherine Greenhill

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…

Combinatorics · Mathematics 2016-07-20 Vladimir Blinovsky , Catherine Greenhill

In this paper, we study the asymptotic nonnegative rank of matrices, which characterizes the asymptotic growth of the nonnegative rank of fixed nonnegative matrices under the Kronecker product. This quantity is important since it governs…

Information Theory · Computer Science 2024-01-30 Yeow Meng Chee , Quoc Tung Le , Hoang Ta

We count the number of alignments of $N \ge 1$ sequences when match-up types are from a specified set $S\subseteq \mathbb{N}^N$. Equivalently, we count the number of nonnegative integer matrices whose rows sum to a given fixed vector and…

Combinatorics · Mathematics 2016-07-26 Steffen Eger

We observe a $N\times M$ matrix $Y_{ij}=s_{ij}+\xi_{ij}$ with $\xi_{ij}\sim {\mathcal {N}}(0,1)$ i.i.d. in $i,j$, and $s_{ij}\in \mathbb {R}$. We test the null hypothesis $s_{ij}=0$ for all $i,j$ against the alternative that there exists…

Statistics Theory · Mathematics 2013-12-20 Cristina Butucea , Yuri I. Ingster

Let $C\geq 2$ be a positive integer. Consider the set of $n\times n$ non-negative integer matrices whose row sums and column sums are all equal to $Cn$ and let $X=(X_{ij})_{1\leq i,j\leq n}$ be uniformly distributed on this set. This $X$ is…

Probability · Mathematics 2023-01-18 Da Wu

Let $R$ and $S$ be two sequences of nonnegative integers in nonincreasing order and with the same sum, and let ${\cal A}(R,S)$ be the class of all $(0,1)$-matrices having row sum $R$ and column sum $S$. For a positive integer $t$, the…

Combinatorics · Mathematics 2019-04-26 Rosário Fernandes , Henrique F. da Cruz , Susana Palheira

Let $ A_n $ be an $n \times n$ random matrix with i.i.d Bernoulli($p$) entries. For a fixed positive integer $\beta$, suppose $p$ satisfies $$ \frac{ \log(n) }{ n } \le p \le c_\beta $$ where $c_\beta \in ( 0, 1/2 )$ is a…

Probability · Mathematics 2025-05-20 Han Huang

Let $\mathbf{A}_{n,m;k}$ be a random $n \times m$ matrix with entries from some field $\mathbb{F}$ where there are exactly $k$ non-zero entries in each column, whose locations are chosen independently and uniformly at random from the set of…

Combinatorics · Mathematics 2020-02-20 Colin Cooper , Alan Frieze , Wesley Pegden
‹ Prev 1 2 3 10 Next ›