SearcharxivSearch

arXiv · 2604.05941

Banach spaces of continuous paths with finite $p$-th variation

Abstract

We study pathwise $p$-th variation of continuous paths on a compact interval along a fixed partition sequence. Although the class of continuous paths with finite $p$-th variation is generally not linear, we develop a coefficient-based approach via Faber-Schauder expansions that, for any $p>1$, enables the construction of paths with prescribed $p$-th variation while preserving useful linear structures and H\"older regularity. We first construct continuous paths with linear $p$-th variation from suitable conditions on their Faber-Schauder coefficients. We then prescribe nonlinear $p$-th variation through a multiplicative transformation and show that, whenever nonempty, the class of H\"older continuous paths with a given $p$-th variation is dense in $C([0,1])$. Next, we introduce a transport procedure that turns a Banach subspace of continuous functions into a Banach subspace of paths with explicitly controlled $p$-th variation. We also prove stability of the associated pathwise F\"ollmer-It\^o map on these transported subspaces. Finally, via time-changes, we show that this constructive framework extends from $q$-adic partition sequences to broader classes of dense $q$-refining partition sequences.

Explore related subjects

Keep this discovery

BibTeXRIS

Purba Das, Donghan Kim, Fang Rui Lim. 2026-04-07. Banach spaces of continuous paths with finite $p$-th variation. https://arxiv.org/abs/2604.05941

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR