English
Related papers

Related papers: Average size of random polygons with fixed knot to…

200 papers

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were…

Computational Geometry · Computer Science 2011-03-24 Nathan M. Dunfield , Anil N. Hirani

We prove that a random linear code over F_q, with probability arbitrarily close to 1, is list decodable at radius (1-1/q-\epsilon) with list size L=O(1/\epsilon^2) and rate R=\Omega_q(\epsilon^2/(log^3(1/\epsilon))). Up to the…

Information Theory · Computer Science 2012-07-06 Mahdi Cheraghchi , Venkatesan Guruswami , Ameya Velingker

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

Geometric Topology · Mathematics 2007-05-23 Thomas Fiedler

This paper investigates the stability of the least squares approximation $P_m^n$ within the univariate polynomial space of degree $m$, denoted by ${\mathbb P}_m$. The approximation $P_m^n$ entails identifying a polynomial in ${\mathbb P}_m$…

Numerical Analysis · Mathematics 2026-02-17 Zhiqiang Xu , Xinyue Zhang

In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median,…

Statistical Mechanics · Physics 2019-10-28 Jason Cantarella , Kyle Chapman , Philipp Reiter , Clayton Shonkwiler

In a random key graph (RKG) of $n$ nodes each node is randomly assigned a key ring of $K_n$ cryptographic keys from a pool of $P_n$ keys. Two nodes can communicate directly if they have at least one common key in their key rings. We assume…

Information Theory · Computer Science 2013-05-03 B. Santhana Krishnan , Ayalvadi Ganesh , D. Manjunath

I show how one can use lattice methods to calculate various continuum properties of SU(N) gauge theories; in part to explore old ideas that N=3 might be close to N=infinity. I describe calculations of the low-lying `glueball' mass spectrum,…

High Energy Physics - Lattice · Physics 2009-11-07 M. Teper

In this paper we introduce a new sequence of quantities for random polytopes. Let $K_N=\conv\{X_1,...,X_N\}$ be a random polytope generated by independent random vectors uniformly distributed in an isotropic convex body $K$ of $\R^n$. We…

Functional Analysis · Mathematics 2012-11-13 David Alonso-Gutierrez , Nikos Dafnis , Maria A. Hernandez Cifre , Joscha Prochno

The scaling properties of self-avoiding polymerized 2-dimensional membranes are studied via renormalization group methods based on a multilocal operator product expansion. The renormalization group functions are calculated to second order.…

Condensed Matter · Physics 2009-10-28 Kay Joerg Wiese , Francois David

The weights of a neural network are typically initialized at random, and one can think of the functions produced by such a network as having been generated by a prior over some function space. Studying random networks, then, is useful for a…

Machine Learning · Statistics 2018-11-28 Kevin K. Chen , Anthony C. Gamst , Alden K. Walker

The statistical mechanics of a long knotted collapsed polymer is determined by a free-energy with a knot-dependent subleading term, which is linked to the length of the shortest polymer that can hold such knot. The only other parameter…

Statistical Mechanics · Physics 2014-12-01 Marco Baiesi , Enzo Orlandini , Attilio L. Stella

Let $X_1,\dots,X_n$ be i.i.d. log-concave random vectors in $\mathbb R^d$ with mean 0 and covariance matrix $\Sigma$. We study the problem of quantifying the normal approximation error for $W=n^{-1/2}\sum_{i=1}^nX_i$ with explicit…

Probability · Mathematics 2023-05-30 Xiao Fang , Yuta Koike

Random K-out graphs are used in several applications including modeling by sensor networks secured by the random pairwise key predistribution scheme, and payment channel networks. The random K-out graph with $n$ nodes is constructed as…

Information Theory · Computer Science 2022-10-12 Mansi Sood , Osman Yagan

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Probability · Mathematics 2007-05-23 Mathew D. Penrose , J. E. Yukich

We study growth of absolute and homological $k$-dimensional systoles of arithmetic $n$-manifolds along congruence coverings. Our main interest is in the growth of systoles of manifolds whose real rank $r > 1$. We observe, in particular,…

Geometric Topology · Mathematics 2024-05-02 Mikhail Belolipetsky , Shmuel Weinberger

Random graphs are an important tool for modelling and analyzing the underlying properties of complex real-world networks. In this paper, we study a class of random graphs known as the inhomogeneous random K-out graphs which were recently…

Information Theory · Computer Science 2022-10-06 Mansi Sood , Osman Yağan

We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…

Geometric Topology · Mathematics 2016-10-12 Jason Cantarella , Harrison Chapman , Matt Mastin

We study knotted polymers in equilibrium with an array of obstacles which models confinement in a gel or immersion in a melt. We find a crossover in both the geometrical and the topological behavior of the polymer. When the polymers' radius…

Soft Condensed Matter · Physics 2013-05-29 Enzo Orlandini , Attilio L. Stella , Carlo Vanderzande

The presence of a random magnetic field in ferromagnetic systems leads, in the broken phase, to an anomalous $O(\sqrt{1/N})$ convergence of some thermodynamic quantities to their asymptotic limits. Here we show a general method, based on…

Disordered Systems and Neural Networks · Physics 2014-10-16 Carlo Lucibello , Flaviano Morone , Giorgio Parisi , Federico Ricci-Tersenghi , Tommaso Rizzo

Ellis, Filmus, and Friedgut proved an old conjecture of Simonovits and S\'os showing that the maximum size of a triangle-intersecting family of graphs on $n$ vertices has size at most $2^{\binom{n}{2} - 3}$, with equality for the family of…

Combinatorics · Mathematics 2021-04-02 Aaron Berger , Yufei Zhao