Related papers: Monotonic Simplification and Recognizing Exchange …
We obtain exact travelling wave solutions for three families of stochastic one-dimensional nonequilibrium lattice models with open boundaries. These solutions describe the diffusive motion and microscopic structure of (i) of shocks in the…
The Vlasov-Maxwell equations possess a Hamiltonian structure expressed in terms of a Hamiltonian functional and a functional bracket. In the present paper, the transformation ("lift") of the Vlasov-Maxwell bracket induced by the dynamical…
A finite-state Markov chain is introduced in the noise terms of the three-dimensional stochastic Navier-Stokes equations in order to allow for transitions between two types of multiplicative noises. We call such systems as stochastic…
A {\it stuck knot} is a knot diagram containing designated crossings, called {\it stuck crossings}, whose incident strands are required to remain locally non-separable. These rigidity constraints restrict the allowable ambient isotopies and…
A powerful technique for solving combinatorial optimization problems is to reduce the search space without compromising the solution quality by exploring intrinsic mathematical properties of the problems. For the maximum weight independent…
Sequences of parametrized Lyapunov equations can be encountered in many application settings. Moreover, solutions of such equations are often intermediate steps of an overall procedure whose main goal is the computation of…
The Minkowski's theory is regarded as the classical approach for describing the electromagnetism of uniformly moving objects by elegantly utilizing the format-invariance of the Maxwell's equations in inertia reference frames under Lorentz…
We investigate periodic integrable Markov models, constructed from set-theoretical solutions of the Yang-Baxter equation. We first focus on the simplest class of solutions, called Lyubashenko solutions. We show that the resulting models are…
Robust Markov decision processes (MDPs) aim to handle changing or partially known system dynamics. To solve them, one typically resorts to robust optimization methods. However, this significantly increases computational complexity and…
Many problems in sequential decision making and stochastic control often have natural multiscale structure: sub-tasks are assembled together to accomplish complex goals. Systematically inferring and leveraging hierarchical structure,…
The computation of the radiative transfer equation is expensive mainly due to two stiff terms: the transport term and the collision operator. The stiffness in the former comes from the fact that particles (such as photons) travels at the…
This paper presents a new Monte Carlo (MC) algorithm for time-dependent particle transport problems with global variance reduction based on automatic weight windows (WWs). The centers of WWs at a time step are defined by the solution of an…
In the present work, we consider a variety of two-component, one-dimensional states in nonlinear Schrodinger equations in the presence of a parabolic trap, inspired by the atomic physics context of Bose-Einstein condensates. The use of…
We study the Morton-Franks-Williams inequality for closures of simple braids (also known as positive permutation braids). This allows to prove, in a simple way, that the set of simple braids is a orthonormal basis for the inner product of…
The Recognizability Theorem states that if a set of finite graphs is definable by a monadic second-order (MSO) sentence, then it is recognizable with respect to the graph algebra upon which the definition of clique-width is based.…
Birman--Murakami--Wenzl (BMW) algebra was introduced in connection with knot theory. We treat here interaction round the face solvable (IRF) lattice models. We assume that the face transfer matrix obeys a cubic polynomial equation, which is…
Influence Diagrams (ID) are a flexible tool to represent discrete stochastic optimization problems, including Markov Decision Process (MDP) and Partially Observable MDP as standard examples. More precisely, given random variables considered…
We study the optimal transport problem for pairs of stationary finite-state Markov chains, with an emphasis on the computation of optimal transition couplings. Transition couplings are a constrained family of transport plans that capture…
This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs…
We show that the Maximum Weight Independent Set problem (MWIS) can be solved in quasi-polynomial time on $H$-free graphs (graphs excluding a fixed graph $H$ as an induced subgraph) for every $H$ whose every connected component is a path or…