Probabilistic approach to the analysis of statistics for convex polygonal lines
The author shows that the problem on the statistics of convex polygonal lines solved by \textit{I. Bárány} and \textit{A. M. Vershik} [Geom. Funct. Anal. 2, No. 4, 381--393 (1992; Zbl 0772.52010)] admits an analysis by traditional probabilistic methods. Consider a planar convex polygonal line \(\Gamma\) issuing from zero such that the vertices of \(\Gamma\) are points of the lattice \(Z^2\) and the angle between each side of \(\Gamma\) and the horizontal axis is in the interval \([0, \pi/2]\). The convexity implies that the slopes of the consecutive sides form a strictly increasing sequence. The space of such polygonal lines is denoted by \(\Pi\). Let \(X\) be the set of all pairs of coprime positive integers. Lemma. The space \(\Pi\) is in one-to-one correspondence with the space \(C_0 (X)\) of finite nonnegative integer-valued functions \(v(x)\) on \(X\) \((v(x)\) is said to be finite if \(v(x) \neq 0\) only for finitely many \(x)\). This lemma implies that \(\Gamma \in \Pi\) may be thought of as finite configurations of ideal gas of particles at point of \(X\) [see also \textit{A. M. Vershik} [Funct. Anal. Appl. 28, No. 1, 13--20 (1994); translation from Funkts. Anal. Prilozh. 28, No. 1, 16--25 (1994; Zbl 0848.52004)].
- Limit shape of random convex polygonal lines: even more universality
- Universality of the limit shape of convex lattice polygonal lines
- Asymptotics of convex lattice polygonal lines with a constrained number of vertices
- Approximation of convex functions by random polygonal lines
- The limit shape of convex lattice polygons
- Large deviations in the geometry of convex lattice polygons
- Asymptotics of random partitions of a set
- Limit shape of convex lattice polygons having the minimal \(L_\infty\) diameter w. r. t. the number of their vertices
- Convex cones, integral zonotopes, limit shape
- Asymptotics of convex lattice polygonal lines with a constrained number of vertices
- The limit shape of convex lattice polygons
- The limit shape of convex lattice polygons and related topics
- Beyond Hammersley's last-passage percolation: a discussion on possible local and global constraints
- Optimal configurations of lines and a statistical application
- Limit shape of convex lattice polygons with minimal perimeter
- Random points and lattice points in convex bodies
- Limit shape of random convex polygonal lines: even more universality
- Ergodicity of multiplicative statistics
- scientific article; zbMATH DE number 2045480 (Why is no real title available?)
- A problem of random choice and its deterministic structure
- Counting partitions inside a rectangle
- Partitions of large unbalanced bipartites
- Universality of the limit shape of convex lattice polygonal lines
- Boltzmann distribution on ``short integer partitions with power parts: limit laws and sampling
- Statistical mechanics of combinatorial partitions, and their limit shapes
- Probability that n points are in convex position in a regular -gon: asymptotic results
- Fluctuations of lattice zonotopes and polygons
- A proof of the Vershik-Prohorov conjecture on the universality of the limit shape for a class of random polygonal lines
This page was built for publication: Probabilistic approach to the analysis of statistics for convex polygonal lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1896955)
