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

4.6%9.3%13.9%18.5% · Mar 202019922001200920172026
48 results for non-ergodic processes

We study how resetting affects geometric Brownian motion, showing it becomes stationary but remains non-ergodic.

problem Effects of stochastic resetting on geometric Brownian motion.
method Analysis of geometric Brownian motion under stochastic resetting.
result Resetting makes geometric Brownian motion stationary but non-ergodic.

Non-ergodic measures found in horocycle flow on Abelian differentials.

problem Finding non-ergodic measures in the horocycle flow on Abelian differentials.
method Analyzing weak convergence of ergodic measures to non-ergodic invariant measures.
result Existence of points with non-equidistributing horocycle flow orbits.

The paper explores properties of functions on Teichmüller space, proving theorems about limits and non-ergodicity.

problem Properties of bounded pluriharmonic and holomorphic functions on Teichmüller space.
method Analyzes the boundary behavior of functions and proves theorems about limits and non-ergodicity.
result Proves the existence of radial limits for bounded pluriharmonic functions and non-constant bounded holomorphic functions.

Strong stability of ergodic iterations proven without ergodic driving sequence.

problem Ensuring strong stability of ergodic iterations under non-ergodic driving sequences.
method Revisiting processes driven by stationary ergodic sequences, proving strong stability under mild conditions on recursive maps.
result Strong stability of iterations proven without ergodic driving sequence.

In modern portfolio theory, the balancing of expected returns on investments against uncertainties in those returns is aided by the use of utility functions. The Kelly criterion offers another approach, rooted in information theory, that always implies logarithmic utility. The two approaches seem incompatible, too loos…

2009-02-17abs ↗pdf ↗

In this paper, we revisit the convergence of the Heavy-ball method, and present improved convergence complexity results in the convex setting. We provide the first non-ergodic O(1/k) rate result of the Heavy-ball algorithm with constant step size for coercive objective functions. For objective functions satisfying a re…

2018-11-05abs ↗pdf ↗

The proximal inertial gradient descent is efficient for the composite minimization and applicable for broad of machine learning problems. In this paper, we revisit the computational complexity of this algorithm and present other novel results, especially on the convergence rates of the objective function values. The no…

2018-01-23abs ↗pdf ↗

We solve the dynamics of the on-line minority game, with general types of decision noise, using generating functional techniques a la De Dominicis and the temporal regularization procedure of Bedeaux et al. The result is a macroscopic dynamical theory in the form of closed equations for correlation- and response functi…

2001-07-30abs ↗pdf ↗

We discuss a variant of Thompson sampling for nonparametric reinforcement learning in a countable classes of general stochastic environments. These environments can be non-Markov, non-ergodic, and partially observable. We show that Thompson sampling learns the environment class in the sense that (1) asymptotically its …

2016-02-25abs ↗pdf ↗

Stochastic gradient methods are the workhorse (algorithms) of large-scale optimization problems in machine learning, signal processing, and other computational sciences and engineering. This paper studies Markov chain gradient descent, a variant of stochastic gradient descent where the random samples are taken on the t…

2018-09-12abs ↗pdf ↗

We consider the problem of dynamic buying and selling of shares from a collection of NN stocks with random price fluctuations. To limit investment risk, we place an upper bound on the total number of shares kept at any time. Assuming that prices evolve according to an ergodic process with a mild decaying memory proper…

2009-09-22abs ↗pdf ↗

This essay discusses the advantages of a probabilistic agent-based approach to questions in theoretical economics, from the nature of economic agents, to the nature of the equilibria supported by their interactions. One idea we propose is that "agents" are meta-individual, hierarchically structured objects, that includ…

2013-11-02abs ↗pdf ↗

Geometric Brownian motion (GBM) is a model for systems as varied as financial instruments and populations. The statistical properties of GBM are complicated by non-ergodicity, which can lead to ensemble averages exhibiting exponential growth while any individual trajectory collapses according to its time-average. A com…

2012-09-20abs ↗pdf ↗

We study a phenomenological model for the continuous double auction, equivalent to two independent M/M/1M/M/1 queues. The continuous double auction defines a continuous-time random walk for trade prices. The conditions for ergodicity of the auction are derived and, as a consequence, three possible regimes in the behavior …

2013-05-13abs ↗pdf ↗

Sandpile Economics explains how economies can be prone to large crises from small shocks.

problem Capitalist economies' recurrent crises disproportionate to shocks.
method Formal framework interpreting instability as geometric fragility of production networks.
result Curvature of production networks predicts medium-run output dynamics and resilience.

Voluntary insurance contracts constitute a puzzle because they increase the expectation value of one party's wealth, whereas both parties must sign for such contracts to exist. Classically, the puzzle is resolved by introducing non-linear utility functions, which encode asymmetric risk preferences; or by assuming the p…

2015-07-16abs ↗pdf ↗

The study examines dynamics on SU(2)-representation varieties for surfaces and non-orientable surfaces.

problem Dynamics of group actions on SU(2)-representation varieties of surfaces and non-orientable surfaces.
method Description and analysis of group actions generated by Dehn twists on SU(2)-representation varieties.
result Explicit invariant rational functions on SU(2)-representation varieties for specific cases of surfaces and non-orientable surfaces.

This paper addresses metaconsistency in Bayesian inference for metastable systems.

problem Inference for metastable systems may not be consistent, but can be metaconsistent over large but finite time intervals.
method Introduces metaconsistency in a Bayesian framework, discusses its relation to spectral properties of model dynamics.
result Metaconsistency can be exploited to infer sub-systems efficiently from larger systems.

Cooperation is a persistent behavioral pattern of entities pooling and sharing resources. Its ubiquity in nature poses a conundrum. Whenever two entities cooperate, one must willingly relinquish something of value to the other. Why is this apparent altruism favored in evolution? Classical solutions assume a net fitness…

2015-06-10abs ↗pdf ↗

Study shows social reinforcement learning can lead to persistent but metastable polarization.

problem Understanding the persistence and dynamics of opinion polarization.
method Simulation and mathematical analysis of a reinforcement learning model of opinion dynamics.
result Polarization observed in the model is metastable and will eventually lead to consensus.

In this article, I will present a paradox whose purpose is to draw your attention to an important topic in finance, concerning the non-independence of the financial returns (non-ergodic hypothesis). In this paradox, we have two people sitting at a table separated by a black sheet so that they cannot see each other and …

2019-03-05abs ↗pdf ↗

In this paper, we consider a framework adapting the notion of cointegration when two asset prices are generated by a driftless Itô-semimartingale featuring jumps with infinite activity, observed regularly and synchronously at high frequency. We develop a regression based estimation of the cointegrated relations method …

2019-05-17abs ↗pdf ↗

Acyclic digraphs are the underlying representation of Bayesian networks, a widely used class of probabilistic graphical models. Learning the underlying graph from data is a way of gaining insights about the structural properties of a domain. Structure learning forms one of the inference challenges of statistical graphi…

2015-04-20abs ↗pdf ↗

This paper improves convergence bounds for AC and NAC algorithms with function approximation.

problem Improving convergence bounds for actor-critic algorithms with function approximation.
method Non-asymptotic analysis of AC and NAC algorithms with compatible function approximation.
result Eliminates the term ε_critic from the error bounds while maintaining best known sample complexities.

Research classifies geometric structures on manifolds using surface group representations.

problem Classifying geometric structures on manifolds related to surface group actions on character varieties.
method Surveying results on surface groups, focusing on compact and non-compact target groups, discussing various representations and their dynamics.
result Dichotomy in dynamics of character varieties based on compactness of target groups.

This chapter is an attempt to present a mathematical theory of compound fractional Poisson processes. The chapter begins with the characterization of a well-known Lévy process: The compound Poisson process. The semi-Markov extension of the compound Poisson process naturally leads to the compound fractional Poisson proc…

2011-03-03abs ↗pdf ↗

A deep Neyman-Scott process uses Poisson processes for efficient inference in complex point processes.

problem Efficient inference in complex hierarchical point processes.
method Developed an efficient posterior sampling via Markov chain Monte Carlo for likelihood-based inference.
result More hidden Poisson processes improve likelihood fitting and event prediction.

The study examines Hawkes processes and their long-term behavior.

problem Understanding the long-term behavior of Hawkes processes.
method Proving functional limit theorems under various conditions on the dispersion of child events.
result Functional limit theorems hold for Hawkes processes with different levels of child event dispersion.

Elliptical processes generalize Gaussian and Student-t models with fat tails and computational efficiency.

problem Need for models with fat tails and computational tractability.
method Represent elliptical distributions as continuous mixtures of Gaussian distributions, derive closed-form expressions for marginal and conditional distributions.
result Elliptical processes offer advantages in robust regression compared to Gaussian processes.

We investigate the Student-t process as an alternative to the Gaussian process as a nonparametric prior over functions. We derive closed form expressions for the marginal likelihood and predictive distribution of a Student-t process, by integrating away an inverse Wishart process prior over the covariance kernel of a G…

2014-02-18abs ↗pdf ↗

Efficient methods for Lévy models using SINH-regular processes.

problem Efficient numerical methods for evaluating Lévy models.
method Defining SL-processes and sSL-processes, deriving properties of characteristic exponent, and showing all popular Lévy processes can be subordinated to Brownian motion.
result All crucial properties of characteristic exponent are consequences of a specific representation, and all popular Lévy processes are SL- or sSL-subordinated Brownian motion.

The aim of process discovery, originating from the area of process mining, is to discover a process model based on business process execution data. A majority of process discovery techniques relies on an event log as an input. An event log is a static source of historical data capturing the execution of a business proc…

2017-04-25abs ↗pdf ↗

Researchers study the geometric properties of a specific type of stable processes.

problem Understanding the information geometry of tempered stable processes.
method Derivation of α-divergence, Fisher information matrices, and α-connections.
result Obtained Fisher information matrices and α-connections for statistical manifolds.

This study bridges discrete and continuous state spaces using the Ehrenfest process and diffusion models.

problem Understanding the relationship between discrete and continuous state spaces in stochastic processes.
method Investigates time-continuous Markov jump processes on discrete state spaces and their correspondence to state-continuous diffusion processes.
result The time-reversal of the Ehrenfest process converges to the time-reversed Ornstein-Uhlenbeck process, bridging discrete and continuous state spaces.

The fractional Poisson process (FPP) is a counting process with independent and identically distributed inter-event times following the Mittag-Leffler distribution. This process is very useful in several fields of applied and theoretical physics including models for anomalous diffusion. Contrary to the well-known Poiss…

2011-04-21abs ↗pdf ↗

Gaussian process priors are commonly used in aerospace design for performing Bayesian optimization. Nonetheless, Gaussian processes suffer two significant drawbacks: outliers are a priori assumed unlikely, and the posterior variance conditioned on observed data depends only on the locations of those data, not the assoc…

2018-01-18abs ↗pdf ↗