An approximate blow-up lemma for sparse pseudorandom graphs.
Peter AllenJulia BöttcherHiêp HànYoshiharu KohayakawaYury PersonPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- pseudorandom
- random number
- uniformly distributed
- gaussian graphical models
- secret key
- random numbers
- directed acyclic
- stream cipher
- sparse data
- graph theoretic
- high dimensional
- sparse representation
- graph structures
- graph representation
- complex structures
- graph theory
- directed graph
- sparse matrix
- database systems
- johnson lindenstrauss
- graph mining
- weighted graph
- graph structure
- graph matching
- multi dimensional
- data analysis
- data structure