7 citations · 10 across the 8 of their papers we have counts for
12 papers
On the Dynamics of Bounded-Degree Automata Networks
Julio Aracena, Florian Bridoux, Maximilien Gadouleau +4
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…
Hamiltonian dynamics of Boolean networks
Arturo Zapata-Cortés, Julio Aracena
This article examines the impact of Hamiltonian dynamics on the interaction graph of Boolean networks. Three types of dynamics are considered: maximum height, Hamiltonian cycle, an…
K-Independent Boolean Networks
Julio Aracena, Raúl Astete-Elguin
This paper proposes a new parameter for studying Boolean networks: the independence number. We establish that a Boolean network is -independent if, for any set of variables…
Complexity of limit cycles with block-sequential update schedules in conjunctive networks
Julio Aracena, Florian Bridoux, Luis Gómez +1
In this paper, we deal the following decision problem: given a conjunctive Boolean network defined by its interaction digraph, does it have a limit cycle of a given length k? We pr…
Synchronizing Boolean networks asynchronously
Julio Aracena, Adrien Richard, Lilian Salinas
The {\em asynchronous automaton} associated with a Boolean network , considered in many applications, is the finite deterministic automaton where the set o…
On the Recognition of Strong-Robinsonian Incomplete Matrices
Julio Aracena, Christopher Thraves Caro
A matrix is incomplete when some of its entries are missing. A Robinson incomplete symmetric matrix is an incomplete symmetric matrix whose non-missing entries do not decrease alon…
Finding the fixed points of a Boolean network from a positive feedback vertex set
Julio Aracena, Luis Cabreras-Crot, Lilian Salinas
In the modeling of biological systems by Boolean networks a key problem is finding the set of fixed points of a given network. Some constructed algorithms consider certain structur…
The Weighted Sitting Closer to Friends than Enemies Problem in the Line
Julio Aracena, Christopher Thraves Caro
The weighted \emph{Sitting Closer to Friends than Enemies} (SCFE) problem is to find an injection of the vertex set of a given weighted graph into a given metric space so that, for…
The Sitting Closer to Friends than Enemies Problem in the Circumference
Felipe Benítez, Julio Aracena, Christopher Thraves Caro
The Sitting Closer to Friends than Enemies (SCFE) problem is to find an embedding in a metric space for the vertices of a given signed graph so that, for every pair of incident edg…
Fixing monotone Boolean networks asynchronously
Julio Aracena, Maximilien Gadouleau, Adrien Richard +1
The asynchronous automaton associated with a Boolean network is considered in many applications. It is the finite deterministic automaton with set of stat…
Number of fixed points and disjoint cycles in monotone Boolean networks
Julio Aracena, Adrien Richard, Lilian Salinas
Given a digraph , a lot of attention has been deserved on the maximum number of fixed points in a Boolean network with as interaction graph.…
Fixed points in conjunctive networks and maximal independent sets in graph contractions
Julio Aracena, Adrien Richard, Lilian Salinas
Given a graph , viewed as a loop-less symmetric digraph, we study the maximum number of fixed points in a conjunctive boolean network with as interaction graph. We prove tha…