Pseudorandom Sets in Grassmann Graph have Near-Perfect Expansion.
Subhash KhotDor MinzerMuli SafraPublished in: Electron. Colloquium Comput. Complex. (2018)
Keyphrases
- pseudorandom
- uniformly distributed
- random number
- discriminant analysis
- random walk
- secret key
- graph representation
- directed graph
- random numbers
- graph structure
- data sets
- weighted graph
- directed acyclic graph
- graph partitioning
- graph theory
- structured data
- graph embedding
- graph theoretic
- connected components
- encryption algorithm
- data structure
- real time