A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
Various parameters have been discovered which give a measurement of the "randomness" of a graph. We consider two such parameters for directed graphs: the singular values of the (normalized) adjacency matrix and discrepancy (a measurement of how randomly edges have been placed). We will show that these two are equivalent by bounding one by the other so that if one is small then both are small. We will also give a related result for discrepancy of walks when the indegree and out-degree at eachdoi:10.1145/1109557.1109680 fatcat:lldxcc7zsnaq5dz2kttnxhd34u