About complexity of complex networks
Abstract We derive complexity estimates for two classes of deterministic networks: the Boolean networks S(B n, m ), which compute the Boolean vector-functions B n, m , and the classes of graphs G(VPm,l,E) $G(V_{P_{m,\,l}}, E)$, with overlapping communities and high density. The latter objects are we...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-10-01
|
| Series: | Applied Network Science |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s41109-019-0217-1 |