Related papers: Visibility graphs and symbolic dynamics
In order to extract correlation information inherited in stochastic time series, the visibility graph algorithm has been recently proposed, by which a time series can be mapped onto a complex network. We demonstrate that the visibility…
The goal of the thesis is to leverage fast graph algorithms and modern algorithmic techniques for problems in model checking and synthesis on graphs, MDPs, and game graphs. The results include symbolic algorithms, a well-known class of…
In this contribution we study the onset of chaos via type-II intermittency within the framework of Horizontal Visibility graph theory. We construct graphs associated to time series generated by an iterated map close to a Neimark-Sacker…
Graph based entropy, an index of the diversity of events in their distribution to parts of a co-occurrence graph, is proposed for detecting signs of structural changes in the data that are informative in explaining latent dynamics of…
A new conceptual foundation for the notion of "information" is proposed, based on the concept of a "distinction graph": a graph in which two nodes are connected iff they cannot be distinguished by a particular observer. The "graphtropy" of…
Hierarchies are of fundamental interest in both stochastic optimal control and biological control due to their facilitation of a range of desirable computational traits in a control algorithm and the possibility that they may form a core…
In this work, we investigate the analysis of generators for dynamic graphs, which are defined as graphs whose topology changes over time. We introduce a novel concept, called ''sustainability,'' to qualify the long-term evolution of dynamic…
In this brief paper, a simple and fast computational method, the Planar Visibility Graph Networks Algorithm was proposed based on the famous Visibility Graph Algorithm, which can fulfill converting two dimensional timeseries into a planar…
The central nervous system is composed of many individual units -- from cells to areas -- that are connected with one another in a complex pattern of functional interactions that supports perception, action, and cognition. One natural and…
A Horizontal Visibility Graph (HVG) is a simple graph extracted from an ordered sequence of real values, and this mapping has been used to provide a combinatorial encryption of time series for the task of performing network based time…
Graphs are often used to model relationships between entities. The identification and visualization of clusters in graphs enable insight discovery in many application areas, such as life sciences and social sciences. Force-directed graph…
A visibility algorithm maps time series into complex networks following a simple criterion. The resulting visibility graph has recently proven to be a powerful tool for time series analysis. However its straightforward computation is…
A \emph{temporal graph} is, informally speaking, a graph that changes with time. When time is discrete and only the relationships between the participating entities may change and not the entities themselves, a temporal graph may be viewed…
Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental…
Mutual visibility in graphs requires pairs of vertices to be connected by shortest paths that avoid all other vertices of a prescribed set, a condition that is often overly restrictive. In this paper, we introduce a new variant, called…
In this paper we consider aspects of geometric observability for hypergraphs, extending our earlier work from the uniform to the nonuniform case. Hypergraphs, a generalization of graphs, allow hyperedges to connect multiple nodes and…
Block graphs are graphs in which every block (biconnected component) is a clique. A graph $G=(V,E)$ is said to be an (unpartitioned) $k$-probe block graph if there exist $k$ independent sets $N_i\subseteq V$, $1\le i\le k$, such that the…
We present the modification of natural visibility graph (NVG) algorithm used for the mapping of the time series to the complex networks (graphs). We propose the parametric natural visibility graph (PNVG) algorithm. The PNVG consists of NVG…
The spatio-temporal features of the velocity field of a fully-developed turbulent channel flow are investigated through the natural visibility graph (NVG) method, which is able to fully map the intrinsic structure of the time-series into…
Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition…