Related papers: Nilpotent dynamics on signed interaction graphs an…

In this paper, we study the relation between two dynamical systems (V,f) and (V,g) with f. g = g . f. As an application, we show that an endomorphism (respectively a polynomial map with Zariski dense, of bounded Pre(f) has only finitely…

Let X_1 and X_2 be mixing connected algebraic dynamical systems with the Descending Chain Condition. We show that every equivariant continuous map X_1 to X_2 is affine (that is, X_2 is topologically rigid) if and only if the system X_2 has…

A `symbolic dynamical system' is a continuous transformation F:X-->X of a closed perfect subset X of A^V, where A is a finite set and V is countable. (Examples include subshifts, odometers, cellular automata, and automaton networks.) The…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

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…

We introduce simple models of genetic regulatory networks and we proceed to the mathematical analysis of their dynamics. The models are discrete time dynamical systems generated by piecewise affine contracting mappings whose variables…

In this paper we consider dynamical systems generated by a diffeomorphism F defined on U an open subset of R^n, and give conditions over F which imply that their dynamics can be understood by studying the flow of an associated differential…

The self consistent version of the density functional theory (DFT) is presented, which allows to calculate the ground state and dynamic properties of finite multi-electron systems such as atoms, molecules and clusters. The exact functional…

For a graph $G,$ we denote the number of connected subgraphs of $G$ by $F(G)$. For a tree $T$, $F(T)$ has been studied extensively and it has been observed that $F(T)$ has a reverse correlation with Wiener index of $T$. Based on that, we…

We address a system of weakly interacting particles where the heterogenous connections among the particles are described by a graph sequence and the number of particles grows to infinity. Our results extend the existing law of large numbers…

The relationship between the properties of a dynamical system and the structure of its defining equations has long been studied in many contexts. Here we study this problem for the class of conjunctive (resp. disjunctive) Boolean networks,…

This paper investigates regularity, controllability and observability for a networked dynamic system (NDS) with its subsystems being described in a descriptor form and system matrices of each subsystem being represented by a generalized…

Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…

An Automata Network is a map ${f:Q^n\rightarrow Q^n}$ where $Q$ is a finite alphabet. It can be viewed as a network of $n$ entities, each holding a state from $Q$, and evolving according to a deterministic synchronous update rule in such a…

We show that a K-approximate subgroup A of a residually nilpotent group G is contained in boundedly many cosets of a finite-by-nilpotent subgroup, the nilpotent factor of which is of bounded step. Combined with an earlier result of the…

The weak component generalizes the idea of connected components to directed graphs. In this paper, an exact criterion for existence of the giant weak component is derived for directed graphs with arbitrary bivariate degree distributions. In…

We introduce a general framework for analysing general probabilistic theories, which emphasises the distinction between the dynamical and probabilistic structures of a system. The dynamical structure is the set of pure states together with…

This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…