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.
New model for detecting communities in weighted bipartite networks.
New model for detecting communities in weighted bipartite networks.
New method clusters weighted directed networks using motifs.
Using a model of wealth distribution where traders are characterized by quenched random saving propensities and trade among themselves by bipartite transactions, we mimic the enhanced rates of trading of the rich by introducing the preferential selection rule using a pair of continuously tunable parameters. The biparti…
Improved text summarization using belief propagation on weighted bipartite graphs.
We present a new approach to understanding credit relationships between commercial banks and quoted firms, and with this approach, examine the temporal change in the structure of the Japanese credit network from 1980 to 2005. At each year, the credit network is regarded as a weighted bipartite graph where edges corresp…
We propose a Bayesian methodology for one-mode projecting a bipartite network that is being observed across a series of discrete time steps. The resulting one mode network captures the uncertainty over the presence/absence of each link and provides a probability distribution over its possible weight values. Additionall…
Formula for weight system on complete bipartite graphs.
Bipartite networks are a common type of network data in which there are two types of vertices, and only vertices of different types can be connected. While bipartite networks exhibit community structure like their unipartite counterparts, existing approaches to bipartite community detection have drawbacks, including im…
Reconstructing patterns of interconnections from partial information is one of the most important issues in the statistical physics of complex networks. A paramount example is provided by financial networks. In fact, the spreading and amplification of financial distress in capital markets is strongly affected by the in…
A new method identifies similar mutual funds using graph learning.
In this work an iterative algorithm based on unsupervised learning is presented, specifically on a Restricted Boltzmann Machine (RBM) to solve a perfect matching problem on a bipartite weighted graph. Iteratively is calculated the weights and the bias parameters that maximize the energy funct…
A biclustering algorithm finds dense disjoint subgraphs in weighted bipartite graphs.
A new SBM for bipartite networks improves community detection in noisy data.
New method embeds bipartite graphs into vectors, overcoming nonlinear challenges.
The paper calculates a specific weight system for chord diagrams with a particular graph structure.
A new model detects common patterns in pollination networks.
Develops a new variational estimator for node popularity in bipartite networks.
New method for matching bipartite and unipartite graphs without collapsing.
Recent years have witnessed a widespread increase of interest in network representation learning (NRL). By far most research efforts have focused on NRL for homogeneous networks like social networks where vertices are of the same type, or heterogeneous networks like knowledge graphs where vertices (and/or edges) are of…
Improved bipartite link prediction using 2-hop paths.
Neural execution solves complex graph problems like bipartite matching.
Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade network…
In this paper we analyse the bipartite Colombian firms-products network, throughout a period of five years, from 2010 to 2014. Our analysis depicts a strongly modular system, with several groups of firms specializing in the export of specific categories of products. These clusters have been detected by running the bipa…
A growing number of systems are represented as networks whose architecture conveys significant information and determines many of their properties. Examples of network architecture include modular, bipartite, and core-periphery structures. However inferring the network structure is a non trivial task and can depend som…
Proposes TNPM for better node popularity in directed and bipartite networks.
Improved model for grouping nodes in bipartite networks.
We detect the backbone of the weighted bipartite network of the Japanese credit market relationships. The backbone is detected by adapting a general method used in the investigation of weighted networks. With this approach we detect a backbone that is statistically validated against a null hypothesis of uniform diversi…
This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of perfect matchings (or dimers) of this graph. The weights are Tutte'…
Community detection or clustering is a fundamental task in the analysis of network data. Many real networks have a bipartite structure which makes community detection challenging. In this paper, we consider a model which allows for matched communities in the bipartite setting, in addition to node covariates with inform…
Bipartite networks are currently regarded as providing a major insight into the organization of many real-world systems, unveiling the mechanisms driving the interactions occurring between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain…
This article proposes a method to quantify the structure of a bipartite graph using a network entropy per link. The network entropy of a bipartite graph with random links is calculated both numerically and theoretically. As an application of the proposed method to analyze collective behavior, the affairs in which parti…
Bipartite graphs have been used to represent data relationships in many data-mining applications such as in E-commerce recommendation systems. Since learning in graph space is more complicated than in Euclidian space, recent studies have extensively utilized neural nets to effectively and efficiently embed a graph's no…
Graph neural networks speed up nonnegative matrix factorization.
Bipartite networks provide an insightful representation of many systems, ranging from mutualistic networks of species interactions to investment networks in finance. The analysis of their topological structures has revealed the ubiquitous presence of properties which seem to characterize many - apparently different - s…
A new method for neural network initialization using graph degeneracy.
Study explores properties of bipartite knots.
Bipartite data is common in data engineering and brings unique challenges, particularly when it comes to clustering tasks that impose on strong structural assumptions. This work presents an unsupervised method for assessing similarity in bipartite data. Similar to some co-clustering methods, the method is based on regu…
New method extends knot theory to non-bipartite knots, revealing PDs.
Simplified Khovanov polynomials for bipartite links.
Algorithm distinguishes Gaussian mixtures from pure Gaussians in quasi-polynomial time.
The easy access to large data sets has allowed for leveraging methodology in network physics and complexity science to disentangle patterns and processes directly from the data, leading to key insights in the behavior of systems. Here we use to country specific food production data to study binary and weighted topologi…
The topological properties of interbank networks have been discussed widely in the literature mainly because of their relevance for systemic risk. Here we propose to use the Stochastic Block Model to investigate and perform a model selection among several possible two block organizations of the network: these include b…
Framework for inferring latent structure from sparse, imperfectly detected bipartite networks.
Conditional restricted Boltzmann machines are undirected stochastic neural networks with a layer of input and output units connected bipartitely to a layer of hidden units. These networks define models of conditional probability distributions on the states of the output units given the states of the input units, parame…
The latent block model (LBM) is a flexible probabilistic tool to describe interactions between node sets in bipartite networks, but it does not account for interactions of time varying intensity between nodes in unknown classes. In this paper we propose a non stationary temporal extension of the LBM that clusters simul…
New research finds six bipartite intrinsically knotted graphs with 23 edges.
Simplified Khovanov-Rozansky calculus for bipartite knots.