Abstract
Small-World networks are highly clusterized networks with small distances between their nodes. There are some well known biological networks that present this kind of connectivity. On the other hand, the usual models of Small-World networks make use of undirected and unweighted graphs in order to represent the connectivity between the nodes of the network. These kind of graphs cannot model some essential characteristics of neural networks as, for example, the direction or the weight of the synaptic connections. In this paper we analyze different kinds of directed graphs and show that they can also present a Small-World topology when they are shifted from regular to random. Also analytical expressions are given for the cluster coefficient and the characteristic path of these graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Chartrand, G.: Introductory Graph Theory. Dover Publications, Mineola New York (1985).
Sporns, O., Tononi, G., Edelman, G.M.: Relating Anatomical and Functional Connectivity in Graphs and Cortical Connection Matrices. Cerebral Cortex, Vol. 10. Oxford University Press, New York (2000) 127–141
White, J.G., Southgate, E., Thompson, J.N., Brenner, S.: The structure of the nervous system of the nematode Caenorhabditis elegans. Philosphical Transactions of the Royal Society of London. Series B 314 (1986) 1–340
Achacoso, T.B., Yamamoto, W.S.: AY’s Neuroanatomy of C.elegans for Computation. CRC Press, Boca Raton Florida (1992).
Lago L.F. Huerta R. Corbacho F. and Siguenza J.A. Fast Response and Temporal Coding on Coherent Oscillations in Small-world Networks, Physical Review Letters, 84(12) (2000), 2758–2761.
A. G. Phadke A.G. and Thorp J.S.: Computer Relaying for Power systems Wiley, New York, (1988).
Milgram S.: The Small World Problem, Psychology today, 2 (1967), 60–67.
Araújo T. and Vilela Mendes R.: Function and Form in Networks of Interacting Agents, Complex Systems 12 (2000) 357–378.
Watts, D.J.: Small Worlds: The dynamic of Networks between Order and Randomness, Princeton University Press, Princeton, New Jersey (1999).
Bollobas, B.: Random Graphs. Harcourt Brace Jovanovich, Orlando Florida (1985).
Watts, D.J., Strogatz, S. H.: Collective dynamics of small-world networks, Nature. 393 (1998) 440.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aguirre, C., Huerta, R., Corbacho, F., Pascual, P. (2002). Analysis of Biologically Inspired Small-World Networks. In: Dorronsoro, J.R. (eds) Artificial Neural Networks — ICANN 2002. ICANN 2002. Lecture Notes in Computer Science, vol 2415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46084-5_5
Download citation
DOI: https://doi.org/10.1007/3-540-46084-5_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44074-1
Online ISBN: 978-3-540-46084-8
eBook Packages: Springer Book Archive