arXiv subjects

Troy Larsen

Publications and source records attributed to Troy Larsen.

4 recordsLinked to original sources

arXiv2026

A new kernel-based approach for the global sensitivity analysis of models with correlated inputs

We present an HSIC-based approach for global sensitivity analysis of broad classes of models with correlated and possibly function-valued inputs and outputs. To this end, we define the first-order and total HSIC sensitivity indices, which are bounded, interpretable, and moment-independent analogues to the first-order and total-effect Sobol' indices, respectively. These desirable qualities hinge upon the key property of monotonicity under marginalization for the HSIC. We rigorously establish this monotonicity property by using a suitable class of augmented kernels. Furthermore, we provide an efficient algorithm for computing an empirical estimator of the HSIC that significantly reduces computational complexity and storage requirements. The effectiveness and interpretability of the first-order and total HSIC sensitivity indices are demonstrated through computational experiments on models that feature nonlinear relationships, correlated inputs, and functional outputs.

math.ST↗

arXiv2022

Linking number and folded ribbon unknots

We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The folded ribbonlength is the length to width ratio of such a folded ribbon knot. The folded ribbon knot is also a framed knot, and the ribbon linking number is the linking number of the knot and one boundary component of the ribbon. We find the minimum folded ribbonlength for $3$-stick unknots with ribbon linking numbers $\pm1$ and $\pm 3$, and we prove that the minimum folded ribbonlength for $n$-gons with obtuse interior angles is achieved when the $n$-gon is regular. Among other results, we prove that the minimum folded ribbonlength of any folded ribbon unknot which is a topological annulus with ribbon linking number $\pm n$ is bounded from above by $2n$.

math.GT↗

arXiv2021

The Tri-Pants Graph of the Twice-Punctured Torus

We investigate the structure of the tri-pants graph, a simplicial graph introduced by Maloni and Palesi, whose vertices correspond to particular collections of homotopy classes of simple closed curves of the twice-punctured torus, called tri-pants, and whose edges connect two vertices whenever the corresponding pants differ by suitable elementary moves. In particular, by examining the relationship between the tri-pants graph and the dual of the Farey complex, we prove that the tri-pants graph is connected and has infinite diameter.

math.GT↗

arXiv2020

Ribbonlength of families of folded ribbon knots

We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The folded ribbonlength is the length to width ratio of such a ribbon knot. We give upper bounds on the folded ribbonlength of 2-bridge, $(2,q)$ torus, twist, and pretzel knots, and these upper bounds turn out to be linear in the crossing number. We give a new way to fold $(p,q)$ torus knots and show that their folded ribbonlength is bounded above by $2p$. This means, for example, that the trefoil knot can be constructed with a folded ribbonlength of 6. We then show that any $(p,q)$ torus knot $K$ with $p\geq q>2$ has a constant $c>0$, such that the folded ribbonlength is bounded above by $c\cdot Cr(K)^{1/2}$. This provides an example of an upper bound on folded ribbonlength that is sub-linear in crossing number.

math.GT↗