2011/01/31 by Marianna Bolla, Bolla, Marianna
Computer Science · Mathematics · #Error Correcting Code Techniques #Graph theory and applications #Quantum Computing Algorithms and Architecture #math.CO #stat.AP
paper · pdf · doi:10.48550/arxiv.1101.5926
Replacement is because of revised argument in Section 3 and adding new Section 4
arxiv created 2011/03/03 · arxiv updated 2011/03/04
Expander graphs are widely used in communication problems and construction of error correcting codes. In such graphs, information gets through very quickly. Typically, it is not true for social or biological networks, though we may find a partition of the vertices such that the induced subgraphs on them and the bipartite subgraphs between any pair of them exhibit regular behavior of information flow within or between the subsets. Implications between spectral and regularity properties are discussed.