Imagen de Portada

Asynchronous dynamics of isomorphic Boolean networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bridoux, Florian, Marchetto, Aymeric Picard, Richard, Adrien
Formato:	Preprint
Publicado:	2024
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Interaction graphs of isomorphic automata networks II: universal dynamics
por: Bridoux, Florian, et al.
Publicado: (2024)

Dividing sums of cycles in the semiring of functional digraphs
por: Bridoux, Florian, et al.
Publicado: (2025)

Strong modules and asynchronous attractors of Boolean networks
por: Ruet, Paul
Publicado: (2026)

There is no prime functional digraph: Seifert's proof revisited
por: Richard, Adrien
Publicado: (2025)

The Gray graph is pseudo 2-factor isomorphic
por: Abreu, Marien, et al.
Publicado: (2025)

Boolean Functions with Small Approximate Spectral Norm
por: Cheung, Tsun-Ming, et al.
Publicado: (2024)

The classification of Boolean degree $1$ functions in high-dimensional finite vector spaces
por: Ihringer, Ferdinand
Publicado: (2023)

A Survey of Cameron-Liebler Sets and Low Degree Boolean Functions in Grassmann Graphs
por: Ihringer, Ferdinand
Publicado: (2024)

Generalising the maximum independent set algorithm via Boolean networks
por: Gadouleau, Maximilien, et al.
Publicado: (2024)

On the number of non-degenerate canalizing Boolean functions
por: Kadelka, Claus
Publicado: (2025)

Geodetic Graphs: Experiments and New Constructions
por: Stober, Florian, et al.
Publicado: (2023)

A unified convention for achievement positional games
por: Galliot, Florian, et al.
Publicado: (2025)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
por: Hörsch, Florian, et al.
Publicado: (2024)

Increasing arc-connectivity by bounded- and fixed-size inversions
por: Hörsch, Florian, et al.
Publicado: (2026)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
por: Chang, Fan, et al.
Publicado: (2025)

Diameter of the inversion graph
por: Havet, Frédéric, et al.
Publicado: (2024)

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2022)

The Avoider-Enforcer game on hypergraphs of rank 3
por: Galliot, Florian, et al.
Publicado: (2025)

On the minimum number of inversions to make a digraph $k$-(arc-)strong
por: Duron, Julien, et al.
Publicado: (2023)

Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set
por: Brause, Christoph, et al.
Publicado: (2022)

The $g$-good-neighbor diagnosability of product networks under the PMC model
por: Wang, Zhao, et al.
Publicado: (2025)

Token positional games
por: Bagan, Guillaume, et al.
Publicado: (2026)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
por: Soltani, Hossein, et al.
Publicado: (2018)

Sufficient conditions for perfect mixed tilings
por: Hurley, Eoin, et al.
Publicado: (2022)

Stability of Linear Boolean Networks
por: Chandrasekhar, Karthik, et al.
Publicado: (2022)

The strong chromatic index of $K_{t,t}$-free graphs
por: Bi, Richard, et al.
Publicado: (2026)

List homomorphisms to separable signed graphs
por: Bok, Jan, et al.
Publicado: (2023)

A lower bound on the spectrum of unimodular networks
por: Rahman, Mustazee
Publicado: (2016)

4-uniform Maker-Breaker and Maker-Maker games are PSPACE-complete
por: Galliot, Florian
Publicado: (2025)

Asynchronous Majority Dynamics on Binomial Random Graphs
por: Mohan, Divyarthi, et al.
Publicado: (2023)

Polynomial-delay generation of functional digraphs up to isomorphism
por: Defrain, Oscar, et al.
Publicado: (2023)

Maker-Maker games of rank 4 are PSPACE-complete
por: Galliot, Florian, et al.
Publicado: (2025)

A Boolean encoding of the Most Permissive semantics for Boolean networks
por: de Chancel, Laure, et al.
Publicado: (2026)

HIST-Critical Graphs and Malkevitch's Conjecture
por: Goedgebeur, Jan, et al.
Publicado: (2024)

Grid Minors and Products
por: Dujmović, Vida, et al.
Publicado: (2024)

An explicit condition for boundedly supermultiplicative subshifts
por: Bui, Vuong, et al.
Publicado: (2024)

Large planar $(n,m)$-cliques
por: Bandopadhyay, Susobhan, et al.
Publicado: (2024)

On open-separating dominating codes in graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

$θ$-free matching covered graphs
por: Joshi, Rohinee, et al.
Publicado: (2024)

Branch-depth is minor closure of contraction-deletion-depth
por: Briański, Marcin, et al.
Publicado: (2024)