Related papers: The Number of Fixed Points of AND-OR Networks with…
Exact solutions for the learning problem of autoassociative networks with binary couplings are determined by a new method. The use of a branch-and-bound algorithm leads to a substantial saving of computational time compared with complete…
It has recently been observed that, in contrast to the classical case, holomorphic structures on line bundles over the quantum projective line are not uniquely determined by degree. We formulate a fixed-point-theoretic framework for the…
In this paper we investigate fixed-point numbers and entropies of endomorphisms on abelian varieties. It was shown quite recently that the number of fixed-points of an iterated endomorphism on a simple complex torus is either periodic or…
To model biological systems using networks, it is desirable to allow more than two levels of expression for the nodes and to allow the introduction of parameters. Various modeling and simulation methods addressing these needs using Boolean…
In this paper, we examine some properties of the fixed point set of a digitally continuous function. The digital setting requires new methods that are not analogous to those of classical topological fixed point theory, and we obtain results…
We prove a generalization of the Poincar\'e-Birkhoff theorem for the open annulus showing that if a homeomorphism satisfies a certain twist condition and the nonwandering set is connected, then there is a fixed point. Our main focus is the…
In the present article, we introduce a unified notion of multi-tupled fixed points and utilize the same to prove some existence and uniqueness unified multi-tupled fixed point theorems for Boyd-Wong type nonlinear contractions satisfying…
A large amount of research activity in power systems areas has focused on developing computational methods to solve load flow equations where a key question is the maximum number of isolated solutions.Though several concrete upper bounds…
An important problem in the theory of finite dynamical systems is to link the structure of a system with its dynamics. This paper contains such a link for a family of nonlinear systems over the field with two elements. For systems that can…
Given a graph $G$, viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with $G$ as interaction graph. We prove that if $G$ has no induced $C_4$, then this quantity equals…
Given a digraph $G$, a lot of attention has been deserved on the maximum number $\phi(G)$ of fixed points in a Boolean network $f:\{0,1\}^n\to\{0,1\}^n$ with $G$ as interaction graph. In particular, a central problem in network coding…
We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…
This paper considers synchronous discrete-time dynamical systems on graphs based on the threshold model. It is well known that after a finite number of rounds these systems either reach a fixed point or enter a 2-cycle. The problem of…
We study the class of cooperative Boolean networks whose only regulatory functions are COPY, binary AND, and binary OR. We prove that for all sufficiently large N and c < 2 there exist Boolean networks in this class that have an attractor…
Recent empirical studies have identified fixed point iteration phenomena in deep neural networks, where the hidden state tends to stabilize after several layers, showing minimal change in subsequent layers. This observation has spurred the…
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability…
Boolean networks are an important class of computational models for molecular interaction networks. Boolean canalization, a type of hierarchical clustering of the inputs of a Boolean function, has been extensively studied in the context of…
The dynamics of Boolean networks (BN) with quenched disorder and thermal noise is studied via the generating functional method. A general formulation, suitable for BN with any distribution of Boolean functions, is developed. It provides…
Nonexpansive mappings play a central role in modern optimization and monotone operator theory because their fixed points can describe solutions to optimization or critical point problems. It is known that when the mappings are sufficiently…
This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…