Random graphs in a neural computation model

International Journal of Computer Mathematics

Volumn 80, Issue 6, 2003, Pages 689-707

  Gerbessiotis, Alexandros V ^a  

^a University Heights   (United States)

Author keywords

Connectivity properties; Neural networks; Random graphs

Indexed keywords

ASYMPTOTIC STABILITY; COMPUTATIONAL METHODS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; NEURAL NETWORKS; PROBLEM SOLVING; SET THEORY;

CONNECTIVITY PROPERTIES; NEURAL COMPUTATION MODELS; RANDOM GRAPHS;

GRAPH THEORY;

EID: 13844306688     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/0020716031000079518     Document Type: Article

References (12)

1. Ajtai, M., Komlós, J. and Szemerédi, E. (1981). The longest path in a random graph. Combinatorial, 1, 1-12.
2. Angluin, D. and Valiant, L. G. (1979). Fast probabilistic algorithms for Hamiltonian circuits and matchings. J. Comput. Syst. Sci., 18, 155-193.
3. Barndorff-Nielsen, O. E. and Cox, D. R. (1989). Asymptotic Techniques for Use in Statistics, Chapman and Hall, London.
4. Billingsley, P. (1986). Probability and Measure. Wiley, New York.
5. Bollobás, B. (1985). Random graphs. Academic Press, New York.
6. Erdos, P., Rényi, A. and Sós, V. T. (1966). On a problem of graph theory. Studia Scientarium Mathematicarum Hunganica, 1.
7. Feller, W. (1971). An Introduction to Probability Theory and its Applications, Vol. 2. Wiley, New York.
8. Gerbessiotis, A. V. (1998). A graph-theoretic result for a model of neural computation. Discrete Applied Mathematics, Vol. 82. Elsevier Science B.V., pp. 257-262.
9. Rényi, A. Probability Theory. Akademiai Kiado, Budapest.
10. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
11. Valiant, L. G. (1988). Functionality in neural nets. Proceedings of the American Association for Artificial Intelligence, Vol. 2.
12. Valiant, L. G. (1995). Circuits of the Mind, Oxford University Press, Oxford.