Symmetry-driven network reconstruction through pseudobalanced coloring optimization
From MaRDI portal
Publication:5101076
DOI10.1088/1742-5468/ac7a26OpenAlexW4285601632MaRDI QIDQ5101076
No author found.
Publication date: 2 September 2022
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07821
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Kuramoto model in complex networks
- Graph fibrations and symmetries of network dynamics
- Upper bounds on algebraic connectivity via convex optimization
- Irreducibly inconsistent systems of linear inequalities
- Synchrony patterns in gene regulatory networks
- Practical graph isomorphism. II.
- Mesoscale and clusters of synchrony in networks of bursting neurons
- Computation of Balanced Equivalence Relations and Their Lattice for a Coupled Cell Network
- Balanced coloring of bipartite graphs
- Statistical mechanics of complex networks
- Improving Discrete Model Representations via Symmetry Considerations
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- `` Strong NP-Completeness Results
- Networks
- Reducibility among Combinatorial Problems
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- Nonlinear dynamics of networks: the groupoid formalism
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- Symmetry in complex networks