Related papers: Fixed points of Boolean networks, guessing graphs,…
Let $S_b(n)$ denote the sum of the squares of the digits of the positive integer $n$ in base $b\geq2$. It is well-known that the sequence of iterates of $S_b(n)$ terminates in a fixed point or enters a cycle. Let $N=2n-1$, $n\geq2$. It is…
We establish a coupled fixed points theorem for a meaningful class of mixed monotone multivalued operators and then we use it to derive some results on existence of quasisolutions and solutions to first--order functional differential…
The set of the fixed points of the Hopfield type network is under investigation. The connection matrix of the network is constructed according the Hebb rule from the set of memorized patterns which are treated as distorted copies of the…
Structural balance theory assumes triads in networks to gravitate towards stable configurations. The theory has been verified for undirected graphs. Since real-world networks are often directed, we introduce a novel method for considering…
This paper deals with a universal coding problem for a certain kind of multiterminal source coding network called a generalized complementary delivery network. In this network, messages from multiple correlated sources are jointly encoded,…
The problem of optimising a network of discretely firing neurons is addressed. An objective function is introduced which measures the average number of bits that are needed for the network to encode its state. When this is minimised, it is…
Recurrent neural networks are widely used in speech and language processing. Due to dependency on the past, standard algorithms for training these models, such as back-propagation through time (BPTT), cannot be efficiently parallelised.…
Functions correspond to one of the key concepts in mathematics and science, allowing the representation and modeling of several types of signals and systems. The present work develops an approach for characterizing the coverage and…
In this paper we prove FG-coupled fixed point theorems for different contractive mappings and generalized quasi- contractive mappings in partially ordered complete metric spaces. We prove the existence of FG-coupled fixed points of…
A. Rosenfeld introduced the notion of a digitally continuous function between digital images, and showed that although digital images need not have fixed point properties analogous to those of the Euclidean spaces modeled by the images,…
In this paper, we are concerned with the study of the existence of fixed points for single and multi-valued three-points contractions. Namely, we first introduce a new class of single-valued mappings defined on a metric space equipped with…
In this paper, we discuss the existence of fixed points for integral type contractions in uniform spaces endowed with both a graph and an $E$-distance. We also give two sufficient conditions under which the fixed point is unique. Our main…
We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…
Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word…
The paper is devoted to the fixed point theory in four aspects: of contractions, nonexpansive mappings, generalized inward mappings, and of the tool theorems. The manuscript was written about ten years ago. At first Nadler's concept of…
In this paper, the author presents algorithms that allow determining the number of fixed points in permutations of a set of monotone Boolean functions. Then, using Burnside's lemma, the author determines the number of inequivalent monotone…
Inverse problems consist of recovering a signal from a collection of noisy measurements. These problems can often be cast as feasibility problems; however, additional regularization is typically necessary to ensure accurate and stable…
We consider signed networks in which connections or edges can be either positive (friendship, trust, alliance) or negative (dislike, distrust, conflict). Early literature in graph theory theorized that such networks should display…
A distributed algorithm is described for finding a common fixed point of a family of m>1 nonlinear maps M_i : R^n -> R^n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed…
In this paper we study the size of the fixed point set of a Hamiltonian diffeomorphism on a closed symplectic manifold which is both rational and weakly monotone. We show that there exists a non-trivial cycle of fixed points whenever the…