Searcharxiv⌕ Search

arXiv · math/0112055

Laplace operators in deRham complexes associated with measures on configuration spaces

Abstract

Let $Γ_X$ denote the space of all locally finite configurations in a complete, stochastically complete, connected, oriented Riemannian manifold $X$, whose volume measure $m$ is infinite. In this paper, we construct and study spaces $L^2_μΩ^n$ of differential $n$-forms over $Γ_X$ that are square integrable with respect to a probability measure $μ$ on $Γ_X$. The measure $μ$ is supposed to satisfy the condition $Σ_m'$ (generalized Mecke identity) well known in the theory of point processes. On $L^2_μΩ^n$, we introduce bilinear forms of Bochner and deRham type. We prove their closabilty and call the generators of the corresponding closures the Bochner and deRham Laplacian, respectively. We prove that both operators contain in their domain the set of all smooth local forms. We show that, under a rather general assumption on the measure $μ$, the space of all Bochner-harmonic $μ$-square integrable forms on $Γ_X$ consists only of the zero form. Finally, a Weitzenböck type formula connecting the Bochner and deRham Laplacians is obtained. As examples, we consider (mixed) Poisson measures, Ruelle type measures on $Γ_{{\Bbb R}^d}$, and Gibbs measures in the low activity--high temperature regime, as well as Gibbs measures with a positive interaction potential on $Γ_X$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Albeverio, A. Daletskii, Y. Kondratiev, E. Lytvynov. 2001-12-08. Laplace operators in deRham complexes associated with measures on configuration spaces. https://arxiv.org/abs/math/0112055

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

KEEP EXPLORING

Related papers

On the minimum bisection of random $3$-regular graphs

In this paper we give new bounds on the bisection width of random 3-regular graphs on $n$ vertices. The main contribution is a new lower bound of $0.103295n$ based on a first moment method together with a structural analysis of the graph, thereby improving a 27-year-old result of Kostochka and Melnikov. We also give a complementary upper bound of $0.139822n$ by combining a result of Lyons with original combinatorial insights. Developping this approach further, we obtain a non-rigorous improved upper bound with the help of Monte Carlo simulations.

math.PR↗

Quantitative Propagation of Chaos for Singular Interacting Particle Systems Driven by Fractional Brownian Motion

We consider interacting systems particle driven by i.i.d. fractional Brownian motions, subject to irregular, possibly distributional, pairwise interactions. We show propagation of chaos and mean field convergence to the law of the associated McKean--Vlasov equation, as the number of particles $N\to\infty$, with quantitative sharp rates of order $N^{-1/2}$. Our results hold for a wide class of possibly time-dependent interactions, which are only assumed to satisfy a Besov-type regularity, related to the Hurst parameter $H\in (0,+\infty)\setminus \mathbb{N}$ of the driving noises. In particular, as $H$ decreases to $0$, interaction kernels of arbitrary singularity can be considered, a phenomenon frequently observed in regularization by noise results. Our proofs rely on a combinations of Sznitman's direct comparison argument with stochastic sewing techniques.

math.PR↗

Power rate of convergence of discrete curves: framework and applications

We develop a framework for power-law rates of convergence of random discrete curves to Schramm Loewner Evolution (SLE). We show that a power-law rate of convergence of a suitable martingale observable gives a power-law rate of convergence of the interface to SLE, provided the discrete curves satisfy the Kemppainen-Smirnov crossing condition; the proof uses known estimates on the derivative of the SLE map. We apply the framework to the exploration process of critical site percolation on the triangular lattice, obtaining a power-law rate of convergence to SLE$_6$.

math.PR↗