Graph kernel neural networks
The convolution operator at the core of many modern neural architectures can effectively be
seen as performing a dot product between an input matrix and a filter. While this is readily …
seen as performing a dot product between an input matrix and a filter. While this is readily …
Entropic dynamic time warping kernels for co-evolving financial time series analysis
Network representations are powerful tools to modeling the dynamic time-varying financial
complex systems consisting of multiple co-evolving financial time series, eg, stock prices. In …
complex systems consisting of multiple co-evolving financial time series, eg, stock prices. In …
A quantum-inspired similarity measure for the analysis of complete weighted graphs
We develop a novel method for measuring the similarity between complete weighted
graphs, which are probed by means of the discrete-time quantum walks. Directly probing …
graphs, which are probed by means of the discrete-time quantum walks. Directly probing …
Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian
BM F de Resende, LF Costa - Chaos: an interdisciplinary journal of …, 2020 - pubs.aip.org
In this paper, we investigated the possibility of using the magnetic Laplacian to characterize
directed networks. We address the problem of characterization of network models and …
directed networks. We address the problem of characterization of network models and …
Time-varying group lasso Granger causality graph for high dimensional dynamic system
W Gao, H Yang - Pattern Recognition, 2022 - Elsevier
Feature selection is a crucial preprocessing step in data analysis and machine learning.
Since causal relationships imply the underlying mechanism of a system, causality-based …
Since causal relationships imply the underlying mechanism of a system, causality-based …
Graph motif entropy for understanding time-evolving networks
The structure of networks can be efficiently represented using motifs, which are those
subgraphs that recur most frequently. One route to understanding the motif structure of a …
subgraphs that recur most frequently. One route to understanding the motif structure of a …
Spin statistics, partition functions and network entropy
This article explores the thermodynamic characterization of networks using the heat bath
analogy when the energy states are occupied under different spin statistics, specified by a …
analogy when the energy states are occupied under different spin statistics, specified by a …
Thermodynamic motif analysis for directed stock market networks
In this paper, we present a novel thermodynamically based analysis method for directed
networks, and in particular for time-evolving networks in the finance domain. Based on an …
networks, and in particular for time-evolving networks in the finance domain. Based on an …
Statistical mechanical analysis for unweighted and weighted stock market networks
Financial markets are time-evolving complex systems containing different financial entities,
such as banks, corporations and institutions that interact through transactions and respond …
such as banks, corporations and institutions that interact through transactions and respond …
Labeled subgraph entropy kernel
C Sun, X Ai, Z Zhang, ER Hancock - arXiv preprint arXiv:2303.13543, 2023 - arxiv.org
In recent years, kernel methods are widespread in tasks of similarity measuring. Specifically,
graph kernels are widely used in fields of bioinformatics, chemistry and financial data …
graph kernels are widely used in fields of bioinformatics, chemistry and financial data …