Networks and graphs

2003 ◽  
Author(s):  
David K. Smith
Keyword(s):  
Networks And Graphs

scholarly journals Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis

Entropy ◽  
2021 ◽  
Vol 23 (12) ◽  
pp. 1604
Author(s):  
Amirmohammad Farzaneh ◽  
Justin P. Coon ◽  
Mihai-Alin Badiu
Keyword(s):  
Upper Bound ◽  
Kolmogorov Complexity ◽  
Complexity Analysis ◽  
Networks And Graphs ◽  
Simple Graphs ◽  
Graph Compression ◽  
Graphs And Networks

Throughout the years, measuring the complexity of networks and graphs has been of great interest to scientists. The Kolmogorov complexity is known as one of the most important tools to measure the complexity of an object. We formalized a method to calculate an upper bound for the Kolmogorov complexity of graphs and networks. Firstly, the most simple graphs possible, those with O(1) Kolmogorov complexity, were identified. These graphs were then used to develop a method to estimate the complexity of a given graph. The proposed method utilizes the simple structures within a graph to capture its non-randomness. This method is able to capture features that make a network closer to the more non-random end of the spectrum. The resulting algorithm takes a graph as an input and outputs an upper bound to its Kolmogorov complexity. This could be applicable in, for example evaluating the performances of graph compression methods.

scholarly journals Resonances and poles in isoscattering microwave networks and graphs

2014 ◽  
Vol 89 (3) ◽  
Author(s):  
Michał Ławniczak ◽  
Adam Sawicki ◽  
Szymon Bauch ◽  
Marek Kuś ◽  
Leszek Sirko
Keyword(s):  
Networks And Graphs ◽  
Microwave Networks
Sign in / Sign up

Export Citation Format

Share Document