SearcharxivSearch

arXiv · math/0506189

A Variational Principle in the Dual Pair of Reproducing Kernel Hilbert Spaces and an Application

Abstract

Given a positive definite, bounded linear operator $A$ on the Hilbert space $\mathcal{H}_0:=l^2(E)$, we consider a reproducing kernel Hilbert space $\mathcal{H}_+$ with a reproducing kernel $A(x,y)$. Here $E$ is any countable set and $A(x,y)$, $x,y\in E$, is the representation of $A$ w.r.t. the usual basis of $\mathcal{H}_0$. Imposing further conditions on the operator $A$, we also consider another reproducing kernel Hilbert space $\mathcal{H}_-$ with a kernel function $B(x,y)$, which is the representation of the inverse of $A$ in a sense, so that $\mathcal{H}_-\supset\mathcal{H}_0\supset\mathcal{H}_+$ becomes a rigged Hilbert space. We investigate a relationship between the ratios of determinants of some partial matrices related to $A$ and $B$ and the suitable projections in $\mathcal{H}_-$ and $\mathcal{H}_+$. We also get a variational principle on the limit ratios of these values. We apply this relation to show the Gibbsianness of the determinantal point process (or fermion point process) defined by the operator $A(I+A)^{-1}$ on the set $E$. It turns out that the class of determinantal point processes that can be recognized as Gibbs measures for suitable interactions is much bigger than that obtained by Shirai and Takahashi.

Explore related subjects

Keep this discovery

BibTeXRIS

Hyun Jae Yoo. 2005-06-10. A Variational Principle in the Dual Pair of Reproducing Kernel Hilbert Spaces and an Application. https://arxiv.org/abs/math/0506189

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