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.
Non-local GNNs improve performance on disassortative graphs.
Graph Neural Networks (GNNs) have proved to be an effective representation learning framework for graph-structured data, and have achieved state-of-the-art performance on many practical predictive tasks, such as node classification, link prediction and graph classification. Among the variants of GNNs, Graph Attention N…
Attributed network embedding has attracted plenty of interest in recent years. It aims to learn task-independent, low-dimensional, and continuous vectors for nodes preserving both topology and attribute information. Most of the existing methods, such as random-walk based methods and GCNs, mainly focus on the local info…
New method handles structural uncertainty in graphs better than existing models.
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…
Geom-GCN improves graph neural networks by preserving structural information and capturing long-range dependencies.
New models capture heterogeneous network density, improving community detection.
Extract common latent factors from graphs for better representation learning.
A probabilistic framework is introduced that represents stylized banking networks and aims to predict the size of contagion events. In contrast to previous work on random financial networks, which assumes independent connections between banks, the possibility of disassortative edge probabilities (an above average tende…
This paper studies the topological properties of the World Trade Web (WTW) and its evolution over time by employing a weighted network analysis. We show that the WTW, viewed as a weighted network, displays statistical features that are very different from those obtained by using a traditional binary-network approach. I…
We study a novel economic network (supply chain) comprised of wire transfers (electronic payment transactions) among the universe of firms in Brazil (6.2 million firms). We construct a directed and weighted network in which vertices represent cities and edges connote pairwise economic dependence between cities. Cities …
In all empirical-network studies, the observed properties of economic networks are informative only if compared with a well-defined null model that can quantitatively predict the behavior of such properties in constrained graphs. However, predictions of the available null-model methods can be derived analytically only …
SDP approach recovers communities in multilayer hypergraphs from aggregated similarity matrices.
Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption that instances of the same class link to each other (assortativity assumption).…
We conduct a market experiment with human agents in order to explore the structure of transaction networks and to study the dynamics of wealth accumulation. The experiment is carried out on our platform for 97 days with 2,095 effective participants and 16,936 times of transactions. From these data, the hybrid distribut…
In many networks, vertices have hidden attributes, or types, that are correlated with the networks topology. If the topology is known but these attributes are not, and if learning the attributes is costly, we need a method for choosing which vertex to query in order to learn as much as possible about the attributes of …
New model improves community detection in networks with strong assortativity.
Being among the easiest ways to find meaningful structure from discrete data, Latent Dirichlet Allocation (LDA) and related component models have been applied widely. They are simple, computationally fast and scalable, interpretable, and admit nonparametric priors. In the currently popular field of network modeling, re…
Evaluation of systemic risk in networks of financial institutions in general requires information of inter-institution financial exposures. In the framework of Debt Rank algorithm, we introduce an approximate method of systemic risk evaluation which requires only node properties, such as total assets and liabilities, a…
In many real-world networks, nodes have class labels, attributes, or variables that affect the network's topology. If the topology of the network is known but the labels of the nodes are hidden, we would like to select a small subset of nodes such that, if we knew their labels, we could accurately predict the labels of…
Inter-firm organizations, which play a driving role in the economy of a country, can be represented in the form of a customer-supplier network. Such a network exhibits a heavy-tailed degree distribution, disassortative mixing and a prominent community structure. We analyze a large-scale data set of customer-supplier re…
In bipartite networks, community structures are restricted to being disassortative, in that nodes of one type are grouped according to common patterns of connection with nodes of the other type. This makes the stochastic block model (SBM), a highly flexible generative model for networks with block structure, an intuiti…
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,…
We provide an empirical investigation aimed at uncovering the statistical properties of intricate stock trading networks based on the order flow data of a highly liquid stock (Shenzhen Development Bank) listed on Shenzhen Stock Exchange during the whole year of 2003. By reconstructing the limit order book, we can extra…
Cryptocurrency is a well-developed blockchain technology application that is currently a heated topic throughout the world. The public availability of transaction histories offers an opportunity to analyze and compare different cryptocurrencies. In this paper, we present a dynamic network analysis of three representati…
We consider a model of financial contagion in a bipartite network of assets and banks recently introduced in the literature, and we study the effect of power law distributions of degree and balance-sheet size on the stability of the system. Relative to the benchmark case of banks with homogeneous degrees and balance-sh…
We consider a model of contagion in financial networks recently introduced in the literature, and we characterize the effect of a few features empirically observed in real networks on the stability of the system. Notably, we consider the effect of heterogeneous degree distributions, heterogeneous balance sheet size and…
Many systems of different nature exhibit scale free behaviors. Economic systems with power law distribution in the wealth is one of the examples. To better understand the working behind the complexity, we undertook an empirical study measuring the interactions between market participants. A Web server was setup to admi…
Study examines financial market structure changes during the COVID-19 crash using a novel MI approach.
New model detects hidden group structures in criminal networks.
Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.
Proposes MGMN for end-to-end graph similarity learning.
The paper explores graphons of line graphs from sparse finite graphs.
MxPool learns graph features from diverse graphs using a hierarchical structure.
Study the geometry of graph product extension graphs.
Quasi-transitive graphs quasi-isometric to planar graphs can be upgraded to Cayley graphs.
Customized-GNN generates model-specific for each graph.
Graph embedding leaks sensitive graph properties and subgraphs.
Characterizes graphs with leveled embeddings and introduces new graph invariants.
The paper shows conflict graphs of Petersen family graphs are mostly unbalanced.
Two new methods improve graph embedding without needing a complete graph structure.
We define a pseudo-inverse for line graphs using linear integer programming.
Develops method to create non-Abelian Ricci-flat graphs via bundles.
New method uses graph generative models for graph classification.
MathNet uses wavelets for graph representation and learning.
Unified framework for graph coarsening using node features and graph matrices.
A fast graph embedding method for large graphs.
Quadratic bounds found for graph dimensions.