arXiv research

Estimates log-likelihood of interacting particle systems using virtual particles.

Two SVGD variants achieve fast convergence with provable guarantees.

A new stochastic algorithm approximates optimal distributions without requiring propagation of chaos.

Applying the classical Serre-Swan theorem, as this is extended to topological (non-normed) algebras, one attains a classification of elementary particles via their spin-structure. In this context, our argument is virtually based on a ``correspondence principle'' of S. A. Selesnick, formulated herewith in a sheaf-theore…

New virtualized Δ-move simplifies virtual knots and links.

Virtual index cocycles reformulate virtual link invariants.

The paper studies strict equivalence in multi-virtual linkoids with new invariants.

A computer vision approach improves neutral particle detection in particle flow algorithms.

Jointly estimates flow fields and particle properties from Lagrangian data.

This paper optimizes functions of probability measures using particle gradient descent for displacement convex functions.

The study enumerates virtual quandles up to isomorphism.

New virtual version of Thompson's group created to handle virtual knots.

The paper extends CF-moves to classify virtual links of any number of components.

The excluded area between a pair of two-dimensional hard particles with given relative orientation is the region in which one particle cannot be located due to the presence of the other particle. The magnitude of the excluded area as a function of the relative particle orientation plays a major role in the determinatio…

Refines virtual link equality criterion for diagrams with one virtual crossing.

Differentiable resampling improves particle filter performance.

Extend writhe polynomial from virtual knots to multi-virtual knots

New invariants for virtual knots and links defined via quiver representations.

Study virtualized Delta, Sharp, and Pass moves for oriented virtual knots and links.

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot obtained from the standard (p,q)-torus knot diagram by replacing all crossings o…

This paper connects virtual biquandles to biquandles for virtual link colorings.

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

Optimal weights improve particle-based approximations of discrete distributions.

Virtual knots and links get multicrossings and petal diagrams.

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how p…

A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a virtual string. In this paper we consider three operations on a virtual string …

A virtual $n$-string is a chord diagram with $n$ core circles and a collection of arrows between core circles. We consider virtual $n$-strings up to virtual homotopy, compositions of flat virtual Reidemeister moves on chord diagrams. Given a virtual 1-string $α$, Turaev associated a based matrix that encodes invariants…

Given a virtual knot $K$, we construct a group $VG_K$ called the virtual knot group, and we use the elementary ideals of $VG_K$ to define invariants of $K$ called the virtual Alexander invariants. For instance, associated to the $k=0$ ideal is a polynomial $H_K(s,t,q)$ in three variables which we call the virtual Alexa…

A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative. Normal virtual links have some properties similar to classical links.In this paper, we introduce a method of converting a virtual link d…

Improved particle approximation for mean-field neural networks.

A new particle filter avoids resampling to improve state estimation in high dimensions.

New polynomial invariants for virtual links are stronger than F-polynomials.

We introduce a new sequential Monte Carlo algorithm we call the particle cascade. The particle cascade is an asynchronous, anytime alternative to traditional particle filtering algorithms. It uses no barrier synchronizations which leads to improved particle throughput and memory efficiency. It is an anytime algorithm i…

Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also show that the virtual singular braid monoid has another presentation with fewer g…

Study algebraic invariants of multi-virtual links.

Paper uses averaging from many particle filters to approximate posterior predictive distributions.

The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for virtual crossing number were principally no more than linear in the number of classic…

Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of Lie bi-algebras. Classical knots inject into virtual knots, and flat virtual knots…

Cryo-electron microscopy (cryoEM) is an increasingly popular method for protein structure determination. However, identifying a sufficient number of particles for analysis (often >100,000) can take months of manual effort. Current computational approaches are limited by high false positive rates and require significant…

This paper studies when particle filtering is efficient for planning in partially observed systems.

A virtual link can be understood as a link in a trivial I-bundle over an orientable compact surface with genus. A twisted virtual link is a link in a trivial I-bundle over a not-necessarily orientable compact surface. A twisted virtual birack is an algebraic structure with axioms derived from the twisted virtual Reidem…

We introduce a theory of virtual Legendrian knots. A virtual Legendrian knot is a cooriented wavefront on an oriented surface up to Legendrian isotopy of its lift to the unit cotangent bundle and stabilization and destablization of the surface away from the wavefront. We show that the groups of Vassiliev invariants of …

Interacting particle methods are increasingly used to sample from complex and high-dimensional distributions. These stochastic particle integration techniques can be interpreted as an universal acceptance-rejection sequential particle sampler equipped with adaptive and interacting recycling mechanisms. Practically, the…

Cryo-electron microscopy (cryo-EM) is an emerging experimental method to characterize the structure of large biomolecular assemblies. Single particle cryo-EM records 2D images (so-called micrographs) of projections of the three-dimensional particle, which need to be processed to obtain the three-dimensional reconstruct…

Study virtual braid groups, proving a key subgroup result.

The paper characterizes crystallographic groups derived from virtual braid and twin groups.

New algorithm trains latent diffusion models using interacting particles.

We generalize unoriented handlebody-links to the twisted virtual case, obtaining Reidemeister moves for handlebody-links in ambient spaces of the form $Σ\times [0,1]$ for $Σ$ a compact closed 2-manifold up to stable equivalence. We introduce a related algebraic structure known as twisted virtual bikeigebras whose axiom…