Related papers: Robinson-Schensted-Knuth algorithm, jeu de taquin …
We construct random dynamics on collections of non-intersecting planar contours, leaving invariant the distributions of length- and area-interacting polygonal Markov fields with V-shaped nodes. The first of these dynamics is based on the…
Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
We study finite state random dynamical systems (RDS) and their induced Markov chains (MC) as stochastic models for complex dynamics. The linear representation of deterministic maps in RDS are matrix-valued random variables whose…
In this paper, we introduce new reference observables to establish a scaling formula in the renormalization group equation. Using the transfer matrix method, we calculate the two point observables of the one dimensional Ising model without…
The dynamics of an infinite system of point particles in $\mathbb{R}^d$, which hop and interact with each other, is described at both micro- and mesoscopic levels. The states of the system are probability measures on the space of…
We study dynamical systems acting on the path space of a stationary (non-simple) Bratteli diagram. For such systems we explicitly describe all ergodic probability measures invariant with respect to the tail equivalence relation (or the…
Promotion permutations have recently been associated to each rectangular standard Young tableau by Gaetz--Pechenik--Pfannerer--Striker--Swanson. Here we relate promotion permutations to the Robinson--Schensted (RS) correspondence. More…
Embedding techniques allow the approximations of finite dimensional attractors and manifolds of infinite dimensional dynamical systems via subdivision and continuation methods. These approximations give a topological one-to-one image of the…
We consider two-player zero-sum stochastic games and propose a two-timescale $Q$-learning algorithm with function approximation that is payoff-based, convergent, rational, and symmetric between the two players. In two-timescale…
We establish a combinatorial connection between the real geometry and the $K$-theory of complex Schubert curves $S(\lambda_\bullet)$, which are one-dimensional Schubert problems defined with respect to flags osculating the rational normal…
We develop a novel switching dynamics that converges to the Karush-Kuhn-Tucker (KKT) point of a nonlinear optimisation problem. This new approach is particularly notable for its lower dimensionality compared to conventional primal-dual…
In this paper we establish an estimate for the rate of convergence of the Krasnosel'ski\v{\i}-Mann iteration for computing fixed points of non-expansive maps. Our main result settles the Baillon-Bruck conjecture [3] on the asymptotic…
We propose a general random subspace framework for unconstrained nonconvex optimization problems that requires a weak probabilistic assumption on the subspace gradient, which we show to be satisfied by various random matrix ensembles, such…
We prove a random Ruelle--Perron--Frobenius theorem and the existence of relative equilibrium states for a class of random open and closed interval maps, without imposing transitivity requirements, such as mixing and covering conditions,…
The influence of a random environment on the dynamics of a fluctuating rough surface is investigated using a field theoretic renormalization group. The environment motion is modelled by the stochastic Navier--Stokes equation, which includes…
We investigate the random dynamics of rational maps on the Riemann sphere and the dynamics of semigroups of rational maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, in most cases, the chaos of the…
We describe random generation algorithms for a large class of random combinatorial objects called Schur processes, which are sequences of random (integer) partitions subject to certain interlacing conditions. This class contains several…
There exists a well-known hook-length formula for calculating the dimensions of 2D Young diagrams. Unfortunately, the analogous formula for 3D case is unknown. We introduce an approach for calculating the estimations of dimensions of…
The real-space renormalization group (RSRG) method introduced previously for the Brownian landscape is generalized to obtain the joint probability distribution of the subset of the important extrema at large scales of other one-dimensional…