Related papers: Fixed Points and 2-Cycles of Synchronous Dynamic C…
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
One of the main problems of the theory of dynamical systems is the determination of the existence of periodic orbits of a self-map and more generally, the structure of the set of periods. Define the minimum period of a class os self-maps of…
We study a continuous time Markov process whose state space consists of an assignment of +1 or -1 to each vertex of a graph G. The graphs that we treat are related to homogeneous trees of degree K $\geq$ 3, such as finite or infinite stacks…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
Evolving trees arise in many real-life scenarios from computer file systems and dynamic call graphs, to fake news propagation and disease spread. Most layout algorithms for static trees do not work well in an evolving setting (e.g., they…
Two possible definitions of fixed points in the self-similar analysis of time series are considered. One definition is based on the minimal-difference condition and another, on a simple averaging. From studying stock market time series, one…
We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…
A new class of critical points, termed as perpetual points, where acceleration becomes zero but the velocity remains non-zero, are observed in dynamical systems. The velocity at these points is either maximum or minimum or of inflection…
This paper discusses discrete-time maps of the form $x(k + 1) = F(x(k))$, focussing on equilibrium points of such maps. Under some circumstances, Lefschetz fixed-point theory can be used to establish the existence of a single locally…
We propose a method to identify nonlinear acyclic networks in continuous time when the dynamics are located on the edges and all the nodes are excited. We show that it is necessary and sufficient to measure all the sinks to identify any…
In this paper, we formalize design patterns, commonly used in the self-stabilizing area, to obtain general statements regarding both correctness and time complexity guarantees. Precisely, we study a general class of algorithms designed for…
This article presents the exact solution of fixed points functions for the cycle of period four of the quadratic recurrence equations. The solution is demonstrated for the quadratic map and the logistic map. These recurrence equations,…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
This paper characterizes the attractor structure of synchronous and asynchronous Boolean networks induced by bi-threshold functions. Bi-threshold functions are generalizations of classical threshold functions and have separate threshold…
In this paper, we develop a general analysis for the fixed points of the operators defining the graph splitting methods from [SIAM J. Optim., 34 (2024), pp. 1569-1594] by Bredies, Chenchene and Naldi. We particularize it to the case where…
We introduce a simple model of static networks, where nodes are located on a ring structure, and two accompanying dynamic rules of repeated averaging on periodic node states. We assume nodes can interact with neighbors, and will add…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
A dynamical systems approach to competition of Saffman-Taylor fingers in a channel is developed. This is based on the global study of the phase space structure of the low-dimensional ODE's defined by the classes of exact solutions of the…
An n dimensional monomial dynamical system over a finite field K is a nonlinear deterministic time discrete dynamical system with the property that each of the n component functions is a monic nonzero monomial function in n variables. In…
For networks of coupled dynamical systems we characterize admissible functions, that is, functions whose gradient is an admissible vector field. The schematic representation of a gradient network dynamical system is of an undirected cell…