On the rank of a random binary matrix
On the rank of a random binary matrix
复制标题
关于随机二元矩阵的秩
DOI:
10.1137/1.9781611975482.58
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Pegden, Wesley
中科院分区:
文献类型:
--
作者:
Cooper, Colin;Frieze, Alan;Pegden, Wesley
We study the rank of a randomn×mmatrixAn, m; kwith entries fromGF(2), and exactlykunit entries in each column, the other entries being zero. The columns are chosen independently and uniformly at random from the set of all (nk) such columns.We obtain an asymptotically correct estimate for the rank as a function of the number of columnsmin terms ofc, n, k, and wherem=cn/k.The matrixAn, m; kforms the vertex-edge incidence matrix of ak-uniform random hypergraphH. The rank ofAn, m; kcan be expressed as follows. Let |C2| be the number of vertices of the 2-core ofH, and |E(C2)| the number of edges. Letm*be the value ofmfor which |C2| = |E(C2)|. Then w.h.p. form<m* the rank ofAn, m; kis asymptotic to m, and form≥m* the rank is asymptotic tom– |E(C2)| + |C2|.In addition, assign i.i.d.U[0, 1] weightsXi,i∊ 1, 2, …mto the columns, and define the weight of a set of columnsSasX(S) = ∑j∊SXj. Define a basis as a set ofn– 1 (keven) linearly independent columns. We obtain an asymptotically correct estimate for the minimum weight basis. This generalises the well-known result of Frieze [On the value of a random minimum spanning tree problem, Discrete Applied Mathematics, (1985)] that, fork= 2, the expected length of a minimum weight spanning tree tends to ζ(3) ∼ 1.202.
登录
查看更多内容
DOI:
10.1017/s0963548315000097
发表时间:
2012
期刊:
Combinatorics, Probability and Computing
影响因子:
--
作者:
B. Pittel;G. Sorkin
通讯作者:
G. Sorkin
影响因子:
0.8
作者:
Jason M. Altschuler;E. Yang
通讯作者:
E. Yang
DOI:
--
发表时间:
1984
期刊:
影响因子:
--
作者:
D. G. Kelly;J. Oxley
通讯作者:
J. Oxley
影响因子:
1.1
作者:
L. Lowrance;J. Oxley;C. Semple;D. Welsh
通讯作者:
D. Welsh
DOI:
--
发表时间:
2019
期刊:
Random structures algorithms
影响因子:
--
作者:
Cooper, C.;Frieze, A.;Pegden, W.
通讯作者:
Pegden, W.