The symplectic geometry of closed equilateral random walks in 3-space

DOI10.1214/15-AAP1100MaRDI QIDQ259598zbMATH OpenOpenAlexFDO

Authors Jason Cantarella, Clayton Shonkwiler

Publication date 11 March 2016

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1310.5924, https://projecteuclid.org/euclid.aoap/1452003247

zbMATH Keywords

closed random walkcrankshaft algorithmDuistermaat-Heckman theoremrandom knotrandom polygonstatistics on Riemannian manifolds

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Symplectic structures of moduli spaces (53D30)

Abstract: A closed equilateral random walk in 3-space is a selection of unit length vectors giving the steps of the walk conditioned on the assumption that the sum of the vectors is zero. The sample space of such walks with $n$ edges is the $(2n-3)$-dimensional Riemannian manifold of equilateral closed polygons in $mathbb{R}^3$. We study closed random walks using the symplectic geometry of the $(2n-6)$-dimensional quotient of the manifold of polygons by the action of the rotation group $operatornameSO(3)$. The basic objects of study are the moment maps on equilateral random polygon space given by the lengths of any $(n-3)$-tuple of nonintersecting diagonals. The Atiyah-Guillemin-Sternberg theorem shows that the image of such a moment map is a convex polytope in $(n-3)$-dimensional space, while the Duistermaat-Heckman theorem shows that the pushforward measure on this polytope is Lebesgue measure on $mathbb{R}^{n-3}$. Together, these theorems allow us to define a measure-preserving set of "action-angle" coordinates on the space of closed equilateral polygons. The new coordinate system allows us to make explicit computations of exact expectations for total curvature and for some chord lengths of closed (and confined) equilateral random walks, to give statistical criteria for sampling algorithms on the space of polygons and to prove that the probability that a randomly chosen equilateral hexagon is unknotted is at least $frac12$. We then use our methods to construct a new Markov chain sampling algorithm for equilateral closed polygons, with a simple modification to sample (rooted) confined equilateral closed polygons. We prove rigorously that our algorithm converges geometrically to the standard measure on the space of closed random walks, give a theory of error estimators for Markov chain Monte Carlo integration using our method and analyze the performance of our method. Our methods also apply to open random walks in certain types of confinement, and in general to walks with arbitrary (fixed) edgelengths as well as equilateral walks.

Recommendations

• Open and closed random walks with fixed edgelengths in \(\mathbf{\mathbb{R}^d}\)
• Probability theory of random polygons from the quaternionic viewpoint
• Curvature of random walks and random polygons in confinement
• A fast ergodic algorithm for generating ensembles of equilateral random polygons
• A fast direct sampling algorithm for equilateral closed polygons

Cites work

• scientific article; zbMATH DE number 1375577 (Why is no real title available?)
• scientific article; zbMATH DE number 3459608 (Why is no real title available?)
• scientific article; zbMATH DE number 3498981 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 742629 (Why is no real title available?)
• scientific article; zbMATH DE number 5037109 (Why is no real title available?)
• scientific article; zbMATH DE number 3405320 (Why is no real title available?)
• scientific article; zbMATH DE number 3107660 (Why is no real title available?)
• A Note on the Zero-one Law
• A bijection between well-labelled positive paths and matchings
• A fast ergodic algorithm for generating ensembles of equilateral random polygons
• A local limit theorem for random walks conditioned to stay positive
• A note on the proof of the zero-one law of Blum and Pathak
• A note on the sum of uniform random variables
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Adaptive Gibbs samplers and related MCMC methods
• An optimal convex hull algorithm in any fixed dimension
• Characteristics of shape and knotting in ideal rings
• Cohomologie équivariante des points semi-stables.
• Convexity and Commuting Hamiltonians
• Convexity properties of the moment mapping
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Generating equilateral random polygons in confinement
• Generating equilateral random polygons in confinement. II
• Generating equilateral random polygons in confinement. III
• Geometric ergodicity and hybrid Markov chains
• Hit-and-Run from a Corner
• Hit-and-run mixes fast
• Hyperkähler metrics and supersymmetry
• Intersection theory on symplectic quotients of products of spheres.
• Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements
• KNOTTING OF REGULAR POLYGONS IN 3-SPACE
• Lectures on symplectic geometry
• Markov chains for exploring posterior distributions. (With discussion)
• NIST handbook of mathematical functions
• On the symplectic volume of the moduli space of spherical and Euclidean polygons
• On the variation in the cohomology of the symplectic form of the reduced phase space
• Polygon spaces and Grassmannians
• Probability theory of random polygons from the quaternionic viewpoint
• Reduction of symplectic manifolds with symmetry
• Slices, slabs, and sections of the unit hypercube
• Some remarkable properties of sinc and related integrals
• Statistical topology of closed curves: some applications in polymer physics
• Symplectic volume of the moduli space of spatial polygons
• THE USE OF THE HANKEL TRANSFORM IN STATISTICS
• The Cohomology Rings of Moduli Spaces of Bundles over Riemann Surfaces
• The Duistermaat-Heckman formula and the cohomology of moduli spaces of polygons
• The cohomology ring of polygon spaces
• The embedding space of hexagonal knots
• The expected total curvature of random polygons
• The generation of random equilateral polygons
• The symplectic geometry of polygons in Euclidean space
• The toric geometry of triangulated polygons in Euclidean space
• Under-knotted and over-knotted polymers. I: Unrestricted loops
• polymake: a framework for analyzing convex polytopes

Cited in

(21)

• Knot probabilities in equilateral random polygons
• scientific article; zbMATH DE number 7038802 (Why is no real title available?)
• A fast direct sampling algorithm for equilateral closed polygons
• CoBarS: Fast reweighted sampling for polygon spaces in any dimension
• Generating equilateral random polygons in confinement. III
• Knotting probability of equilateral hexagons
• Knots with exactly 10 sticks
• A symmetric random walk defined by the time-one map of a geodesic flow
• Models of random knots
• Knotting spectrum of polygonal knots in extreme confinement
• A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
• Random Triangles and Polygons in the Plane
• Open and closed random walks with fixed edgelengths in \(\mathbf{\mathbb{R}^d}\)
• Probability theory of random polygons from the quaternionic viewpoint
• New Stick Number Bounds from Random Sampling of Confined Polygons
• Relative frequencies of alternating and nonalternating prime knots and composite knots in random knot spaces
• Total curvature and total torsion of knotted random polygons in confinement
• An ergodic algorithm for generating knots with a prescribed injectivity radius
• Random cyclic dynamical systems
• Toric symplectic geometry and full spark frames
• Symplectic geometry and connectivity of spaces of frames

Describes a project that uses

Uses Software

• DLMF
• polymake

This page was built for publication: The symplectic geometry of closed equilateral random walks in 3-space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259598)