This paper develops a nonparametric model for complex network data.
arXiv research
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.
Trend · papers per month
Nodes in real world networks often have class labels, or underlying attributes, that are related to the way in which they connect to other nodes. Sometimes this relationship is simple, for instance nodes of the same class are may be more likely to be connected. In other cases, however, this is not true, and the way tha…
In this paper, we explore salient questions about user interests, conversations and friendships in the Facebook social network, using a novel latent space model that integrates several data types. A key challenge of studying Facebook's data is the wide range of data modalities such as text, network links, and categoric…
We apply the recently developed reduced Google matrix algorithm for the analysis of the OECD-WTO world network of economic activities. This approach allows to determine interdependences and interactions of economy sectors of several countries, including China, Russia and USA, properly taking into account the influence …
Predicting the future evolution of complex systems is one of the main challenges in complexity science. Based on a current snapshot of a network, link prediction algorithms aim to predict its future evolution. We apply here link prediction algorithms to data on the international trade between countries. This data can b…
Graphical models are commonly used to represent conditional dependence relationships between variables. There are multiple methods available for exploring them from high-dimensional data, but almost all of them rely on the assumption that the observations are independent and identically distributed. At the same time, o…
Many networks are complex dynamical systems, where both attributes of nodes and topology of the network (link structure) can change with time. We propose a model of co-evolving networks where both node at- tributes and network structure evolve under mutual influence. Specifically, we consider a mixed membership stochas…
The robustness and integrity of IP networks require efficient tools for traffic monitoring and analysis, which scale well with traffic volume and network size. We address the problem of optimal large-scale flow monitoring of computer networks under resource constraints. We propose a stochastic optimization framework wh…
Renormalization in neural networks linked to quantum field theory.
Study variation spaces for neural networks, linking them to approximation theory.
As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has…
Paper provides statistical guarantees for GNNs in link prediction.
Using the new data from the OECD-WTO world network of economic activities we construct the Google matrix of this directed network and perform its detailed analysis. The network contains 58 countries and 37 activity sectors for years 1995 and 2008. The construction of , based on Markov chain transitions, treats a…
NPGNN improves graph link prediction by adapting to new graphs.
A new framework predicts links in time-dependent networks using Bernoulli autoregression.
A framework for multilayer networks predicts links without shared structures.
Method learns hierarchical representations of samples and features simultaneously.
The ConditionaL Neural Networks (CLNN) and the Masked ConditionaL Neural Networks (MCLNN) exploit the nature of multi-dimensional temporal signals. The CLNN captures the conditional temporal influence between the frames in a window and the mask in the MCLNN enforces a systematic sparseness that follows a filterbank-lik…
PGMs and GNNs differ in capturing network data; PGMs outperform GNNs in noisy and heterophily scenarios.
Data collection often involves the partial measurement of a larger system. A common example arises in collecting network data: we often obtain network datasets by recording all of the interactions among a small set of core nodes, so that we end up with a measurement of the network consisting of these core nodes along w…
Bayesian max-margin models have shown superiority in various practical applications, such as text categorization, collaborative prediction, social network link prediction and crowdsourcing, and they conjoin the flexibility of Bayesian modeling and predictive strengths of max-margin learning. However, Monte Carlo sampli…
A graph-based sampling and consensus (GraphSAC) approach is introduced to effectively detect anomalous nodes in large-scale graphs. Existing approaches rely on connectivity and attributes of all nodes to assign an anomaly score per node. However, nodal attributes and network links might be compromised by adversaries, r…
Novel method learns time series dynamics without reconstruction.
Using the new data from the OECD-WTO world network of economic activities we construct the Google matrix of this directed network and perform its detailed analysis. The network contains 58 countries and 37 activity sectors for years 1995, 2000, 2005, 2008, 2009. The construction of , based on Markov chain transi…
From the perspective of network analysis, the ubiquitous networks are comprised of regular and irregular components, which makes uncovering the complexity of network structures to be a fundamental challenge. Exploring the regular information and identifying the roles of microscopic elements in network data can help us …
Improved bipartite link prediction using 2-hop paths.
Model learns evolving network relationships over time.
Autoencoders identify brain networks linked to stress and genotype.
New heuristics for predicting links in multiplex networks.
Study chaotic dynamics in social stratification models leading to thermalization and turbulence.
BScNets expands graph learning to higher-order interactions.
Unified framework for measuring concentration in weighted networks considering both weight distributions and network structure.
Across many scientific domains, there is a common need to automatically extract a simplified view or coarse-graining of how a complex system's components interact. This general task is called community detection in networks and is analogous to searching for clusters in independent vector data. It is common to evaluate …
Unified approach compares ERGM, GCN, and Word2Vec+MLP for collaboration network link prediction.
Unified view of spectral networks linking geometry and gauge theory.
The paper extends a spectral evolution model for link prediction in evolving networks.
A new method predicts links better across various networks.
Common asset holding by financial institutions, namely portfolio overlap, is nowadays regarded as an important channel for financial contagion with the potential to trigger fire sales and thus severe losses at the systemic level. In this paper we propose a method to assess the statistical significance of the overlap be…
A novel GNN architecture improves link prediction by combining positive and negative samples.
Feature networks link ML features via graph structure for enhanced learning.
SLiCE learns contextual node embeddings for link prediction in heterogeneous networks.
Real-world complex networks describe connections between objects; in reality, those objects are often endowed with some kind of features. How does the presence or absence of such features interplay with the network link structure? Although the situation here described is truly ubiquitous, there is a limited body of res…
This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.
Big data sets must be carefully partitioned into statistically similar data subsets that can be used as representative samples for big data analysis tasks. In this paper, we propose the random sample partition (RSP) data model to represent a big data set as a set of non-overlapping data subsets, called RSP data blocks,…
Prevents sensitive data generation in diffusion models using labeled and unlabeled data.
Study reveals Data Shapley's inconsistent performance in data selection tasks.
PRRO generates synthetic tabular data that improves SL performance and class distribution.
Defines data science as a natural ecosystem with challenges and missions.