Decreasing energy functions as a tool for studying threshold networks
From MaRDI portal
Publication:1071738
DOI10.1016/0166-218X(85)90029-0zbMath0585.94018MaRDI QIDQ1071738
Didier Pellegrin, Françoise Fogelman-Soulié, Eric Goles Chacc
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
fixed pointsmonotonic operatortransient lengthBlock sequential iterations of threshold networksnetworks of generalized majority functionsspin glass energy
Related Items
On pre-periods of discrete influence systems ⋮ Symmetric discrete universal neural networks ⋮ Sequential simulation of parallel iterations and applications ⋮ On \(f\)-reversible processes on graphs ⋮ Phase transitions in stochastic non-linear threshold Boolean automata networks on \(\mathbb{Z}^2\): the boundary impact ⋮ General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results ⋮ A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton ⋮ On the complexity of two-dimensional signed majority cellular automata ⋮ Are analog neural networks better than binary neural networks? ⋮ Neural networks and complexity theory ⋮ About non-monotony in Boolean automata networks ⋮ Dynamics of neural networks over undirected graphs ⋮ Boolean analysis of lateral inhibition ⋮ PSPACE-completeness of majority automata networks ⋮ Cold dynamics in cellular automata: a tutorial ⋮ Triggering cascades on undirected connected graphs ⋮ Towards a unified recurrent neural network theory: the uniformly pseudo-projection-anti-monotone net ⋮ The complexity of the asynchronous prediction of the majority automata ⋮ Guaranteeing convergence of iterative skewed voting algorithms for image segmentation ⋮ Computational complexity of threshold automata networks under different updating schemes ⋮ Limit cycle structure for dynamic bi-threshold systems ⋮ On the computational power of discrete Hopfield nets ⋮ Asymmetric Boltzmann machines ⋮ A characterization of the existence of energies for neural networks ⋮ Pattern Storage, Bifurcations, and Groupwise Correlation Structure of an Exactly Solvable Asymmetric Neural Network Model ⋮ A computational study of \(f\)-reversible processes on graphs ⋮ The complexity of the majority rule on planar graphs ⋮ On the Period-Two-Property of the Majority Operator in Infinite Graphs ⋮ On the convergence of iterative receiver algorithms utilizing hard decisions ⋮ A composite neural network model for perseveration and distractibility in the Wisconsin card sorting test ⋮ Eric Goles ⋮ On the effects of firing memory in the dynamics of conjunctive networks ⋮ On the effects of firing memory in the dynamics of conjunctive networks ⋮ Computing with truly asynchronous threshold logic networks ⋮ Stability analysis of discrete Hopfield neural networks with the nonnegative definite monotone increasing weight function matrix ⋮ Unnamed Item ⋮ Symmetric functional differential equations and neural networks with memory ⋮ Seven things i know about them ⋮ On Boolean automata isolated cycles and tangential double-cycles dynamics ⋮ The Refractory Period Matters: Unifying Mechanisms of Macroscopic Brain Waves ⋮ Distributed probabilistic polling and applications to proportionate agreement ⋮ Markovian perturbations of discrete iterations: Lyapunov functions, global minimization, and associative memory ⋮ Unnamed Item ⋮ Local majorities, coalitions and monopolies in graphs: A review
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Iterative behaviour of generalized majority functions
- Transient length in sequential iteration of threshold functions
- Collective properties of neural networks: A statistical physics approach
- The convergence of symmetric threshold automata
- Neural networks and physical systems with emergent collective computational abilities.
