SearcharxivSearch

arXiv · 0810.4070

Discrete approximation of the free Fock space

Abstract

We prove that the free Fock space ${\F}(\R^+;\C)$, which is very commonly used in Free Probability Theory, is the continuous free product of copies of the space $\C^2$. We describe an explicit embedding and approximation of this continuous free product structure by means of a discrete-time approximation: the free toy Fock space, a countable free product of copies of $\C^2$. We show that the basic creation, annihilation and gauge operators of the free Fock space are also limits of elementary operators on the free toy Fock space. When applying these constructions and results to the probabilistic interpretations of these spaces, we recover some discrete approximations of the semi-circular Brownian motion and of the free Poisson process. All these results are also extended to the higher multiplicity case, that is, ${\F}(\R^+;\C^N)$ is the continuous free product of copies of the space $\C^{N+1}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Stéphane Attal, Ion Nechita. 2008-10-22. Discrete approximation of the free Fock space. https://arxiv.org/abs/0810.4070

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