On the construction of sparse matrices from expander graphs
We revisit the asymptotic analysis of probabilistic construction of adjacency matrices of expander graphs proposed in Bah and Tanner [1]. With better bounds we derived a new reduced sample complexity for d, the number of non-zeros per column of these matrices (or equivalently the left-degree of the...
Main Authors: | , |
---|---|
Format: | Journal article |
Published: |
Frontiers Media
2018
|