Dynamics of neural networks over undirected graphs
Tài liệu tham khảo
Anafi, 2010, Balancing robustness against the dangers of multiple attractors in a Hopfield-type model of biological attractors, PLoS One, 5, e14413, 10.1371/journal.pone.0014413
Aracena, 2004, Positive and negative circuits in discrete neural networks, IEEE Transactions on Neural Networks, 15, 77, 10.1109/TNN.2003.821555
Aracena, 2009, On the robustness of update schedules in Boolean networks, BioSystems, 97, 1, 10.1016/j.biosystems.2009.03.006
Barahona, 1982, On the computational complexity of ising spin glass models, Journal of Physics A, 3241, 10.1088/0305-4470/15/10/028
Barra, 2012, On the equivalence of Hopfield networks and Boltzmann machines, Neural Networks, 34, 1, 10.1016/j.neunet.2012.06.003
Bornholdt, 2008, Boolean network models of cellular regulation: prospects and limitations, Journal of the Royal Society Interface, 5, S85, 10.1098/rsif.2008.0132.focus
Castellano, 2009, Statistical physics of social dynamics, Physical Review Letters, 591
Cosnard, 1997, Discrete state neural networks and energies, Neural Networks, 10, 327, 10.1016/S0893-6080(96)00081-0
Davidich, 2008, Boolean network model predicts cell cycle sequence of fission yeast, PLoS One, 3, e1672, 10.1371/journal.pone.0001672
Garey, 1979
Goles, 1982, Fixed point behavior of threshold functions on a finite set, SIAM Journal on Algebraic and Discrete Methods, 3, 529, 10.1137/0603054
Goles, 2003, Energy functionals for neural networks, 402
Goles, 1990
Goles, E., & Matamala, M. (1993). Complexity of block-sequential update for symmetric neural networks. In Proc. IJCNN’93, Nagoya, Japan (pp. 1469–1472).
Goles, 2013, Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks, Bulletin of Mathematical Biology, 75, 939, 10.1007/s11538-012-9794-1
Goles, 2014, Computational complexity of automata networks under different updating schemes, Theoretical Computer Science, 10.1016/j.tcs.2014.09.010
Goles, 2014, The Complexity of the majority rule on planar graphs, Advances in Applied Mathematics
Goles, 2013, The complexity of the bootstraping percolation and other problems, Theoretical Computer Science, 504, 73, 10.1016/j.tcs.2012.08.001
Goles, 2012, Disjunctive networks and update schedules, Advances in Applied Mathematics, 48, 646, 10.1016/j.aam.2011.11.009
Goles, 1980, Periodic behavior of generalized threshold functions, Discrete Mathematics, 30, 187, 10.1016/0012-365X(80)90121-1
Goles-Chacc, 1985, Decreasing energy functions as a tool for studying threshold networks, Discrete Applied Mathematics, 12, 261, 10.1016/0166-218X(85)90029-0
Goles-Domic, 2011, Dynamics and complexity of the schelling segregation model, Physical Review E, 83, 056111, 10.1103/PhysRevE.83.056111
Hadlock, 1975, Finding a maximum cut of a planar graph in polynomial time, SIAM Journal of Computing, 4, 221, 10.1137/0204019
Hardy, 2008
Hopfield, 1982, Neural networks and physical systems with emergent collective computational abilities, Proceedings of the National Academy of Sciences, 79, 2554, 10.1073/pnas.79.8.2554
Kiwi, 1994, No polynomial bound for the period of the parallel chip firing game on graphs, Theoretical Computer Science, 136, 527, 10.1016/0304-3975(94)00131-2
Li, 2004, The yeast cell-cycle network is robustly designed, Proceedings of the National Academy of Sciences, 101, 4781, 10.1073/pnas.0305937101
Maetschke, 2014, Characterizing cancer subtypes as attractors of Hopfield networks, Bioinformatics, 30, 1273, 10.1093/bioinformatics/btt773
Montalva, 2011
Moore, 2011
Mortveit, 2012, Limit cycle structure for block-sequential threshold systems, 672
Noual, 2012
Pajares, 2010, A Hopfield neural network for combining classifiers applied to textured images, Neural Networks, 23, 144, 10.1016/j.neunet.2009.07.019
Robert, 1986
Ruz, 2014, Dynamical and topological robustness of the mammalian cell cycle network: a reverse engineering approach, BioSystems, 115, 23, 10.1016/j.biosystems.2013.10.007