Related papers: Fixed points of Boolean networks, guessing graphs,…
This paper proposes a new parameter for studying Boolean networks: the independence number. We establish that a Boolean network is $k$-independent if, for any set of $k$ variables and any combination of binary values assigned to them, there…
Background: Networks in different domains are characterized by similar global characteristics while differing in local structures. To further extend this concept, we investigated network regularities on a fine scale in order to examine the…
Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…
A Boolean network is a function $f:\{0,1\}^n\to\{0,1\}^n$ from which several dynamics can be derived, depending on the context. The most classical ones are the synchronous and asynchronous dynamics. Both are digraphs on $\{0,1\}^n$, but the…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
We consider an infinite-dimensional non-linear operator related to a hard core (HC) model with a countable set $\mathbb{N}$ of spin values. It is known that finding the fixed points of an infinite-dimensional operator is generally…
We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…
Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…
We demonstrate the effects of embedding subgraphs using a Boolean network, which is one of the discrete dynamical models for transcriptional regulatory networks. After comparing the dynamical properties of network embedded seven different…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
Graphlet counting is an important problem as it has numerous applications in several fields, including social network analysis, biological network analysis, transaction network analysis, etc. Most of the practical networks are dynamic. A…
A fixed point theorem is proved for inverse transducers, leading to an automata-theoretic proof of the fixed point subgroup of an endomorphism of a finitely generated virtually free group being finitely generated. If the endomorphism is…
We study edge-labelings of the complete bidirected graph $\overset{\tiny\leftrightarrow}{K}_n$ with functions from the set $[d] = \{1, \dots, d\}$ to itself. We call a cycle in $\overset{\tiny\leftrightarrow}{K}_n$ a fixed-point cycle if…
The set of the fixed points of the Hopfield type network is under investigation. The connection matrix of the network is constructed according to the Hebb rule from the set of memorized patterns which are treated as distorted copies of the…
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical properties of transition systems. We are interested in the…
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…
This work analyzes the convergence properties of signed networks with nonlinear edge functions. We consider diffusively coupled networks comprised of maximal equilibrium-independent passive (MEIP) dynamics on the nodes, and a general class…
Automata networks can be seen as bare finite dynamical systems, but their growing theory has shown the importance of the underlying communication graph of such networks. This paper tackles the question of what dynamics can be realized up to…
We present a mathematical model: dynamical systems over finite sets (DSF), and we show that Boolean and discrete genetic models are special cases of DFS. In this paper, we prove that a function defined over finite sets with different number…