Copertina

A statistical test for network similarity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Miasnikof, Pierre, Shetopaloff, Alexander Y.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Discrete Mathematics Applications
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
di: Bussemaker, Jasper H., et al.
Pubblicazione: (2025)

Linguistic Approach to Time Series Forecasting
di: Lande, Dmytro, et al.
Pubblicazione: (2022)

Pairwise similarity method for majority domination problem
di: Shushko, N. I., et al.
Pubblicazione: (2025)

Trapping and commutative Boolean networks
di: Gadouleau, Maximilien
Pubblicazione: (2026)

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

The formula for the completion time of project networks
di: Castejón-Limas, Manuel, et al.
Pubblicazione: (2024)

Effective approach of the tridendriform Schroeder tree algebra
di: Catoire, Pierre, et al.
Pubblicazione: (2026)

Contribution to Blocker and Interdiction optimization problems in networks
di: Martin, Sébastien
Pubblicazione: (2024)

Phenotype control and elimination of variables in Boolean networks
di: Tonello, Elisa, et al.
Pubblicazione: (2024)

Soft happy colourings and community structure of networks
di: Shekarriz, Mohammad H., et al.
Pubblicazione: (2024)

Creation of fixed points in block-parallel Boolean automata networks
di: Perrot, Kévin, et al.
Pubblicazione: (2025)

Agglomeration based influential node ranking in path-type networks
di: Berberler, Zeynep Nihan, et al.
Pubblicazione: (2025)

Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
di: Schwieger, Robert, et al.
Pubblicazione: (2023)

Majority Boolean networks classifying density: structural characterization and complexity
di: Perrot, Kévin, et al.
Pubblicazione: (2026)

tinygarden -- A java package for testing properties of spanning trees
di: Dubinsky, Manuel, et al.
Pubblicazione: (2024)

Fast solutions to k-parity and k-synchronisation using parallel automata networks
di: Perrotin, Pacôme, et al.
Pubblicazione: (2024)

A decomposition approach for large virtual network embedding
di: Benhamiche, Amal, et al.
Pubblicazione: (2025)

Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
di: Pierre, Laurent
Pubblicazione: (2016)

Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
di: Martin, Sébastien, et al.
Pubblicazione: (2025)

Near-optimal edge partitioning via intersecting families
di: Yakunin, Alexander, et al.
Pubblicazione: (2025)

Extended formulations for the maximum weighted co-2-plex problem
di: Dupont-Bouillard, Alexandre, et al.
Pubblicazione: (2025)

Temporal passing network in basketball: the effect of time pressure on the dynamics of team organization at micro and meso levels
di: Bourgeais, Quentin, et al.
Pubblicazione: (2025)

Boolean-network simplification and rule fitting to unravel chemotherapy resistance in non-small cell lung cancer
di: Espinoza, Alonso, et al.
Pubblicazione: (2025)

Computing Height-Optimal Tangles Faster
di: Firman, Oksana, et al.
Pubblicazione: (2019)

Results on cubic bent and weakly regular bent $p$-ary functions leading to a class of cubic ternary non-weakly regular bent functions
di: Carlet, Claude, et al.
Pubblicazione: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
di: Bourneuf, Romain, et al.
Pubblicazione: (2025)

The Complexity of Finding Tangles
di: Firman, Oksana, et al.
Pubblicazione: (2020)

Asynchronous dynamics of isomorphic Boolean networks
di: Bridoux, Florian, et al.
Pubblicazione: (2024)

On arborescence packing augmentation in hypergraphs
di: Hoppenot, Pierre, et al.
Pubblicazione: (2024)

Augmenting a hypergraph to have a matroid-based $(f,g)$-bounded $(α,β)$-limited packing of rooted hypertrees
di: Hoppenot, Pierre, et al.
Pubblicazione: (2024)

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
di: Helleseth, Tor, et al.
Pubblicazione: (2025)

Playing Snake on a Graph
di: Graafsma, Denise, et al.
Pubblicazione: (2025)

Strong modules and asynchronous attractors of Boolean networks
di: Ruet, Paul
Pubblicazione: (2026)

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

Regular packing of rooted hyperforests with root constraints in hypergraphs
di: Hoppenot, Pierre, et al.
Pubblicazione: (2023)

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

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
di: Auger, David, et al.
Pubblicazione: (2024)

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

Graph drawing applications in combinatorial theory of maturity models
di: Kajzer, Špela, et al.
Pubblicazione: (2024)

Coloring Mixed and Directional Interval Graphs
di: Gutowski, Grzegorz, et al.
Pubblicazione: (2022)