Direct sampling of confined polygons in linear time
From MaRDI portal
Cites work
- A fast direct sampling algorithm for equilateral closed polygons
- A fast ergodic algorithm for generating ensembles of equilateral random polygons
- A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
- A maximal entropy stochastic process for a timed automaton
- A new operation on sequences: The boustrophedon transform
- A survey of alternating permutations
- All prime knots through 10 crossings have superbridge index 5
- Analytic combinatorics
- Approximating the centroid is hard
- Asymptotics of knotted lattice polygons
- Bernoulli-Euler updown numbers associated with function singularities, their combinatorics and arithmetics
- Boltzmann samplers for first-order differential specifications
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- CoBarS: Fast reweighted sampling for polygon spaces in any dimension
- Collocation Methods for Volterra Integral and Related Functional Differential Equations
- Computing the Conformal Barycenter
- Counting linear extensions
- Curvature of random walks and random polygons in confinement
- De nouvelles significations enumeratives des nombres d'Entringer
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Expansions of \(\text{sec}x\) and \(\text{tang}x\).
- Generating equilateral random polygons in confinement
- Generating equilateral random polygons in confinement. II
- Generating equilateral random polygons in confinement. III
- Geometric characterizations of centroids of simplices
- Hard Enumeration Problems in Geometry and Combinatorics
- Hit and run as a unifying device
- scientific article; zbMATH DE number 6007664 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 742629 (Why is no real title available?)
- scientific article; zbMATH DE number 894522 (Why is no real title available?)
- scientific article; zbMATH DE number 3233639 (Why is no real title available?)
- Knots with exactly 10 sticks
- KNOTTING OF REGULAR POLYGONS IN 3-SPACE
- Knotting spectrum of polygonal knots in extreme confinement
- Models of random knots
- New computations of the superbridge index
- New Stick Number Bounds from Random Sampling of Confined Polygons
- New superbridge index calculations from non-minimal realizations
- On alternating permutations
- On computing the number of linear extensions of a tree
- On the problem of random vibrations, and of random flights in one, two or three dimensions.
- On the shape of polynomial curves.
- Optimal generation of strictly increasing binary trees and beyond
- Principal -cone for a tree
- Rectangular Young tableaux and the Jacobi ensemble
- Rectangular Young tableaux with local decreases and the density method for uniform random generation
- Relative frequencies of alternating and nonalternating prime knots and composite knots in random knot spaces
- Statistical topology of closed curves: some applications in polymer physics
- The \(f\)-vector of the descent polytope
- The density method and permutations with a prescribed descent set
- The generation of random equilateral polygons
- The knot spectrum of confined random equilateral polygons
- The Knotting of Equilateral Polygons in R3
- The principal numbers of K. Saito for the types \(A_{l}, D_{l}\) and \(E_{l}\)
- The symplectic geometry of closed equilateral random walks in 3-space
- The symplectic geometry of polygons in Euclidean space
- Total curvature and total torsion of knotted random polygons in confinement
- Two poset polytopes
- Zigzags with Bürgi, Bernoulli, Euler and the Seidel-Entringer-Arnol'd triangle
This page was built for publication: Direct sampling of confined polygons in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7230405)
