2013
DOI: 10.1002/cplx.21437
|View full text |Cite
|
Sign up to set email alerts
|

Computationally tractable pairwise complexity profile

Abstract: Quantifying the complexity of systems consisting of many interacting parts has been an important challenge in

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
33
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
2

Relationship

3
3

Authors

Journals

citations
Cited by 23 publications
(33 citation statements)
references
References 22 publications
0
33
0
Order By: Relevance
“…In this case we may choose the units of scale so that each component has scale equal to 1. This convention was used in previous work on the complexity profile [13][14][15][16][17]. However, it is in many cases necessary to represent the components of a system as having different intrinsic scales, reflecting their built-in size, multiplicity or redundancy.…”
Section: Scalementioning
confidence: 99%
See 4 more Smart Citations
“…In this case we may choose the units of scale so that each component has scale equal to 1. This convention was used in previous work on the complexity profile [13][14][15][16][17]. However, it is in many cases necessary to represent the components of a system as having different intrinsic scales, reflecting their built-in size, multiplicity or redundancy.…”
Section: Scalementioning
confidence: 99%
“…Here we define the shared information, I A (x), of a dependency x in a system A. I generalizes the multivariate mutual information [13][14][15][16][17][30][31][32][33][34][35][36][37][38][39]] to an arbitrary information function H. We note that H and I characterize the same quantity-information-but are applied to different kinds of arguments: H is applied to subsets of components of A, while I is applied to dependencies.…”
Section: Information Quantity In Dependenciesmentioning
confidence: 99%
See 3 more Smart Citations