Entangled networks, synchronization and optimal network topology Export

@misc{citeulike:325803, abstract = {A new family of graphs, Entangled Networks, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for generic dynamical processes. These networks are shown to have an extremely homogeneous structure: degree, node-distance, betweenness, and loop distributions are all very narrow. They are characterized as well by a very interwoven (entangled) structure with short average distances, large loops, and no well-defined community-structure (poor modularity). More importantly, we show that this family of nets exhibits an excellent performance with respect to other connectivity or flow properties such as robustness against errors and attacks, minimal first-passage time of random walks, good searchability, efficient communication, etc. These remarkable features convert entangled networks in a powerful and useful concept, optimal or almost-optimal in many senses, and with plenty of potential applications in network design, computer science, or neuroscience.}, archivePrefix = {arXiv}, author = {Donetti, L. and Hurtado, P. I. and Munoz, M. A.}, citeulike-article-id = {325803}, citeulike-linkout-0 = {http://arxiv.org/abs/cond-mat/0502230}, citeulike-linkout-1 = {http://arxiv.org/pdf/cond-mat/0502230}, day = {15}, eprint = {cond-mat/0502230}, keywords = {networks, sync, topology}, month = {Sep}, posted-at = {2005-09-19 00:09:22}, priority = {0}, title = {Entangled networks, synchronization and optimal network topology}, url = {http://arxiv.org/abs/cond-mat/0502230}, year = {2005} }

TY - ELEC ID - citeulike:325803 L3 - citeulike-article-id:325803 N2 - A new family of graphs, Entangled Networks, with optimal properties in many respects, is introduced. By definition, their topology is such that optimizes synchronizability for generic dynamical processes. These networks are shown to have an extremely homogeneous structure: degree, node-distance, betweenness, and loop distributions are all very narrow. They are characterized as well by a very interwoven (entangled) structure with short average distances, large loops, and no well-defined community-structure (poor modularity). More importantly, we show that this family of nets exhibits an excellent performance with respect to other connectivity or flow properties such as robustness against errors and attacks, minimal first-passage time of random walks, good searchability, efficient communication, etc. These remarkable features convert entangled networks in a powerful and useful concept, optimal or almost-optimal in many senses, and with plenty of potential applications in network design, computer science, or neuroscience. TI - Entangled networks, synchronization and optimal network topology KW - networks KW - sync KW - topology AU - Donetti, L AU - Hurtado, PI AU - Munoz, MA PY - 2005/Sep/15/ UR - http://arxiv.org/abs/cond-mat/0502230 ER -