Related papers: Fixed points of Boolean networks, guessing graphs,…
We prove that if $\F$ is an abelian group of $C^1$ diffeomorphisms isotopic to the identity of a closed surface $S$ of genus at least two then there is a common fixed point for all elements of $\F.$
This paper continues a series discussing flaws in published assertions concerning fixed points in digital images.
A connected set in a graph is a subset of vertices whose induced subgraph is connected. Although counting the number of connected sets in a graph is generally a \#P-complete problem, it remains an active area of research. In 2020, Vince…
The biologist Ren\'e Thomas conjectured, twenty years ago, that the presence of a negative feedback circuit in the interaction graph of a dynamical system is a necessary condition for this system to produce sustained oscillations. In this…
In this paper we analyze the PageRank of a complex network as a function of its personalization vector. By using this approach, a complete characterization of the existence and uniqueness of fixed points of PageRank of a graph is given in…
We consider efficiency in the implementation of deep neural networks. Hardware accelerators are gaining interest as machine learning becomes one of the drivers of high-performance computing. In these accelerators, the directed graph…
The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $S$ such that only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing set of a group $\Gamma$ is the set of all fixing numbers of finite…
Logical formalisms such as first-order logic (FO) and fixpoint logic (FP) are well suited to express in a declarative manner fundamental graph functionalities required in distributed systems. We show that these logics constitute good…
We prove that for every integer sequence $I$ satisfying Dold relations there exists a map $f : \mathbb{R}^d \to \mathbb{R}^d$, $d \ge 2$, such that $\mathrm{Per(f)} = \mathrm{Fix(f)} = \{o\}$, where $o$ denotes the origin, and $(i(f^n,…
The study of random graphs and networks had an explosive development in the last couple of decades. Meanwhile, techniques for the statistical analysis of sequences of networks were less developed. In this paper we focus on networks…
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$. We give…
Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…
The map x -> x^x modulo p is related to a variation of the digital signature scheme in a similar way to the discrete exponentiation map, but it has received much less study. We explore the number of fixed points of this map by a statistical…
Coding schemes for several problems in network information theory are constructed starting from point-to-point channel codes that are designed for symmetric channels. Given that the point-to-point codes satisfy certain properties pertaining…
We address the problem of understanding the variable abundance of 3-node and 4-node subgraphs (motifs) in complex networks from a dynamical point of view. As a criterion in the determination of the functional significance of a n-node…
In this paper we study certain analogues of the map defined by Alain Connes, which follows an idea of Atiyah in trying to simplify the proof of Feit-Thompson theorem. It turns out that the the non-zero fixed points of the map can be…
Our goal is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition…
To formulate our results let $f$ be a continuous map from $\mathbb R^n$ to $2^{\mathbb R^n}$ and $k$ a natural number such that $|f(x)|\leq k$ for all $x$. We prove that $f$ is fixed-point free if and only if its continuous extension…
Cover's function counting theorem is a milestone in the theory of artificial neural networks. It provides an answer to the fundamental question of determining how many binary assignments (dichotomies) of $p$ points in $n$ dimensions can be…