Beyond the expanders

From MaRDI portal
Publication:666522

DOI10.1155/2011/787596zbMATH Open1236.05122arXiv1101.5926OpenAlexW2166772092WikidataQ58655897 ScholiaQ58655897MaRDI QIDQ666522FDOQ666522


Authors: Marianna Bolla Edit this on Wikidata


Publication date: 8 March 2012

Published in: International Journal of Combinatorics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1101.5926




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Beyond the expanders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666522)