Model Spaces of Regularity Structures for Space-Fractional SPDEs

We study model spaces, in the sense of Hairer, for stochastic partial differential equations involving the fractional Laplacian. We prove that the fractional Laplacian is a singular kernel suitable to apply the theory of regularity structures. Our main contribution is to study the dependence of the model space for a regularity structure on the three-parameter problem involving the spatial dimension, the polynomial order of the nonlinearity and the exponent of the fractional Laplacian. The goal is to investigate the growth of the model space under parameter variation. In particular, we prove several results in the approaching subcriticality limit leading to universal growth exponents of the regularity structure. A key role is played by the viewpoint that model spaces can be identified with families of rooted trees. Our proofs are based upon a geometrical construction similar to Newton polygons for classical Taylor series and various combinatorial arguments. We also present several explicit examples listing all elements with negative homogeneity by implementing a new symbolic software package to work with regularity structures. We use this package to illustrate our analytical results and to obtain new conjectures regarding coarse-grained network measures for model spaces.

Comments: 34 pages, 11 figures; preprint: comments and suggestions welcome

Similar Publications

This is the first of two articles on the study of a particle system model that exhibits a Turing instability type effect. The model is based on two discrete lines (or toruses) with Ising spins, that evolve according to a continuous time Markov process defined in terms of macroscopic Kac potentials and local interactions. For fixed time, we prove that the density fields weakly converge to the solution of a system of partial differential equations involving convolutions. Read More


~This paper presents a general result that allows for establishing a link between the Kolmogorov-Marcinkiewicz-Zygmund strong law of large numbers and Feller's strong law of large numbers in a Banach space setting. Let $\{X, X_{n}; n \geq 1\}$ be a sequence of independent and identically distributed Banach space valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. Let $\{a_{n}; n \geq 1\}$ and $\{b_{n}; n \geq 1\}$ be increasing sequences of positive real numbers such that $\lim_{n \rightarrow \infty} a_{n} = \infty$ and $\left\{b_{n}/a_{n};~ n \geq 1 \right\}$ is a nondecreasing sequence. Read More


In this paper, we compute the expectation of traces of powers of the hermitian matrix Jacobi process for a large enough but fixed size. To proceed, we first derive the semi-group density of its eigenvalues process as a bilinear series of symmetric Jacobi polynomials. Next, we use the expansion of power sums in the Schur polynomial basis and the integral Cauchy-Binet formula in order to determine the partitions having non zero contributions after integration. Read More


Let $G$ be a semimartingale, and $S$ its Snell envelope. Under the assumption that $S$ is of class (D) and $G$ is $special$, we show that the finite-variation part of $S$ is absolutely continuous with respect to the decreasing part of the finite-variation part of $G$. In the Markovian setting, this enables us to identify sufficient conditions for the value function of the optimal stopping problem to belong to the domain of an extended (martingale) generator of the underlying Markov process. Read More


The synchronization process inherent to the Bitcoin network gives rise to an infinite-server model with the unusual feature that customers interact. Among the closed-form characteristics that we derive for this model is the busy period distribution which, counterintuitively, does not depend on the arrival rate. We explain this by exploiting the equivalence between two specific service disciplines, which is also used to derive the model's stationary distribution. Read More


Motivated by the potential applications to the fractional Brownianmotion, we study Volterra stochasticdifferential of the form~:\begin{equation}X\_t = x+ \int\_0^tK(t,s)b(s,X\_s)ds + \int\_0^tK(t,s) \sigma(s,X\_s)\,dB\_s ,\tag{E} \label{eq:sdefbm}\end{equation}where $(B\_s, \, s\in [0,1])$ is a one-dimensional standard Brownianmotion and $(K(t,s), \, t,s \in [0,1])$ is a deterministic kernelwhose properties will be precised below but for which we don't assumeany boundedness property. Read More


Stochastic integration \textit{wrt} Gaussian processes has raised strong interest in recent years, motivated in particular by its applications in Internet traffic modeling, biomedicine and finance. The aim of this work is to define and develop a White Noise Theory-based anticipative stochastic calculus with respect to all Gaussian processes that have an integral representation over a real (maybe infinite) interval. Very rich, this class of Gaussian processes contains, among many others, Volterra processes (and thus fractional Brownian motion) as well as processes the regularity of which varies along the time (such as multifractional Brownian motion). Read More


D. Ruelle considered a general setting where he is able to describe a formulation of the concept of Gibbs state based on conjugating homeomorphism in the so called Smale spaces. On this setting he shows a relation of KMS states of $C^*$-algebras and equilibrium probabilities of Thermodynamic Formalism. Read More


A fundamental challenge in large-scale cloud networks and data centers is to achieve highly efficient server utilization and limit energy consumption, while providing excellent user-perceived performance in the presence of uncertain and time-varying demand patterns. Auto-scaling provides a popular paradigm for automatically adjusting service capacity in response to demand while meeting performance targets, and queue-driven auto-scaling techniques have been widely investigated in the literature. In typical data center architectures and cloud environments however, no centralized queue is maintained, and load balancing algorithms immediately distribute incoming tasks among parallel queues. Read More


This paper focuses on the problem of modeling for small world effect on complex networks. Let's consider the supercritical Poisson continuous percolation on $d$-dimensional torus $T^d_n$ with volume $n^d$. By adding "long edges (short cuts)" randomly to the largest percolation cluster, we obtain a random graph $\mathscr G_n$. Read More