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

DOI10.1214/15-AAP1100zbMATH Open1408.53109arXiv1310.5924OpenAlexW3104844908MaRDI QIDQ259598FDOQ259598

Authors: Jason Cantarella, Clayton Shonkwiler 

Publication date: 11 March 2016

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

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.

Full work available at URL: https://arxiv.org/abs/1310.5924

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

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)

Cites Work

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

Cited In (21)

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

Uses Software

• Digital Library of Mathematical Functions
• 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)