Statements (50)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Graph theory concept
|
| gptkbp:characterizedBy |
High edge connectivity
High vertex connectivity Large spectral gap |
| gptkbp:definedIn |
A sparse graph with strong connectivity properties
|
| gptkbp:field |
gptkb:Mathematics
Computer science |
| gptkbp:hasApplication |
gptkb:Markov_chains
Load balancing Quantum computing Coding theory Data storage Parallel computing Hash functions Random walks Social networks Spectral clustering Error detection Network reliability Error correction Internet topology Peer-to-peer networks Mathematical puzzles Network flow Communication networks Network synchronization Combinatorial constructions Complexity lower bounds Derandomization Graph partitioning Network robustness Pseudo-random generators |
| gptkbp:hasSubfield |
gptkb:Graph_theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Expander graph
|
| gptkbp:property |
Every subset of vertices has a large boundary
Rapid mixing of random walks Small diameter Sparse edges |
| gptkbp:relatedTo |
gptkb:Weyl_group
Ramanujan graph Spectral graph theory |
| gptkbp:studiedBy |
gptkb:Paul_Erdős
gptkb:Alfréd_Rényi |
| gptkbp:usedIn |
gptkb:Complexity_theory
gptkb:Error-correcting_codes Cryptography Network design Randomized algorithms |
| gptkbp:bfsParent |
gptkb:Random_regular_graph
|
| gptkbp:bfsLayer |
8
|