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

1223 · Feb 201619922001200920172026
48 results for Scale-Free

Financial markets display scale-free behavior in many different aspects. The power-law behavior of part of the distribution of individual wealth has been recognized by Pareto as early as the nineteenth century. Heavy-tailed and scale-free behavior of the distribution of returns of different financial assets have been c…

2009-05-29abs ↗pdf ↗

Network embedding aims to learn the low-dimensional representations of vertexes in a network, while structure and inherent properties of the network is preserved. Existing network embedding works primarily focus on preserving the microscopic structure, such as the first- and second-order proximity of vertexes, while th…

2017-11-29abs ↗pdf ↗

Learning the network structure underlying data is an important problem in machine learning. This paper introduces a novel prior to study the inference of scale-free networks, which are widely used to model social and biological networks. The prior not only favors a desirable global node degree distribution, but also ta…

2015-03-07abs ↗pdf ↗

New algorithm tackles multi-armed bandit with arbitrary delays and general bounded losses.

problem Scale-free adversarial multi-armed bandit with arbitrary feedback delays.
method SFD-INF combines convex combination trick and doubling/skipping technique.
result Achieves adaptive regret bounds for non-negative and general scale-free losses.

We propose a simple dynamical model of the formation of production networks among monopolistically competitive firms. The model subsumes the standard general equilibrium approach à la Arrow-Debreu but displays a wide set of potential dynamic behaviors. It robustly reproduces key stylized facts of firms' demographics. O…

2015-09-03abs ↗pdf ↗

New learning dynamics achieve fast convergence in games without needing to know utility scales.

problem Fast convergence guarantees in learning games require prior knowledge of utility scales.
method Developed scale-free and scale-invariant learning dynamics using optimistic follow-the-regularized-leader with adaptive learning rates and clipping techniques.
result Achieved fast convergence rates to Nash and correlated equilibria without prior utility scale knowledge.

Existing strategies for finite-armed stochastic bandits mostly depend on a parameter of scale that must be known in advance. Sometimes this is in the form of a bound on the payoffs, or the knowledge of a variance or subgaussian parameter. The notable exceptions are the analysis of Gaussian bandits with unknown mean and…

2017-03-27abs ↗pdf ↗

General Motors or a local business, which one is better to be stimulated in post-crisis recessions, where government stimulation is meant to overcome recessions? Due to the budget constraints, it is quite relevant to ask how one can increase the chance of economic recovery. One of the key elements to answer this questi…

2019-04-24abs ↗pdf ↗

Multi-agent models have been used in many contexts to study generic collective behavior. Similarly, complex networks have become very popular because of the diversity of growth rules giving rise to scale-free behavior. Here we study adaptive networks where the agents trade ``wealth'' when they are linked together while…

2008-04-25abs ↗pdf ↗

In high-dimensional data analysis, regularization methods pursuing sparsity and/or low rank have received a lot of attention recently. To provide a proper amount of shrinkage, it is typical to use a grid search and a model comparison criterion to find the optimal regularization parameters. However, we show that fixing …

2018-12-30abs ↗pdf ↗

StochasticRank optimizes ranking metrics efficiently and guarantees global convergence.

problem Optimizing discrete ranking metrics due to their ill-posed nature.
method Stochastic smoothing, gradient estimate, debiasing, and Stochastic Gradient Langevin Boosting.
result Global convergence and superior performance on ranking datasets.

We propose a network description of large market investments, where both stocks and shareholders are represented as vertices connected by weighted links corresponding to shareholdings. In this framework, the in-degree (kink_{in}) and the sum of incoming link weights (vv) of an investor correspond to the number of asset…

2003-10-21abs ↗pdf ↗

Study on knotting in very long polymer chains, finding Poisson distribution for prime knot types.

problem Understanding knotting in very long polymer chains.
method Generated and analyzed 243k2^{43-k} polygons of size n=2kn=2^k using tree data structure and pivot algorithm. Used new knot diagram simplification and invariant-free classification.
result Number of prime summands of knot type KK in a random nn-gon is well described by a Poisson distribution.

The paper proposes using low rank assumption to improve causal structure learning in DAGs.

problem Challenges in learning causal structures in high-dimensional, non-sparse DAGs.
method Exploits low rank assumption of DAG adjacency matrix to adapt causal structure learning methods.
result Maximum rank is highly related to hubs, suggesting low rank for scale-free networks.

Model shows how traders' interactions can create market patterns.

problem Explaining stylized facts in high-frequency trading markets.
method Agent-based model of limit order book trading with zero-intelligence agents.
result Scale-free connectivity between traders reproduces market patterns, while no interaction does not.

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…

2007-05-17abs ↗pdf ↗

SANs estimate feature importance in neural models, identifying interactions and high-ranked features.

problem Understanding and interpreting black-box neural network models.
method Self-Attention Network (SAN) architecture for feature importance estimation.
result SANs identify similar high-ranked features and feature interactions as other methods, improving predictive performance.

A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST …

2008-10-07abs ↗pdf ↗

This study analyzes economic policy uncertainty indices using visibility graphs.

problem Understanding the role of economic policy uncertainty in global economies.
method Visibility graph algorithm applied to economic policy uncertainty indices.
result The economic policy uncertainty indices exhibit persistent behavior and scale-free networks.

Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbolic geometry offers an exciting alternative, as it enables embeddings with much smaller distortion. …

2019-10-28abs ↗pdf ↗

In many professons employees are rewarded according to their relative performance. Corresponding economy can be modeled by taking NN independent agents who gain from the market with a rate which depends on their current gain. We argue that this simple realistic rate generates a scale free distribution even though intr…

2007-04-17abs ↗pdf ↗

Spectral denoising recovers meaningful network structure from noisy financial correlations.

problem Noise in empirical correlation matrices from financial returns obscures genuine interactions.
method Spectral decomposition to separate structured and random components.
result Structured networks derived from 10-16 eigenmodes exhibit stronger core-periphery organization and scale-free degree distributions.

In this paper we prove a global existence theorem, in the direction of cosmological expansion, for sufficiently small perturbations of a family of n+1n+1-dimensional, n3n \geq 3, spatially compact spacetimes which generalizes the k=1k=-1 Friedmann--Robertson--Walker vacuum spacetime. Our results demonstrate causal geodes…

2009-08-06abs ↗pdf ↗

Although standard economics textbooks are seldom interested in production networks, modern economies are more and more based upon suppliers/customers interactions. One can consider entire sectors of the economy as generalised supply chains. We will take this view in the present paper and study under which conditions lo…

2005-07-13abs ↗pdf ↗

We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. Our model…

2009-08-03abs ↗pdf ↗

The paper defines and studies discrete p-density and compression-radius profiles of lattice knots.

problem Understanding geometric properties of lattice knots.
method Develops a framework for discrete p-density and compression-radius profiles of lattice knots, studying them on length-filtered sets and finite move-graph exploration.
result Density and compression-radius values are not monotone, illustrating distinct optimization problems.

This study investigates self-organizing dynamics in a stochastic exponential DAM model using Temporal Complexity.

problem Understanding self-organizing behavior in artificial neural systems.
method Investigation of a stochastic exponential DAM model through Temporal Complexity analysis.
result The model exhibits regimes of complex intermittency with nontrivial temporal correlations and scale-free behavior.

A large set of daily FOREX time series is analyzed. The corresponding correlation matrices (CM) are constructed for USD, EUR and PLZ used as the base currencies. The triangle rule is interpreted as constraints reducing the number of independent returns. The CM spectrum is computed and compared with the cases of shuffle…

2006-06-02abs ↗pdf ↗

We investigate the wealth evolution in a system of agents that exchange wealth through a disordered network in presence of an additive stochastic Gaussian noise. We show that the resulting wealth distribution is shaped by the degree distribution of the underlying network and in particular we verify that scale free netw…

2003-10-23abs ↗pdf ↗

Recent work has demonstrated that embeddings of tree-like graphs in hyperbolic space surpass their Euclidean counterparts in performance by a large margin. Inspired by these results and scale-free structure in the word co-occurrence graph, we present an algorithm for learning word embeddings in hyperbolic space from fr…

2018-08-30abs ↗pdf ↗

We provide an exact solution to the ideal-gas-like models studied in econophysics to understand the microscopic origin of Pareto-law. In these class of models the key ingredient necessary for having a self-organized scale-free steady-state distribution is the trading or collision rule where agents or particles save a d…

2006-03-17abs ↗pdf ↗

By analyzing a large data set of daily returns with data clustering technique, we identify economic sectors as clusters of assets with a similar economic dynamics. The sector size distribution follows Zipf's law. Secondly, we find that patterns of daily market-wide economic activity cluster into classes that can be ide…

2002-07-05abs ↗pdf ↗

Money flow models are essential tools to understand different economical phenomena, like saving propensities and wealth distributions. In spite of their importance, most of them are based on synthetic transaction networks with simple topologies, e.g. random or scale-free ones, as the characterisation of real networks i…

2016-02-23abs ↗pdf ↗

In order to model volatile real-world network behavior, we analyze phase-flipping dynamical scale-free network in which nodes and links fail and recover. We investigate how stochasticity in a parameter governing the recovery process affects phase-flipping dynamics, and find the probability that no more than q% of nodes…

2014-01-29abs ↗pdf ↗

We simplify word embeddings by removing sigmoid in SGNS, revealing connections to hyperbolic spaces.

problem Improving word embeddings quality and understanding their relationship with hyperbolic spaces.
method Analyzing squashed shifted PMI matrix and its relation to graph properties and hyperbolic geometry.
result Word embeddings can be connected to hyperbolic spaces through squashed shifted PMI matrix.