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

3446881,0321,376 · Jun 202019922001200920172026
48 results for dynamic network analysis

Network analysis improves stock return forecasting.

problem Improving stock return forecasting using network properties.
method Network analysis of stock return correlations, using individual and global properties of stocks.
result 50% improvement in R2 score for long-term stock returns forecasting, 3% for short-term.

Unified analysis of DLNs using DMFT reveals dynamics of loss convergence and generalization trade-offs.

problem Understanding the overall dynamics of diagonal linear networks (DLNs) in neural network training.
method Dynamical Mean-Field Theory (DMFT) applied to DLNs.
result Derives low-dimensional effective process capturing high-dimensional gradient flow dynamics.

Proposes neural dynamic mode decomposition for end-to-end modeling of nonlinear dynamics.

problem Understanding and modeling nonlinear dynamical systems.
method Trains neural networks to minimize forecast error based on spectral decomposition in the lifted space.
result Demonstrates effectiveness in eigenvalue estimation and forecast performance.

This study uses persistent homology to analyze complex transitional networks from time series data.

problem Lack of effective tools to summarize complex topology in transitional networks.
method Persistent homology from topological data analysis applied to coarse-grained state-space networks (CGSSN).
result CGSSN improves dynamic state detection and noise robustness compared to other methods.

Study analyzes Echo State Network parameters for Rossler attractor dynamics.

problem Understanding the influence of network type on Echo State Network performance.
method Experimental analysis of Echo State Network parameters using Rossler attractor.
result Exploration of how network type affects Echo State Network performance.

We consider the dynamics of a smart grid system characterized by widespread distributed generation and storage devices. We assume that agents are free to trade electric energy over the network and we focus on the emerging market dynamics. We consider three different models for the market dynamics for which we present a…

2013-09-11abs ↗pdf ↗

The paper analyzes a neural network two-sample test using kernel analysis.

problem Determining if two datasets come from the same distribution.
method Time-analysis on a neural tangent kernel (NTK) two-sample test, extending to realistic neural network dynamics.
result Training times needed to detect deviations are well-separated in null and alternative hypothesis scenarios.

The paper finds stocks with higher dynamic network risk have lower returns.

problem Understanding and pricing short-term and long-term dynamic network risk in stock returns.
method Examined the relationship between stock sensitivities to dynamic network risk and expected returns, using economic theory and empirical analysis.
result A one-standard deviation increase in long-term network risk loadings associates with a 7.66% drop in annualized expected returns.

Analyzes SGD dynamics in two-layer networks, bridging different regimes.

problem Understanding SGD dynamics in high-dimensional and mean-field settings.
method Rigorous analysis via deterministic low-dimensional description of sufficient statistics.
result Infinite-width dynamics remains close to a low-dimensional subspace.

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Novel approach analyzes ReLU networks' training dynamics and proposes GmP for improved optimization.

problem Stochastic optimization instability in ReLU networks impedes convergence and generalization.
method Characteristic activation boundaries analysis and Geometric Parameterization (GmP) technique.
result GmP resolves instability, leading to better optimization, convergence, and generalization.

GNNs improve brain activity forecasting in fMRI studies.

problem Understanding neural dynamics in the brain.
method Comparison of GNN architectures for modeling fMRI data.
result GNNs outperform VAR models in robustly scaling to large network studies.

This study analyzes cryptocurrency market crashes using complex network analysis.

problem Identifying and understanding dynamics of cryptocurrency market crashes.
method Complex network analysis of cryptocurrency market during pre-crash, crash, and post-crash periods.
result Network density and clustering coefficient spike during crashes, indicating uninformed panic sell-off.

Neural signals are characterized by rich temporal and spatiotemporal dynamics that reflect the organization of cortical networks. Theoretical research has shown how neural networks can operate at different dynamic ranges that correspond to specific types of information processing. Here we present a data analysis framew…

2016-05-09abs ↗pdf ↗

Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.

problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.

Proposes a Koopman operator method for time-dependent reliability analysis of nonlinear systems.

problem Challenges in time-dependent reliability analysis of nonlinear dynamical systems.
method Koopman operator approach for transforming nonlinear systems into linear ones, combined with deep learning for intrinsic coordinates.
result Robust and generalizable approach for time-dependent reliability analysis, superior to purely data-driven methods.

Relational data-like graphs, networks, and matrices-is often dynamic, where the relational structure evolves over time. A fundamental problem in the analysis of time-varying network data is to extract a summary of the common structure and the dynamics of the underlying relations between the entities. Here we build on t…

2013-11-08abs ↗pdf ↗

A fairly comprehensive analysis is presented for the gradient descent dynamics for training two-layer neural network models in the situation when the parameters in both layers are updated. General initialization schemes as well as general regimes for the network width and training data size are considered. In the over-…

2019-04-08abs ↗pdf ↗

New insights into quantized neural networks reveal learning dynamics and generalization errors.

problem Understanding the impact of quantization hyperparameters on learning dynamics in high-dimensional models.
method Theoretical analysis and fixed-point analysis of STE dynamics in quantized models.
result STE training in quantized models converges to a plateau followed by a sharp drop in generalization error, influenced by quantization range.

Unified framework detects dynamic community structure in brain networks across individuals.

problem Detecting community structure in functional brain networks across multiple subjects and over time.
method Markov-switching stochastic block model (MSS-SBM) for multilayer brain networks.
result Captures dynamic reconfiguration of modular connectivity in brain networks across different task conditions.

Attack graphs provide compact representations of the attack paths that an attacker can follow to compromise network resources by analysing network vulnerabilities and topology. These representations are a powerful tool for security risk assessment. Bayesian inference on attack graphs enables the estimation of the risk …

2016-06-22abs ↗pdf ↗

Attack graphs are a powerful tool for security risk assessment by analysing network vulnerabilities and the paths attackers can use to compromise network resources. The uncertainty about the attacker's behaviour makes Bayesian networks suitable to model attack graphs to perform static and dynamic analysis. Previous app…

2015-10-08abs ↗pdf ↗

DyHATR learns dynamic heterogeneous networks for better link prediction.

problem Learning effective representations of dynamic heterogeneous networks for link prediction.
method Hierarchical attention for heterogeneous information and temporal RNN for evolutionary patterns.
result DyHATR significantly outperforms state-of-the-art baselines on link prediction tasks.

Improved accuracy in dynamic response variation analysis using multi-fidelity data fusion.

problem Inefficient characterization of dynamic response variation due to limited high-fidelity data.
method Composite Neural Network fusion approach for multi-level, heterogeneous datasets.
result Improved accuracy in frequency response variation characterization.

The study analyzes sharpness dynamics in neural networks, revealing mechanisms and conditions.

problem Understanding sharpness in neural network training.
method Fixed point analysis and edge of stability analysis in a simplified 2-layer linear network.
result Reveals mechanisms behind sharpness trends, conditions for edge of stability, and a period-doubling route to chaos.

New method clusters evolving networks using spatio-temporal graph Laplacian.

problem Clustering communities in time-varying graphs.
method Extends spectral clustering to dynamic graphs using CCA and spatio-temporal graph Laplacian.
result The spatio-temporal graph Laplacian clearly interprets cluster evolution over time.

New framework analyzes deep learning optimization with finite width networks, revealing generalization gaps and excess risks.

problem Analyzing generalization error of deep learning with finite width networks.
method Formulating neural network training as transportation map estimation and analyzing via infinite dimensional Langevin dynamics.
result Achieves fast learning rate and minimax optimal rates for classification and regression problems.

Interpretable model for Granger causality using neural networks.

problem Inferring Granger causality in complex dynamical systems.
method Extension of self-explaining neural networks for multivariate Granger causality.
result Framework performs on par with baseline methods and better at inferring interaction signs.

BNN-DP improves robustness analysis of Bayesian Neural Networks.

problem Ensuring robustness of Bayesian Neural Networks against adversarial attacks.
method Dynamic Programming applied to Bayesian Neural Networks as stochastic dynamical systems.
result BNN-DP provides tighter and more efficient bounds on prediction ranges compared to existing methods.

Study reveals subdominant correlations in motorway network dynamics.

problem Understanding correlations between motorway sections for network functionality.
method Spectral analysis of correlation matrix to identify subdominant collectivities.
result Subdominant collectivities affect large parts of the traffic network.

Proposes a regularization approach to model German power derivative market, identifying significant risk spillovers.

problem Large portfolio of German power derivative contracts, identifying significant risk spillovers.
method Combines high-dimensional variable selection with dynamic network analysis.
result Identifies significant risk contributors and interdependencies between contracts, especially spot contracts.

Study reveals trade dynamics in dry bulk shipping networks, highlighting their randomness and periodic changes.

problem Understanding the randomness and periodic changes in dry bulk shipping networks.
method Analysis of micro-level trade flow data from 2015 to 2023, focusing on grain, coal, and iron ore networks.
result Dry bulk shipping networks exhibit small-world phenomena and periodic life cycles, influenced by importing ports and global events.

The paper analyzes the mean field Langevin dynamics and its convergence rate.

problem The convergence property of the mean field Langevin dynamics in the context of neural networks.
method The analysis uses a proximal Gibbs distribution and techniques from convex optimization.
result A concise convergence rate analysis of the mean field Langevin dynamics in both continuous and discrete time settings.