相关论文: A Constructive Brownian Limit Theorem

Let $G=(V,E)$ be a finite, connected graph. We investigate a notion of boundary $\partial G \subseteq V$ and argue that it is well behaved from the point of view of potential theory. This is done by proving a number of discrete analogous of…

Let $R:(0,\infty) \to [0,\infty)$ be a measurable function. Consider coalescing Brownian motions started from every point in the subset $\{ (0,x) : x \in \mathbb{R} \}$ of $[0,\infty) \times \mathbb{R}$ (with $[0,\infty)$ denoting time and…

Classical boundary Hardy inequality, that goes back to 1988, states that if $1 < p < \infty, \ ~\Omega$ is bounded Lipschitz domain, then for all $u \in C^{\infty}_{c}(\Omega)$, $$\int_{\Omega} \frac{|u(x)|^{p}}{\delta^{p}_{\Omega}(x)} dx…

We prove a central limit theorem for an additive functional of the $d$-dimensional fractional Brownian motion with Hurst index $H\in(\frac{1}{2+d},\frac{1}{d})$, using the method of moments, extending the result by Papanicolaou, Stroock and…

We define constructive truth for arithmetic and for intuitionistic analysis, and investigate its properties. We also prove that the set of constructively true (first order) arithmetical statements is Pi-1-2 and Sigma-1-2 hard, and we…

The classical Littlewood's theorem establishes boundedness and provides a norm estimate for composition operators on the Hardy space. In this paper, we offer an alternative proof of boundedness and derive a new norm estimate that improves…

In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of the recursive function does not go beyond the…

This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…

Let $X_n(k)$ be the number of vertices at level $k$ in a random recursive tree with $n+1$ vertices. We prove a functional limit theorem for the vector-valued process $(X_{[n^t]}(1),\ldots, X_{[n^t]}(k))_{t\geq 0}$, for each $k\in\mathbb N$.…

We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…

We establish finite-dimensional central limit theorems for local, additive, interaction functions of temporally evolving point processes. The dynamics are those of a spatial Poisson process on the flat torus with points subject to a…

The first part of this paper is devoted to the Brown measure of the product of the free unitary Brownian motion by an arbitrary free non negative operator. Our approach follows the one recently initiated by Driver-Hall-Kemp though there are…

The regularity of limit spaces of Riemannian manifolds with L^p curvature bounds, $p > n/2$, is investigated under no apriori non-collapsing assumption. A regular subset, defined by a local volume growth condition for a limit measure, is…

We study unboundedness properties of functions belonging to generalised Morrey spaces ${\mathcal M}_{\varphi,p}({\mathbb R}^d)$ and generalised Besov-Morrey spaces ${\mathcal N}^{s}_{\varphi,p,q}({\mathbb R}^d)$ by means of growth…

We present a method for constructing all bounded rational motions that frame a space curve $\mathbf{r}(t)$. This means that the motion guides an orthogonal frame along the curve such that one frame axis is in direction of the curve tangent.…

Shannon gave a lower bound in 1959 on the binary rate of spherical codes of given minimum Euclidean distance $\rho$. Using nonconstructive codes over a finite alphabet, we give a lower bound that is weaker but very close for small values of…

We proof a limit theorem for moments in space of the increments of Brownian local time. As special cases for the second and third moments, previous results by Chen et al. (Ann. Prob. 38, 2010, no. 1) and Rosen (Stoch. Dyn. 11, 2011, no. 1),…

We find a sharp combinatorial bound for the metric entropy of sets in R^n and general classes of functions. This solves two basic combinatorial conjectures on the empirical processes. 1. A class of functions satisfies the uniform Central…

Tennenbaum's theorem states that the only countable model of Peano arithmetic (PA) with computable arithmetical operations is the standard model of natural numbers. In this paper, we use constructive type theory as a framework to revisit,…

Start a planar Brownian motion and let it run until it hits some given barrier. We show that the barrier may be crafted so that the x coordinate at the hitting time has any prescribed centered distribution with finite variance. This…