Related papers: Robinson-Schensted-Knuth algorithm, jeu de taquin …
The classical random walk isomorphism theorems relate the local times of a continuous-time random walk to the square of a Gaussian free field. A Gaussian free field is a spin system that takes values in Euclidean space, and this article…
We provide a unified framework to compute the stationary distribution of any finite irreducible Markov chain or equivalently of any irreducible random walk on a finite semigroup $S$. Our methods use geometric finite semigroup theory via the…
In this paper, a robust sequential quadratic programming method for constrained optimization is generalized to problem with an {expectation} objective function {and} deterministic equality and inequality constraints. A stochastic line…
We present a renormalization group (RG) procedure which works naturally on a wide class of interacting one-dimension models based on perturbed (possibly strongly) continuum conformal and integrable models. This procedure integrates Kenneth…
We study a class of hyperbolic Cauchy problems, associated with linear operators and systems with polynomially bounded coefficients, variable multiplicities and involutive characteristics, globally defined on R^n. We prove well-posedness in…
For piecewise expanding one-dimensional maps without periodic turning points we prove that isolated eigenvalues of small (random) perturbations of these maps are close to isolated eigenvalues of the unperturbed system. (Here ``eigenvalue''…
We obtain Fisher-Hartwig asymptotics with root and jump type singularities in space-time under the law of the stationary Hermitian Ornstein-Uhlenbeck process, which serve as a dynamical generalization of earlier static results obtained by…
According to a conjecture of Lindenstrauss and Tsukamoto, a topological dynamical system $(X,T)$ is embeddable in the $d$-cubical shift $(([0,1]^{d})^{\mathbb{Z}},\ shift)$ if both its mean dimension and periodic dimension are strictly…
We study a class of dynamical systems generated by random substitutions, which contains both intrinsically ergodic systems and instances with several measures of maximal entropy. In this class, we show that the measures of maximal entropy…
We randomize the implicit two-stage Runge-Kutta scheme in order to improve the rate of convergence (with respect to a deterministic scheme) and stability of the approximate solution (with respect to the solution generated by the explicit…
We show that the order on probability measures, inherited from the dominance order on the Young diagrams, is preserved under natural maps reducing the number of boxes in a diagram by $1$. As a corollary we give a new proof of the Thoma…
We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…
This paper presents a combinatorial study of the super plactic monoid of type A, which is related to the representations of the general linear Lie superalgebra. We introduce the analogue of the Sch\"{u}tzenberger's jeu de taquin on the…
A duality formula, of the Hardy and Littlewood type for multidimensional Gaussian sums, is proved in order to estimate the asymptotic long time behavior of distribution of Birkhoff sums $S_n$ of a sequence generated by a skew product…
In this paper, we efficiently compute overapproximating reachable sets for control systems evolving on Lie groups, building off results from monotone systems theory and geometric integration theory. We consider intervals in the tangent…
In this paper, we discover that the class of random polynomials arising from the equilibrium analysis of random asymmetric evolutionary games is \textit{exactly} the Kostlan-Shub-Smale system of random polynomials, revealing an intriguing…
We prove a restriction of an analogue of the Robinson--Schensted--Knuth correspondence for semi-skyline augmented fillings, due to Mason, to multisets of cells of a staircase possibly truncated by a smaller staircase at the upper left end…
We develop two new stochastic Gauss-Newton algorithms for solving a class of non-convex stochastic compositional optimization problems frequently arising in practice. We consider both the expectation and finite-sum settings under standard…
We introduce a new framework for analyzing (Quasi-}Newton type methods applied to non-smooth optimization problems. The source of randomness comes from the evaluation of the (approximation) of the Hessian. We derive, using a variant of…
Randomized iterative algorithms have attracted much attention in recent years because they can approximately solve large-scale linear systems of equations without accessing the entire coefficient matrix. In this paper, we propose two novel…