SearcharxivSearch

arXiv · 2605.08844

Signature Kernel and Schwinger-Dyson Kernel Equations as Two-Parameter Rough Differential Equations

Abstract

We develop a rough-path framework for two-parameter rough differential equations on rectangular and simplicial domains, motivated by the signature kernel and Schwinger--Dyson kernel equations. The theory is formulated in spaces of jointly controlled rough paths and is based on a robust two-parameter rough integration framework. In particular, we introduce a notion of rough integration over two-dimensional simplices at low regularity extending previous results in the literature. Within this setting, we show that the signature kernel equation arises naturally as a two-parameter rough differential equation and establish well-posedness and stability. We also extend the Schwinger--Dyson kernel equation, previously formulated for bounded-variation paths, to rough driving signals, proving existence and uniqueness in appropriate controlled rough path spaces. In the smooth rough path regime, we relate the resulting equations to PDE and integro-differential formulations. Finally, we derive and analyse a numerical scheme for the rough Schwinger--Dyson equation, including runtime and memory complexity estimates, and illustrate its performance with numerical experiments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Cass, Dan Crisan, Andrea Iannucci, William F. Turner. 2026-05-09. Signature Kernel and Schwinger-Dyson Kernel Equations as Two-Parameter Rough Differential Equations. https://arxiv.org/abs/2605.08844

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