Related papers: Fixed points of a random restricted growth sequenc…
Fixpoints are ubiquitous in computer science and when dealing with quantitative semantics and verification one often considers least fixpoints of (higher-dimensional) functions over the non-negative reals. We show how to approximate the…
A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts. This provides a simple realizability criterion based…
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…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
This paper studies the counting problem in random dynamical systems. We noticed that the nature of counting in the random setting is completely different than that of the deterministic systems in the sense that non-exponential growth is…
Logic programming with fixed-point definitions is a useful extension of traditional logic programming. Fixed-point definitions can capture simple model checking problems and closed-world assumptions. Its operational semantics is typically…
In this paper, we investigate properties of the fixed point sequence of the Josephus function $J_3$. First, we establish a connection between this sequence and the Chinese Remainder Theorem. Next, we identify a clear numerical pattern for…
We consider the inhomogeneous version of the fixed-point equation of the smoothing transformation, that is, the equation $X \stackrel{d}{=} C + \sum_{i \geq 1} T_i X_i$, where $\stackrel{d}{=}$ means equality in distribution,…
The present report extends the method of fixed point clustering (Phys.Rev. E 61,5, R4691-4693, 2000) by introducing an indirect criterion for the number of clusters. The derived probability function allows an objective distinction of…
The classical Brouwer fixed point theorem states that in R^d every continuous function from a convex, compact set on itself has a fixed point. For an arbitrary probability space, let L^0 = L^0 (\Omega, A,P) be the set of random variables.…
The \textit{order of appearance} $ z(n) $ of a positive integer $ n $ in the Fibonacci sequence is defined as the smallest positive integer $ j $ such that $ n $ divides the $ j $-th Fibonacci number. A \textit{fixed point} arises when, for…
Minimization of computational errors in the fixed-point data path is often difficult task. Many signal processing algorithms use chains of consecutive additions. The analyzing technique that can be applied to fixed-point data path synthesis…
An automatic sequence is a letter-to-letter coding of a fixed point of a uniform morphism. More generally, we have morphic sequences, which are letter-to-letter codings of fixed points of arbitrary morphisms. There are many examples where…
Expectiles are statistical parameters which also provide a class of sublinear risk measures in finance. They are solutions of continuous optimization problems. The corresponding first order condition provides two different fixed point…
This paper introduces a formal notion of fixed point explanations, inspired by the "why regress" principle, to assess, through recursive applications, the stability of the interplay between a model and its explainer. Fixed point…
Startpoints (resp. endpoints) can be defined as "oriented fixed points". They arise naturally in the study of fixed for multi-valued maps defined on quasi-metric spaces. In this article, we give a new result in the startpoint theory for…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
We obtain new results on the existence and multiplicity of fixed points of Hammerstein equations in very general cones. In order to achieve this, we combine a new formulation of cones in terms of continuous functionals with fixed point…
This paper establishes novel fixed point theorems for Kannan-type and Chatterjea-type mappings in probabilistic cone metric spaces. By integrating probabilistic distance functions with cone-valued structures, we generalize classical fixed…
Selection of descent direction at a point plays an important role in numerical optimization for minimizing a real valued function. In this article, a descent sequence is generated for the functions with bounded parameters to obtain a…