A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Proposes a new method to describe graph vertex features using characteristic functions.
ADMP-GNN dynamically adjusts message-passing layers for better graph learning performance.
In this paper, we show that a simple coloring scheme can improve, both theoretically and empirically, the expressive power of Message Passing Neural Networks(MPNNs). More specifically, we introduce a graph neural network called Colored Local Iterative Procedure (CLIP) that uses colors to disambiguate identical node att…
New framework for dense weighted networks with community-specific patterns.
Meta-ensemble scheme allocates queries to EC nodes for reduced latency.
New decentralized KRR algorithm adapts to node-specific data.
In this study, we investigate the evolution of Chinese guarantee networks from the angle of sub-patterns. First, we find that the mutual, 2-out-stars and triangle sub-patterns are motifs in 2- and 3-node subgraphs. Considering the heterogeneous financial characteristics of nodes, we find that small firms tend to form a…
Augments GNNs with diversification to preserve node identity.
SyNGLER generates synthetic networks efficiently while preserving key structural properties.
Persona2vec learns multiple node roles in graphs.
Improves decentralized learning by teleporting active nodes for better convergence.
BGNN improves GNN by modeling interactions between neighbor nodes.
A new model for graph sampling that preserves structure without explicit targeting.
We propose a dynamic network model where two mechanisms control the probability of a link between two nodes: (i) the existence or absence of this link in the past, and (ii) node-specific latent variables (dynamic fitnesses) describing the propensity of each node to create links. Assuming a Markov dynamics for both mech…
A new method for efficient structural node embeddings using Von Neumann entropy.
Bayesian Optimization for graph node subset functions.
How can we estimate the importance of nodes in a knowledge graph (KG)? A KG is a multi-relational graph that has proven valuable for many tasks including question answering and semantic search. In this paper, we present GENI, a method for tackling the problem of estimating node importance in KGs, which enables several …
Proposes RNNE for dynamic network embedding.
A new method learns node embeddings for signed directed networks by capturing both first-order and high-order topologies.
Network-assisted regression uses conformal prediction for valid inference.
IMPaCT improves node classification in chronological split temporal graphs.
GTEA learns node representations in temporal interaction graphs.
In this paper we present a technique for using the bootstrap to estimate the operating characteristics and their variability for certain types of ensemble methods. Bootstrapping a model can require a huge amount of work if the training data set is large. Fortunately in many cases the technique lets us determine the eff…
This paper presents the first topological analysis of the economic structure of an entire country based on payments data obtained from Swedbank. This data set is exclusive in its kind because around 80% of Estonia's bank transactions are done through Swedbank, hence, the economic structure of the country can be reconst…
Improved graph attention model for noisy graphs.
In this paper, we exploit minimal sensing information gathered from biologically inspired sensor networks to perform exploration and mapping in an unknown environment. A probabilistic motion model of mobile sensing nodes, inspired by motion characteristics of cockroaches, is utilized to extract weak encounter informati…
Graph learning method improves brain state classification.
iGCL preserves graph semantics in latent space augmentations.
A tree-based dictionary learning model is developed for joint analysis of imagery and associated text. The dictionary learning may be applied directly to the imagery from patches, or to general feature vectors extracted from patches or superpixels (using any existing method for image feature extraction). Each image is …
AGE improves graph embedding by smoothing features and iteratively enhancing node embeddings.
Estimates mean of distributed vectors with sparsification and spatial/temporal correlations.
Network embedding leverages the node proximity manifested to learn a low-dimensional node vector representation for each node in the network. The learned embeddings could advance various learning tasks such as node classification, network clustering, and link prediction. Most, if not all, of the existing works, are ove…
P2P lending activities have grown rapidly and have caused the huge and complex networks of debtor-creditor relationships. The aim of this study was to study the underlying structural characteristics of networks formed by debtor-creditor relationships. According attributes of P2P lending, this paper model the networks o…
GG-SAGE predicts links in directed graphs with attributes, outperforming existing methods.
CUQ-GNN adapts uncertainty quantification for graph data, improving on GPN.
Deep learning models for graphs have achieved strong performance for the task of node classification. Despite their proliferation, currently there is no study of their robustness to adversarial attacks. Yet, in domains where they are likely to be used, e.g. the web, adversaries are common. Can deep learning models for …
Develops a new causal model for path-dependent link prediction.
A new federated learning method speeds up training by selecting faster nodes first.
A recently proposed methodology called the Horizontal Visibility Graph (HVG) [Luque {\it et al.}, Phys. Rev. E., 80, 046103 (2009)] that constitutes a geometrical simplification of the well known Visibility Graph algorithm [Lacasa {\it et al.\/}, Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to study the dis…
The (variational) graph auto-encoder and its variants have been popularly used for representation learning on graph-structured data. While the encoder is often a powerful graph convolutional network, the decoder reconstructs the graph structure by only considering two nodes at a time, thus ignoring possible interaction…
General Motors or a local business, which one is better to be stimulated in post-crisis recessions, where government stimulation is meant to overcome recessions? Due to the budget constraints, it is quite relevant to ask how one can increase the chance of economic recovery. One of the key elements to answer this questi…
H-holomorphic maps are a parameter version of J-holomorphic maps into contact manifolds. They have arisen in efforts to prove the existence of higher--genus holomorphic open book decompositions and efforts to prove the existence of finite energy foliations and the Weinstein conjecture, as well as in folded holomorphic …
Decision forests are widely used for classification and regression tasks. A lesser known property of tree-based methods is that one can construct a proximity matrix from the tree(s), and these proximity matrices are induced kernels. While there has been extensive research on the applications and properties of kernels, …
Development of efficient business process models and determination of their characteristic properties are subject of intense interdisciplinary research. Here, we consider a business process model as a directed graph. Its nodes correspond to the units identified by the modeler and the link direction indicates the causal…
Systemic risks of default contagion in the Russian interbank market are investigated. The analysis is based on considering the bow-tie structure of the weighted oriented graph describing the structure of the interbank loans. A probabilistic model of interbank contagion explicitly taking into account the empirical bow-t…
A challenging problem in complex networks is the network reconstruction problem from data. This work deals with a class of networks denoted as conserved networks, in which a flow associated with every edge and the flows are conserved at all non-source and non-sink nodes. We propose a novel polynomial time algorithm to …
AutoLL uses neural networks to automatically reorder graph nodes for linear layouts.
Futures trading is the core of futures business, and it is considered as one of the typical complex systems. To investigate the complexity of futures trading, we employ the analytical method of complex networks. First, we use real trading records from the Shanghai Futures Exchange to construct futures trading networks,…