Related papers: Average size of random polygons with fixed knot to…
Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
Inspired by how certain proteins "sense" knots and entanglements in DNA molecules, here we ask if there exist local geometric features that may be used as a read-out of the underlying topology of generic polymers. We perform molecular…
Let $\bX=\{X_n\}_{n\geq 1}$ and $\bY=\{Y_n\}_{n\geq 1}$ be two independent random sequences. We obtain rates of convergence to the normal law of randomly weighted self-normalized sums $$ \psi_n(\bX,\bY)=\sum_{i=1}^nX_iY_i/V_n,\quad…
We consider the $Q$-curvature equation \begin{equation}\label{0.1} (-\Delta)^n u = K(x)e^{2nu}\quad\text{in} ~\mathbb{R}^{2n} \ (n \geq 2) \end{equation} where $K$ is a given non constant continuous function. Under mild growth control on…
In this paper we show how to find nearly optimal embeddings of large trees in several natural classes of graphs. The size of the tree T can be as large as a constant fraction of the size of the graph G, and the maximum degree of T can be…
Consider the geometric graph on $n$ independent uniform random points in a connected compact region $A$ of ${\bf R}^d, d \geq 2$, with $C^2$ boundary, or in the unit square, with distance parameter $r_n$. Let $K_n$ be the number of…
This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…
Many problems are NP-hard and, unless P = NP, do not admit polynomial-time exact algorithms. The fastest known exact algorithms exactly usually take time exponential in the input size. Much research effort has gone into obtaining faster…
In 1991, Yannakakis (J. Comput. System Sci., 1991) proved that no symmetric extended formulation for the matching polytope of the complete graph K_n with n nodes has a number of variables and constraints that is bounded subexponentially in…
For each certain "nice" piecewise linear function $f:[0,1] \to [0,1]$, we consider a family of growing Young diagrams $\{\lambda(f,N)\}_{N=1}^{\infty}$ by enlarging the region under the graph of $f$. We compute asymptotic formulas for the…
We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
We show that for any compact convex set $K$ in $\mathbb{R}^d$ and any finite family $\mathcal{F}$ of convex sets in $\mathbb{R}^d$, if the intersection of every sufficiently small subfamily of $\mathcal{F}$ contains an isometric copy of $K$…
We study random Peano paths on planar square grids that arise from fair random spanning trees. These are trees that are sampled in such a way as to have the same (if possible) edge probabilities. In particular, we are interested in…
Structural properties of evolving random graphs are investigated. Treating linking as a dynamic aggregation process, rate equations for the distribution of node to node distances (paths) and of cycles are formulated and solved analytically.…
It is known that for a convex body K in R^d of volume one, the expected volume of random simplices in K is minimised if K is an ellipsoid, and for d = 2, maximised if K is a triangle. Here we provide corresponding stability estimates.
The varying coefficient model has received broad attention from researchers as it is a powerful dimension reduction tool for non-parametric modeling. Most existing varying coefficient models fitted with polynomial spline assume equidistant…
We define the stabilizing number $\operatorname{sn}(K)$ of a knot $K \subset S^3$ as the minimal number $n$ of $S^2 \times S^2$ connected summands required for $K$ to bound a nullhomotopic locally flat disc in $D^4 \# n S^2 \times S^2$.…
Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…