scholarly journals Using Kolmogorov Complexity with Graph and Vertex Entropy to Measure Similarity of Empirical Graphs with Theoretical Graph Models

2015 ◽  
Author(s):  
Mikołaj Morzy ◽  
Tomasz Kajdanowicz
Author(s):  
Evgenia R. Muntyan

The article analyzes a number of methods of knowledge formation using various graph models, including oriented, undirected graphs with the same type of edges and graphs with multiple and different types of edges. This article shows the possibilities of using graphs to represent a three-level structure of knowledge in the field of complex technical systems modeling. In such a model, at the first level, data is formed in the form of unrelated graph vertices, at the second level – information presented by a related undirected graph, and at the third level – knowledge in the form of a set of graph paths. The proposed interpretation of the structure of knowledge allows to create new opportunities for analytical study of knowledge and information, their properties and relationships.


Author(s):  
Mark Newman

The study of networks, including computer networks, social networks, and biological networks, has attracted enormous interest in recent years. The rise of the Internet and the wide availability of inexpensive computers have made it possible to gather and analyse network data on an unprecendented scale, and the development of new theoretical tools has allowed us to extract knowledge from networks of many different kinds. The study of networks is broadly interdisciplinary and developments have occurred in many fields, including mathematics, physics, computer and information sciences, biology, and the social science. This book brings together the most important breakthroughts in each of these fields and presents them in a unified fashion, highlighting the strong interconnections between work in different areas. Topics covered include the measurement of networks; methods for analysing network data, including methods developed in physics, statistics, and sociology; fundamentals of graph theory; computer algorithms, including spectral algorithms and community detection; mathematical models of networks such as random graph models and generative models; and models of processes taking place on networks.


2020 ◽  
pp. 1-28
Author(s):  
NIKITA MORIAKOV

Abstract A theorem of Brudno says that the Kolmogorov–Sinai entropy of an ergodic subshift over $\mathbb {N}$ equals the asymptotic Kolmogorov complexity of almost every word in the subshift. The purpose of this paper is to extend this result to subshifts over computable groups that admit computable regular symmetric Følner monotilings, which we introduce in this work. For every $d \in \mathbb {N}$ , the groups $\mathbb {Z}^d$ and $\mathsf{UT}_{d+1}(\mathbb {Z})$ admit computable regular symmetric Følner monotilings for which the required computing algorithms are provided.


Sign in / Sign up

Export Citation Format

Share Document