SearcharxivSearch

arXiv subjects

Pierre Andreoletti

Publications and source records attributed to Pierre Andreoletti.

At least 19 recordsLinked to original sources

Forecast collapse of transformer-based models under squared loss in financial time series

We study trajectory forecasting under squared loss for time series with weak conditional structure, using highly expressive prediction models. Building on the classical characterization of squared-loss risk minimization, we emphasize regimes in which the conditional expectation of future trajectories is effectively degenerate, leading to trivial Bayes-optimal predictors (flat for prices and zero for returns in standard financial settings). In this regime, increased model expressivity does not improve predictive accuracy but instead introduces spurious trajectory fluctuations around the optimal predictor. These fluctuations arise from the reuse of noise and result in increased prediction variance without any reduction in bias. This provides a process-level explanation for the degradation of Transformerbased forecasts on financial time series. We complement these theoretical results with numerical experiments on high-frequency EUR/USD exchange rate data, analyzing the distribution of trajectory-level forecasting errors. The results show that Transformer-based models yield larger errors than a simple linear benchmark on a large majority of forecasting windows, consistent with the variance-driven mechanism identified by the theory.

stat.ML

Sub-diffusive behavior of a recurrent Axis-Driven Random Walk

We study the second order of the number of excursions of a simple random walk with a bias that drives a return toward the origin along the axes introduced by P. Andreoletti and P. Debs \cite{AndDeb3}. This is a crucial step toward deriving the asymptotic behavior of these walks, whose limit is explicit and reveals various characteristics of the process: the invariant probability measure of the extracted coordinates away from the axes, the 1-stable distribution arising from the tail distribution of entry times on the axes, and finally, the presence of a Bessel process of dimension 3, which implies that the trajectory can be interpreted as a random path conditioned to stay within a single quadrant.

math.PR

Axis-Driven Random Walks on $\mathbb{Z}^2$ (transient cases)

Axis-driven random walks were introduced by P. Andreoletti and P. Debs [AD23] to provide a rough description of the behaviour of a particle trapped in a localized force field. In contrast to their work, we examine the scenario where a repulsive force (controlled by a parameter $\alpha$) is applied along the axes, with the hypothesis that the walk remains diffusive within the cones. This force gradually pushes the particle away from the origin whenever it encounters an axis. We prove that even with a minimal force (i.e., a small $\alpha$), the walk exhibits transient, superdiffusive behaviour, and we derive the left and right tails of its distribution.

math.PR

Simple random walk on Z^2 perturbed on the axis (renewal case)

We study a simple random walk on Z^2 with constraints on the axis. Motivation comes from physics when particles (a gas for example, see [Dal88]) are submitted to a local field. In our case we assume that the particle evolves freely in the cones but when touching the axis a force pushes it back progressively to the origin. The main result proves that this force can be parametrized in such a way that a renewal structure appears in the trajectory of the random walk. This implies the existence of an ergodic result for the parts of the trajectory restricted to the axis.

math.PR

Generalized range of slow random walks on trees

In this work, we are interested in the set of visited vertices of a tree $\mathbb{T}$ by a randomly biased random walk $\mathbb{X}:=(X_n,n \in \mathbb{N})$. The aim is to study a generalized range, that is to say the volume of the trace of $\mathbb{X}$ with both constraints on the trajectories of $\mathbb{X}$ and on the trajectories of the underlying branching random potential $\mathbb{V}:=(V(x), x \in \mathbb{T})$. Focusing on slow regime's random walks (see [HS16b], [AC18]), we prove a general result and detail examples. These examples exhibit many different behaviors for a wide variety of ranges, showing the interactions between the trajectories of $\mathbb{X}$ and the ones of $\mathbb{V}$.

math.PR

The heavy range of randomly biased walks on trees

We focus on recurrent random walks in random environment (RWRE) on Galton-Watson trees. The range of these walks, that is the number of sites visited at some fixed time, has been studied in three different papers [AC18], [AdR17] and [dR16]. Here we study the heavy range: the number of edges visited at least $\alpha$ times for some integer $\alpha$. The asymptotic behavior of this process when $\alpha$ is a power of the number of steps of the walk is given for all the recurrent cases. It turns out that this heavy range plays a crucial role in the rate of convergence of an estimator of the environment from a single trajectory of the RWRE.

math.PR

Range and critical generations of a random walk on Galton-Watson trees

In this paper we consider a random walk in random environment on a tree and focus on the boundary case for the underlying branching potential. We study the range $R\_n$ of this walk up to time $n$ and obtain its correct asymptotic in probability which is of order $n/\log n$. Thisresult is a consequence of the asymptotical behavior of the number of visited sites at generations of order $(\log n)^2$,which turn out to be the most visited generations. Our proof which involves a quenched analysisgives a description of the typical environments responsible for the behavior of $R\_n$.

math.PR

Renewal structure and local time for diffusions in random environment

We study a one-dimensional diffusion $X$ in a drifted Brownian potential $W\_\kappa$, with $ 0\textless{}\kappa\textless{}1$, and focus on the behavior of the local times $(\mathcal{L}(t,x),x)$ of $X$ before time $t\textgreater{}0$.In particular we characterize the limit law of the supremum of the local time, as well as the position of the favorite sites. These limits can be written explicitly from a two dimensional stable L{\'e}vy process. Our analysis is based on the study of an extension of the renewal structure which is deeply involved in the asymptotic behavior of $X$.

math.PR

Parametric estimation of a one-dimensional ballistic random walk in a Markov environment

We focus on the parametric estimation of the distribution of a Markov environment from the observation of a single trajectory of a one-dimensional nearest-neighbor path evolving in this random environment. In the ballistic case, as the length of the path increases, we prove consistency, asymptotic normality and efficiency of the maximum likelihood estimator. Our contribution is two-fold: we cast the problem into the one of parameter estimation in a hidden Markov model (HMM) and establish that the bivariate Markov chain underlying this HMM is positive Harris recurrent. We provide different examples of setups in which our results apply, in particular that of DNA unzipping model, and we give a simple synthetic experiment to illustrate those results.

math.ST

Localization and number of visited valleys for a transient diffusion in random environment

We consider a transient diffusion in a $(-\kappa/2)$-drifted Brownian potential $W\_{\kappa}$ with $0\textless{}\kappa\textless{}1$. We prove its localization at time $t$ in the neighborhood of some random points depending only on the environment, which are the positive $h\_t$-minima of the environment, for $h\_t$ a bit smaller than $\log t$. We also prove an Aging phenomenon for the diffusion, a renewal theorem for the hitting time of the farthest visited valley, and provide a central limit theorem for the number of valleys visited up to time $t$. The proof relies on a decomposition of the trajectory of $W\_{\kappa}$ in the neighborhood of $h\_t$-minima, with the help of results of A. Faggionato, and on a precise analysis of exponential functionals of $W\_{\kappa}$ and of $W\_{\kappa}$ Doob-conditioned to stay positive.

math.PR

Spread of visited sites of a random walk along the generations of a branching process

In this paper we consider a null recurrent random walk in random environment on a super-critical Galton-Watson tree. We consider the case where the log-Laplace transform $\psi$ of the branching process satisfies $\psi(1)=\psi'(1)=0$ for which G. Faraud, Y. Hu and Z. Shi in \cite{HuShi10b} show that, with probability one, the largest generation visited by the walk, until the instant $n$, is of the order of $(\log n)^3$. In \cite{AndreolettiDebs1} we prove that the largest generation entirely visited behaves almost surely like $\log n$ up to a constant. Here we study how the walk visits the generations $\ell=(\log n)^{1+ \zeta}$, with $0 < \zeta <2$. We obtain results in probability giving the asymptotic logarithmic behavior of the number of visited sites at a given generation. We prove that there is a phase transition at generation $(\log n)^2$ for the mean of visited sites until $n$ returns to the root. Also we show that the visited sites spread all over the tree until generation $\ell$.

math.PR

The number of generations entirely visited for recurrent random walks on random environment

In this paper we are interested in a random walk in a random environment on a super-critical Galton-Watson tree. We focus on the recurrent cases already studied by Y. Hu and Z. Shi and G. Faraud. We prove that the largest generation entirely visited by these walks behaves like log n and that the constant of normalization which differs from a case to another is function of the inverse of the constant of Biggins' law of large number for branching random walks.

math.PR

DNA unzipping via stopped birth and death processes with unknown transition probabilities

In this paper we provide an alternative approach to the works of the physicists S. Cocco and R. Monasson about a model of DNA molecules. The aim is to predict the sequence of bases by mechanical stimulations. The model described by the physicists is a stopped birth and death process with unknown transition probabilities. We consider two models, a discrete in time and a continuous in time, as general as possible. We show that explicit formula can be obtained for the probability to be wrong for a given estimator, and apply it to evaluate the quality of the prediction. Also we add some generalizations comparing to the initial model allowing us to answer some questions asked by the physicists.

stat.AP

The local time of a random walk on growing hypercubes

We study a random walk in a random environment (RWRE) on $\Z^d$, $1 \leq d < +\infty$. The main assumptions are that conditionned on the environment the random walk is reversible. Moreover we construct our environment in such a way that the walk can't be trapped on a single point like in some particular RWRE but in some specific d-1 surfaces. These surfaces are basic surfaces with deterministic geometry. We prove that the local time in the neighborhood of these surfaces is driven by a function of the (random) reversible measure. As an application we get the limit law of the local time as a process on these surfaces.

math.PR

Limit law of the local time for Brox's diffusion

We consider Brox's model: a one-dimensional diffusion in a Brownian potential W. We show that the normalized local time process (L(t;m_(log t) + x)=t; x \in R), where m_(log t) is the bottom of the deepest valley reached by the process before time t, behaves asymptotically like a process which only depends on W. As a consequence, we get the weak convergence of the local time to a functional of two independent three-dimensional Bessel processes and thus the limit law of the supremum of the normalized local time. These results are discussed and compared to the discrete time and space case which same questions have been solved recently by N. Gantert, Y. Peres and Z. Shi.

math.PR

Sinai's walk: a statistical aspect

We consider Sinai's random walk in random environment. We prove that the logarithm of the local time is a good estimator of the random potential associated to the random environment. We give a constructive method allowing us to built the random environment from a single trajectory of the random walk.

math.PR

A limit result for a system of particles in random environment

We consider an infinite system of particles in one dimension, each particle performs independant Sinai's random walk in random environment. Considering an instant $t$, large enough, we prove a result in probability showing that the particles are trapped in the neighborhood of well defined points of the lattice depending on the random environment the time $t$ and the starting point of the particles.

math.PR