Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree.
Florian BridouxKévin PerrotAymeric Picard MarchettoAdrien RichardPublished in: CoRR (2023)
Keyphrases
- series parallel
- power law
- random graphs
- highly connected
- degree distribution
- social networks
- small world
- spanning tree
- complex networks
- network design
- clustering coefficient
- dynamic networks
- human computer interaction
- user interaction
- graph theoretic
- network analysis
- graph databases
- regular expressions
- small world networks
- graph structures
- average degree
- neural network
- community discovery
- preferential attachment
- social network analysis
- fully connected
- network topologies
- directed graph
- graph structure
- bipartite graph
- graph matching