SearcharxivSearch

arXiv · 0809.2082

Some remarks on Betti numbers of random polygon spaces

Abstract

Polygon spaces like $M_\ell=\{(u_1,...,u_n)\in S^1\times... S^1 ;\ \sum_{i=1}^n l_iu_i=0\}/SO(2)$ or they three dimensional analogues $N_\ell$ play an important rôle in geometry and topology, and are also of interest in robotics where the $l_i$ model the lengths of robot arms. When $n$ is large, one can assume that each $l_i$ is a positive real valued random variable, leading to a random manifold. The complexity of such manifolds can be approached by computing Betti numbers, the Euler characteristics, or the related Poincaré polynomial. We study the average values of Betti numbers of dimension $p_n$ when $p_n\to\infty$ as $n\to\infty$. We also focus on the limiting mean Poincaré polynomial, in two and three dimensions. We show that in two dimensions, the mean total Betti number behaves as the total Betti number associated with the equilateral manifold where $l_i\equiv \bar l$. In three dimensions, these two quantities are not any more asymptotically equivalent. We also provide asymptotics for the Poincaré polynomials

Explore related subjects

Keep this discovery

BibTeXRIS

Clément Dombry, Christian Mazza. 2008-09-12. Some remarks on Betti numbers of random polygon spaces. https://arxiv.org/abs/0809.2082

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