Related papers: Monotonic Simplification and Recognizing Exchange …
We consider a mixed formulation of parametrized elasticity problems in terms of stress, displacement, and rotation. The latter two variables act as Lagrange multipliers to enforce conservation of linear and angular momentum. Due to the…
We consider an area-preserving diffeomorphism of a compact surface, which is assumed to be an irrational rotation near each boundary component. A finite set of periodic orbits of the diffeomorphism gives rise to a braid in the mapping…
A method is proposed to identify target states that optimize a metastability index amongst a set of trial states and use these target states as milestones (or core sets) to build Markov State Models (MSMs). If the optimized metastability…
Non-concave maximization has been the subject of much recent study in the optimization and machine learning communities, specifically in deep learning. Recent papers Ge et al, Lee et al (and references therein) indicate that first order…
In this paper we focus on the pathwise stability of mild solutions for a class of stochastic partial differential equations which are driven by switching-diffusion processes with jumps. In comparison to the existing literature, we show…
We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…
Novel Markov Chain Monte Carlo (MCMC) methods have enabled the generation of large ensembles of redistricting plans through graph partitioning. However, existing algorithms such as Reversible Recombination (RevReCom) and Metropolized Forest…
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these approaches, a large, stochastic decision problem is divided into…
We propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination. In this class, the well-quasi-ordered (wqo) condition is relaxed such that it is…
Variable steps implicit-explicit multistep methods for PDEs have been presented in [17], where the zero-stability is studied for ODEs; however, the stability analysis still remains an open question for PDEs. Based on the idea of linear…
We study the tamed magnetohydrodynamics equations, introduced recently in a paper by the author, perturbed by multiplicative Wiener noise of transport type on the whole space $\mathbb{R}^{3}$ and on the torus $\mathbb{T}^{3}$. In a first…
Shielding studies in neutron transport, with Monte Carlo codes, yield challenging problems of small-probability estimation. The particularity of these studies is that the small probability to estimate is formulated in terms of the…
Characterizing whether a Markov process of discrete random variables has an homogeneous continuous-time realization is a hard problem. In practice, this problem reduces to deciding when a given Markov matrix can be written as the…
The structure of Markov equivalence classes (MECs) of causal DAGs has been studied extensively. A natural question in this regard is to algorithmically find the number of MECs with a given skeleton. Until recently, the known results for…
We demonstrate the remarkable effectiveness of boundary value formulations coupled to numerical continuation for the computation of stable and unstable manifolds in systems of ordinary differential equations. Specifically, we consider the…
We prove a Markov theorem for tame links in a connected closed orientable 3-manifold $M$ with respect to a plat-like representation. More precisely, given a genus $g$ Heegaard surface $\Sigma_g$ for $M$ we represent each link in $M$ as the…
Optimal Morse matchings reveal essential structures of cell complexes which lead to powerful tools to study discrete geometrical objects, in particular discrete 3-manifolds. However, such matchings are known to be NP-hard to compute on…
A simple braid is a positive braid that can be drawn so that any two strands cross at most once. We prove that as $n \to \infty$, the proportion of simple braids on $n$ strands that have positive topological entropy tends toward $100\%$.…
Cell-fate transition can be modeled by ordinary differential equations (ODEs) which describe the behavior of several molecules in interaction, and for which each stable equilibrium corresponds to a possible phenotype (or 'biological…
Molecular motors and other complex nonequilibrium systems are controlled by large sets of design parameters, and optimizing those parameters requires computing sensitivities -- derivatives of dynamical observables with respect to the…