Related papers: Topological analysis of entropy measure using regr…
We characterize different cell states, related to cancer and ageing phenotypes, by a measure of entropy of network ensembles, integrating gene expression values and protein interaction networks. The entropy measure estimates the parameter…
Aptamers are single stranded DNA, RNA or peptide sequences having the ability to bind a variety of specific targets (proteins, molecules as well as ions). Therefore, aptamer production and selection for therapeutic and diagnostic…
Let $G=(V(G),E(G))$ be a molecular graph, where $V(G)$ and $E(G)$ are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quantity which helps to predict the chemical/physical properties…
We introduce a novel gauge-invariant, quantized interband index in two-dimensional (2D) multiband systems. It provides a bulk topological classification of a submanifold of parameter space (e.g., an electron valley in a Brillouin zone), and…
Topology is a powerful tool for categorizing magnetization textures by defining a topological index in both two-dimensional (2D) systems, such as thin films or curved surfaces, and in 3D bulk systems. In the emerging field of 3D…
In theoretical chemistry molecular structure descriptors are used for modeling physico-chemical, pharmacological, toxicologic, biological and other properties of chemical compounds. In this paper we study distance-based graph invariants and…
Calculation of topological order parameters, such as the topological entropy and topological mutual information, are used to determine whether states possess topological order. Their calculation is expected to give reliable results when the…
Conformational entropy for atomic-level, three dimensional biomolecules is known experimentally to play an important role in protein-ligand discrimination, yet reliable computation of entropy remains a difficult problem. Here we describe…
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of…
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…
Topological data analysis (TDA) is an emerging mathematical concept for characterizing shapes in complex data. In TDA, persistence diagrams are widely recognized as a useful descriptor of data, and can distinguish robust and noisy…
In this paper, topological indices play a significant role in the analysis of caterpillar trees, especially due to their applications in chemical graph theory. We presented a study on topological indices related to the Sigma index, which we…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
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…
Geometry-inspired measures (such as discrete Ricci curvatures) and topological data analysis (TDA) based methods (such as persistent homology) have become attractive tools for characterizing the higher-order structure of networks…
We compare two calculations of the particle density in the superfluid phase of the classical XY model with a chemical potential $\mu$ in 1+1 dimensions.The first relies on exact blocking formulas from the Tensor Renormalization Group (TRG)…
Complexity measures are essential to understand complex systems and there are numerous definitions to analyze one-dimensional data. However, extensions of these approaches to two or higher-dimensional data, such as images, are much less…
We use topological data analysis as a tool to analyze the fit of mathematical models to experimental data. This study is built on data obtained from motion tracking groups of aphids in [Nilsen et al., PLOS One, 2013] and two random walk…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.
Understanding the structural complexity and predictability of complex networks is a central challenge in network science. Although recent studies have revealed a relationship between compression-based entropy and link prediction…