On Measuring the Complexity of Networks: Kolmogorov Complexity versus Entropy
Work
Year: 2017
Type: article
Abstract: One of the most popular methods of estimating the complexity of networks is to measure the entropy of network invariants, such as adjacency matrices or degree sequences. Unfortunately, entropy and all... more
Source: Complexity
Institutions Poznań University of Technology, AGH University of Krakow, Wrocław University of Science and Technology
Cites: 32
Cited by: 53
Related to: 10
FWCI: 2.889
Citation percentile (by year/subfield): 93.41
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
APC paid (est): $2,300
Funders Narodowe Centrum Nauki, Narodowe Centrum Nauki, Narodowe Centrum Nauki, Narodowe Centrum Nauki, Narodowe Centrum Nauki
Grant IDS 3628/H2020/2016/2, DEC-2016/21/B/ST6/01463, DEC-2016/23/B/ST6/03962, 691152, DEC-2016/21/D/ST6/02948