From the connectivity index to various Randić-type descriptors

Y Ma, Y Shi, I Gutman, B Furtula - MATCH Communications in …, 2018 - scidar.kg.ac.rs
The Randić index was proposed by Randić in 1975 and has been widely studied in different
areas. We briefly review the Randić index and various Randić-type descriptors from 1975 to …

Interdisciplinary and physics challenges of network theory

G Bianconi - Europhysics Letters, 2015 - iopscience.iop.org
Network theory has unveiled the underlying structure of complex systems such as the
Internet or the biological networks in the cell. It has identified universal properties of complex …

Characterisation of the idiotypic immune network through persistent entropy

M Rucco, F Castiglione, E Merelli, M Pettini - Proceedings of ECCS 2014 …, 2016 - Springer
In the present work we intend to investigate how to detect the behaviour of the immune
system reaction to an external stimulus in terms of phase transitions. The immune model …

Permutation entropy for graph signals

JS Fabila-Carrasco, C Tan… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Entropy metrics (for example, permutation entropy) are nonlinear measures of irregularity in
time series (one-dimensional data). Some of these entropy metrics can be generalised to …

Modeling systemic risk with Markov switching graphical SUR models

D Bianchi, M Billio, R Casarin, M Guidolin - Journal of econometrics, 2019 - Elsevier
Abstract We propose a Markov Switching Graphical Seemingly Unrelated Regression (MS-
GSUR) model to investigate time-varying systemic risk based on a range of multi-factor asset …

QBER: Quantum-based Entropic Representations for un-attributed graphs

L Cui, M Li, L Bai, Y Wang, J Li, Y Wang, Z Li, Y Chen… - Pattern Recognition, 2024 - Elsevier
In this paper, we propose a novel framework of computing the Quantum-based Entropic
Representations (QBER) for un-attributed graphs, through the Continuous-time Quantum …

Ensemble manifold rank preserving for acceleration-based human activity recognition

D Tao, L **, Y Yuan, Y Xue - IEEE transactions on neural …, 2014 - ieeexplore.ieee.org
With the rapid development of mobile devices and pervasive computing technologies,
acceleration-based human activity recognition, a difficult yet essential problem in mobile …

On the von Neumann entropy of graphs

G Minello, L Rossi, A Torsello - Journal of Complex Networks, 2019 - academic.oup.com
The von Neumann entropy of a graph is a spectral complexity measure that has recently
found applications in complex networks analysis and pattern recognition. Two variants of the …

Principle of relevant information for graph sparsification

S Yu, F Alesiani, W Yin, R Jenssen… - Uncertainty in …, 2022 - proceedings.mlr.press
Graph sparsification aims to reduce the number of edges of a graph while maintaining its
structural properties. In this paper, we propose the first general and effective information …

Approximate von Neumann entropy for directed graphs

C Ye, RC Wilson, CH Comin, LF Costa, ER Hancock - Physical Review E, 2014 - APS
In this paper, we develop an entropy measure for assessing the structural complexity of
directed graphs. Although there are many existing alternative measures for quantifying the …