Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

2795588371,116 · Jun 202019922001200920172026
48 results for network-linked data

This paper develops a nonparametric model for complex network data.

problem Capturing conditional independence structure in multivariate data with heterogeneous graph structures.
method Integrates network embedding with nonparametric graphical model estimation, solving a linear equation system.
result The proposed method effectively recovers heterogeneous graph structures without distributional assumptions.

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…

2019-07-04abs ↗pdf ↗

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…

2011-06-14abs ↗pdf ↗

Study variation spaces for neural networks, linking them to approximation theory.

problem Understanding the variation spaces of shallow neural networks.
method Examined variation spaces defined by convex hulls and integral representations for a dictionary of functions.
result Found that Barron space, spectral Barron space, and Radon BV space are variation spaces for certain neural networks.

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…

2014-09-30abs ↗pdf ↗

Paper provides statistical guarantees for GNNs in link prediction.

problem Link prediction accuracy in graph neural networks.
method Proposes a linear GNN architecture (LG-GNN) and derives statistical guarantees.
result LG-GNN produces consistent estimators for edge probabilities and has better detection of high-probability edges.

Using the new data from the OECD-WTO world network of economic activities we construct the Google matrix GG 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 GG, based on Markov chain transitions, treats a…

2015-04-25abs ↗pdf ↗

A new framework predicts links in time-dependent networks using Bernoulli autoregression.

problem Predicting links in time-dependent networks with additional auxiliary information.
method A Bernoulli autoregressive model with regularization for link discovery.
result The model can discover new links not present in the data.

Method learns hierarchical representations of samples and features simultaneously.

problem Hierarchical structures in samples and features not considered by existing methods.
method Jointly learns hierarchical representations via Tree-Wasserstein Distance alternating between samples and features.
result Method improves performance in link prediction and node classification tasks.

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…

2018-02-18abs ↗pdf ↗

PGMs and GNNs differ in capturing network data; PGMs outperform GNNs in noisy and heterophily scenarios.

problem Comparing PGMs and GNNs in network data.
method Link prediction task with synthetic and real networks; three experiments on input features, noise, and heterophily.
result 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…

2018-11-28abs ↗pdf ↗

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…

2015-04-27abs ↗pdf ↗

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…

2019-10-21abs ↗pdf ↗

Using the new data from the OECD-WTO world network of economic activities we construct the Google matrix GG 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 GG, based on Markov chain transi…

2015-07-12abs ↗pdf ↗

Study chaotic dynamics in social stratification models leading to thermalization and turbulence.

problem Understanding social stratification dynamics through chaotic nonlinear systems.
method Modeling social network links with oscillators and energies, studying Hamiltonian evolution and nonlinear interactions.
result Chaotic dynamics leads to dynamical thermalization and Kolmogorov-Zakharov turbulence, with implications for wealth inequality.

Unified framework for measuring concentration in weighted networks considering both weight distributions and network structure.

problem Traditional indices neglect the topology of relationships among network elements.
method Develops a family of topology-aware concentration indices that jointly account for weight distributions and network structure.
result The proposed indices preserve key properties and allow concentration to be evaluated across different dimensions of dependence.

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 …

2016-08-20abs ↗pdf ↗

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…

2016-03-18abs ↗pdf ↗

A novel GNN architecture improves link prediction by combining positive and negative samples.

problem Link prediction accuracy limited by node-wise methods and increased model complexity of edge-wise methods.
method Proposes a novel GNN architecture that uses both positive and negative samples to inform node embeddings.
result The method retains the inference speed of node-wise models while achieving competitive accuracy with edge-wise alternatives.

Feature networks link ML features via graph structure for enhanced learning.

problem Enhancing feature expressiveness and learning efficiency in machine learning.
method Graph representation of feature vectors, leveraging Fourier and functional analysis.
result Feature networks enable novel, complex feature dependencies.

SLiCE learns contextual node embeddings for link prediction in heterogeneous networks.

problem Link prediction requires specific contextual information not captured by static node embeddings.
method Self-supervised pre-training with localized attention mechanisms.
result SLiCE significantly outperforms existing methods on link prediction tasks.

This paper extends ResNet theory to infinitely deep networks, linking them to diffusion processes.

problem Training infinitely deep ResNets with i.i.d. initializations leads to undesirable properties.
method Introduced doubly infinite ResNets with i.i.d. initializations, linking to diffusion processes.
result The dynamics of quantities of interest converge to deterministic limits in the limit of infinite depth.

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,…

2017-12-12abs ↗pdf ↗

Prevents sensitive data generation in diffusion models using labeled and unlabeled data.

problem Generating sensitive data in diffusion models using unlabeled data.
method Positive-Unlabeled Diffusion Models, approximating ELBO with labeled and unlabeled data.
result Prevents the generation of sensitive data without compromising image quality.

Study reveals Data Shapley's inconsistent performance in data selection tasks.

problem Inconsistency of Data Shapley's performance in data selection across different settings.
method Hypothesis testing framework and identification of utility functions.
result Data Shapley's performance is no better than random selection without specific constraints.

PRRO generates synthetic tabular data that improves SL performance and class distribution.

problem Low SL utility of synthetic data due to class imbalance and overlooked data relationships.
method Data pruning and column reordering to optimize SL utility.
result Synthetic data generated with PRRO enhances predictive performance and class distribution.

Defines data science as a natural ecosystem with challenges and missions.

problem Challenges and missions in data science due to 5D complexities and data life cycle phases.
method Systemic and data-centric view of data science as a fusion of data universe and its challenges, formalizing a general-purpose architecture.
result Essential data science as a natural ecosystem integrating specific disciplines and high-impact applications.