150 research outputs found
Correlation of Automorphism Group Size and Topological Properties with Program-size Complexity Evaluations of Graphs and Complex Networks
We show that numerical approximations of Kolmogorov complexity (K) applied to
graph adjacency matrices capture some group-theoretic and topological
properties of graphs and empirical networks ranging from metabolic to social
networks. That K and the size of the group of automorphisms of a graph are
correlated opens up interesting connections to problems in computational
geometry, and thus connects several measures and concepts from complexity
science. We show that approximations of K characterise synthetic and natural
networks by their generating mechanisms, assigning lower algorithmic randomness
to complex network models (Watts-Strogatz and Barabasi-Albert networks) and
high Kolmogorov complexity to (random) Erdos-Renyi graphs. We derive these
results via two different Kolmogorov complexity approximation methods applied
to the adjacency matrices of the graphs and networks. The methods used are the
traditional lossless compression approach to Kolmogorov complexity, and a
normalised version of a Block Decomposition Method (BDM) measure, based on
algorithmic probability theory.Comment: 15 2-column pages, 20 figures. Forthcoming in Physica A: Statistical
Mechanics and its Application
Connections between Classical and Parametric Network Entropies
This paper explores relationships between classical and parametric measures of graph (or network) complexity. Classical measures are based on vertex decompositions induced by equivalence relations. Parametric measures, on the other hand, are constructed by using information functions to assign probabilities to the vertices. The inequalities established in this paper relating classical and parametric measures lay a foundation for systematic classification of entropy-based measures of graph complexity
Graphlet Correlations for Network Comparison and Modelling: World Trade Network Example
We propose methods on two fundamental graph theoretic problems: (1) network comparison, and (2) network modelling. Our methods are applied to five real-world network types, with an emphasis on world trade networks (WTNs), which we choose due to the world's current economic crisis.
Finding topological similarities of complex networks is computationally intractable due to NP-Completeness of the subgraph isomorphism problem. Hence, simple heuristics have been used for this purpose. The most sophisticated heuristics are based on graph spectra and small subnetworks including graphlets. Among these, graphlets are preferred since spectra do not provide a direct real-world interpretation of network structure. However, current graphlet-based techniques can be improved. We improve graphlet-based heuristics by defining a new network topology descriptor, Graphlet Correlation Matrix (GCM), which eliminates all redundancies and quantifies the dependencies in graphlet properties. Then, we introduce a new network distance measure, Graphlet Correlation Distance (GCD), that compares GCMs of two networks. We show that GCD has the best network classification performance, is highly noise-tolerant, and is computationally efficient. Using this methodology, we highlight a three-layer organization in the WTNs: core, broker, and periphery. Furthermore, we uncover the link between the dynamic changes in oil price and trade network topology.
Network models should shed light on the rules governing the formation of real networks. Using GCD, we identify models that fit five real-world network types. However, none of these standard network models fit WTNs. Hence, we introduce two new network models: one that mimics the Gravity Model of Trade, and the other that mimics brokerage / peripheral positioning of a country in WTN. Also, we show that economic wealth indicators of a country are predictive of its future brokerage position. Finally, we use exponential-family random graph modelling approach to build a generic framework that enables modelling based on any graphlet property.Open Acces
Cellular automata with complicated dynamics
A subshift is a collection of bi-infinite sequences (configurations) of symbols where some finite patterns of symbols are forbidden to occur. A cellular automaton is a transformation that changes each configuration of a subshift into another one by using a finite look-up table that tells how any symbol occurring at any possible context is to be changed. A cellular automaton can be applied repeatedly on the configurations of the subshift, thus making it a dynamical system.
This thesis focuses on cellular automata with complex dynamical behavior, with some different definitions of the word “complex”. First we consider a naturally occurring class of cellular automata that we call multiplication automata and we present a case study with the point of view of symbolic, topological and measurable dynamics. We also present an application of these automata to a generalized version of Mahler’s problem.
For different notions of complex behavior one may also ask whether a given subshift or class of subshifts has a cellular automaton that presents this behavior. We show that in the class of full shifts the Lyapunov exponents of a given reversible cellular automaton are uncomputable. This means that in the dynamics of reversible cellular automata the long term maximal propagation speed of a perturbation made in an initial configuration cannot be determined in general from short term observations.
In the last part we construct, on all mixing sofic shifts, diffusive glider cellular automata that can decompose any finite configuration into two distinct components that shift into opposing direction under repeated action of the automaton. This implies that every mixing sofic shift has a reversible cellular automaton all of whose directions are sensitive in the sense of the definition of Sablik. We contrast this by presenting a family of synchronizing subshifts on which all reversible cellular automata always have a nonsensitive direction
An assessment of gene regulatory network inference algorithms
A conceptual issue regarding gene regulatory network (GRN) inference algorithms is establishing their validity or correctness. In this study, we argue that for this purpose it is useful to conceive these algorithms as estimators of graph-valued parameters of explicit models for gene expression data. On this basis, we perform an assessment of a selection of influential GRN inference algorithms as estimators for two types of models: (i) causal graphs with associated structural equations models (SEMs), and (ii) differential equations models based on the thermodynamics of gene expression. Our findings corroborate that networks of marginal dependence fail in estimating GRNs, but they also suggest that the strength of statistical association as measured by mutual information may be indicative of GRN structure. Also, in simulations, we find that the GRN inference algorithms GENIE3 and TIGRESS outperform competing algorithms. However, more importantly, we also find that many observed patterns hinge on the GRN topology and the assumed data generating mechanism.Un problema conceptual con respecto a los algoritmos de inferencia de redes de regulaciĂłn gĂ©nica (RRG) es cĂłmo establecer su validez. En este estudio sostenemos que para este objetivo conviene concebir estos algoritmos como estimadores de parámetros de modelos estadĂsticos explĂcitos para datos de expresiĂłn gĂ©nica. Sobre esta base, realizamos una evaluaciĂłn de una selecciĂłn de algoritmos de inferencia de RRG como estimadores para dos tipos de modelos: (i) modelos de grafos causales asociados a modelos de ecuaciones estructurales (MEE), y (ii) modelos de ecuaciones diferenciales basados en la termodinámica de la expresion genica. Nuestros hallazgos corroboran que las redes de dependencias marginales fallan en la estimaciĂłn de las RRG, pero tambiĂ©n sugieren que la fuerza de la asociaciĂłn estadĂstica medida por la informaciĂłn mutua puede reflejar en cierto grado la estructura de las RRG. Además, en un estudio de simulaciones, encontramos que los algoritmos de inferencia GENIE3 y TIGRESS son los de mejor desempeño. Sin embargo, crucialmente, tambiĂ©n encontramos que muchos patrones observados en las simulaciones dependen de la topologĂa de la RRG y del modelo generador de datos.MaestrĂ
- …