Deterministic small-world communication networks

DOI10.1016/S0020-0190(00)00118-6zbMath1338.68012WikidataQ57772722 ScholiaQ57772722MaRDI QIDQ294854

Javier Ozón, Joseph G. Peters, Francesc Comellas

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000001186?np=y

zbMATH Keywords

communication networksinterconnection networkssmall-world networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

HYPERCHAOTIC SYNCHRONIZATION IN DETERMINISTIC SMALL-WORLD DYNAMICAL NETWORKS ⋮ A new small-world network created by cellular automata ⋮ ANALYSES OF SOME STRUCTURAL PROPERTIES ON A CLASS OF HIERARCHICAL SCALE-FREE NETWORKS ⋮ Medium worlds theories. I. ⋮ Robustness of network coherence in asymmetric unicyclic graphs ⋮ NETWORK COHERENCE ANALYSIS ON A FAMILY OF NESTED WEIGHTED n-POLYGON NETWORKS ⋮ Efficiency of transportation on weighted extended Koch networks ⋮ Network coherence in the web graphs ⋮ A novel deterministic hybrid complex network model created by inner-outer iteration ⋮ Sublinear fully distributed partition with applications ⋮ Fault-tolerant synchronization control for complex dynamical networks with semi-Markov jump topology ⋮ Structure properties of Koch networks based on networks dynamical systems ⋮ Topologies and Laplacian spectra of a deterministic uniform recursive tree ⋮ Recursive weighted treelike networks ⋮ Broadcast in the rendezvous model ⋮ Statistical mechanics of complex networks ⋮ Leader selection for coherence in symmetric and asymmetric trees ⋮ Noisy consensus dynamics in windmill-type graphs ⋮ COMPLEX NETWORKS: TOPOLOGY, DYNAMICS AND SYNCHRONIZATION ⋮ SAT-based models for overlapping community detection in networks ⋮ Vertex labeling and routing for Farey-type symmetrically-structured graphs ⋮ Deterministic small-world networks ⋮ On the Universality of Small-World Graphs ⋮ Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

Cites Work

• Reliable circulant networks with minimum transmission delay
• Collective dynamics of ‘small-world’ networks
• Famous trails to Paul Erdős. With a sidebar by Paul M. B. Vitanyi.