Related papers: Random Simple-Homotopy Theory
Random projection (RP) is a powerful dimension reduction technique widely used in the analysis of high dimensional data. We demonstrate how this technique can be used to improve the computational efficiency of gravitational wave searches…
We review models of random geometries based on the dynamical lattice approach. We discuss one dimensional model of simplicial complexes (branched polymers), two dimensional model of dynamical triangulations and four dimensional model of…
In this work, we explore how conventional motion planning algorithms can be reapplied to contact-rich manipulation tasks. Rather than focusing solely on efficiency, we investigate how manipulation aspects can be recast in terms of…
Random reshuffling with momentum (RRM) corresponds to the SGD optimizer with momentum option enabled, as found in many machine learning libraries like PyTorch and TensorFlow. Despite its widespread use, the convergence properties of RRM do…
Probabilistic sampling methods have become very popular to solve single-shot path planning problems. Rapidly-exploring Random Trees (RRTs) in particular have been shown to be efficient in solving high dimensional problems. Even though…
We use the cylindrical homomorphism and a geometric construction introduced by J. Lewis to study the Lawson homology groups of certain hypersurfaces $X\subset \mathbb{P}^{n+1}$ of degree $d\leq n+1$. As an application, we compute the…
There has been considerable recent interest, primarily motivated by problems in applied algebraic topology, in the homology of random simplicial complexes. We consider the scenario in which the vertices of the simplices are the points of a…
We consider the stochastic gradient method with random reshuffling ($\mathsf{RR}$) for tackling smooth nonconvex optimization problems. $\mathsf{RR}$ finds broad applications in practice, notably in training neural networks. In this work,…
Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…
This paper proposes a sampling based planning algorithm to control autonomous vehicles. We propose an improved Rapidly-exploring Random Tree which includes the definition of K- nearest points and propose a two-stage sampling strategy to…
Brehm and K\"uhnel (1992) constructed three 15-vertex combinatorial 8-manifolds `like the quaternionic projective plane' with symmetry groups $\mathrm{A}_5$, $\mathrm{A}_4$, and $\mathrm{S}_3$, respectively. Gorodkov (2016) proved that…
The harmonic Lanczos bidiagonalization method can be used to compute the smallest singular triplets of a large matrix $A$. We prove that for good enough projection subspaces harmonic Ritz values converge if the columns of $A$ are strongly…
The stochastic simulation algorithm (SSA) is widely used to perform exact forward simulation of discrete stochastic processes in biology. However, the computational cost, driven by sequential event-by-event sampling across large ensembles,…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
We compute the spectral form factor of the modular Hamiltonian $K=-\ln\rho_A$ associated to the reduced density matrix of a Haar random state. A ramp is demonstrated and we find an analytic expression for its slope. Our method involves an…
We review a collection of models of random simplicial complexes together with some of the most exciting phenomena related to them. We do not attempt to cover all existing models, but try to focus on those for which many important results…
We study random simplicial complexes in the multi-parameter upper model. In this model simplices of various dimensions are taken randomly and independently, and our random simplicial complex $Y$ is then taken to be the minimal simplicial…
Asymptotic analysis on some statistical properties of the random binary-tree model is developed. We quantify a hierarchical structure of branching patterns based on the Horton-Strahler analysis. We introduce a transformation of a binary…
We present extremal constructions connected with the property of simplicial collapsibility. (1) For each $d \ge 2$, there are collapsible (and shellable) simplicial $d$-complexes with only one free face. Also, there are non-evasive…
We propose a novel algorithm for large-scale regression problems named histogram transform ensembles (HTE), composed of random rotations, stretchings, and translations. First of all, we investigate the theoretical properties of HTE when the…