Reinforced walk on graphs and neural networks
Studia Mathematica, Tome 189 (2008) no. 3, pp. 255-268
Voir la notice de l'article provenant de la source Institute of Mathematics Polish Academy of Sciences
A directed-edge-reinforced random walk on graphs is considered. Criteria for the walk to end up in a limit cycle are given. Asymptotic stability of some neural networks is shown.
Keywords:
directed edge reinforced random walk graphs considered criteria walk end limit cycle given asymptotic stability neural networks shown
Affiliations des auteurs :
Józef Myjak 1 ; Ryszard Rudnicki 2
@article{10_4064_sm189_3_4,
author = {J\'ozef Myjak and Ryszard Rudnicki},
title = {Reinforced walk on graphs and neural networks},
journal = {Studia Mathematica},
pages = {255--268},
publisher = {mathdoc},
volume = {189},
number = {3},
year = {2008},
doi = {10.4064/sm189-3-4},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.4064/sm189-3-4/}
}
Józef Myjak; Ryszard Rudnicki. Reinforced walk on graphs and neural networks. Studia Mathematica, Tome 189 (2008) no. 3, pp. 255-268. doi: 10.4064/sm189-3-4
Cité par Sources :