Related papers: Constraint stability in permutations and action tr…
We establish the tracial stability of a certain class of graph products of C*-algebras. This result involves the development of the "pincushion class" of finite graphs. We then apply this result in two ways. The first application yields a…
Turing instabilities for a two species reaction-diffusion systems is studied under anisotropic diffusion. More specifically, the diffusion constants which characterize the ability of the species to relocate in space are direction sensitive.…
We define and study notions of amenability and skew-amenability of continuous actions of topological groups on compact topological spaces. Our main motivation is the question under what conditions amenability of a topological group passes…
By definition, transverse intersections are stable under infinitesimal perturbations. Using persistent homology, we extend this notion to a measure. Given a space of perturbations, we assign to each homology class of the intersection its…
Within the exact renormalisation group approach, it is shown that stability properties of the flow are controlled by the choice for the regulator. Equally, the convergence of the flow is enhanced for specific optimised choices for the…
We stabilize the full Arthur-Selberg trace formula for the metaplectic covering of symplectic groups over a number field. This provides a decomposition of the invariant trace formula for metaplectic groups, which encodes information about…
If matrices almost satisfying a group relation are close to matrices exactly satisfying the relation, then we say that a group is matricially stable. Here "almost" and "close" are in terms of the Hilbert-Schmidt norm. Using tracial 2-norm…
A canonical formalism and constraint analysis for discrete systems subject to a variational action principle are devised. The formalism is equivalent to the covariant formulation, encompasses global and local discrete time evolution moves…
Stochastic contraction analysis is a recently developed tool for studying the global stability properties of nonlinear stochastic systems, based on a differential analysis of convergence in an appropriate metric. To date, stochastic…
Given a minimal action $G\curvearrowright X$ of a countable group $G$ on a compact space $X$, we prove that if the reduced crossed product $G\ltimes_rC(X)$ is simple, then there exists a point whose stabilizer subgroup has trivial amenable…
We study discrete time linear constrained switching systems with additive disturbances, in which the switching may be on the system matrices, the disturbance sets, the state constraint sets or a combination of the above. In our general…
In this paper we study stable finiteness of ample groupoid algebras with applications to inverse semigroup algebras and Leavitt path algebras, recovering old results and proving some new ones. In addition, we develop a theory of (faithful)…
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
This article studies a structural aspect of measure-preserving actions of products of countable discrete groups, involving a so-called 'synergodic decomposition' in terms of the ergodic components of the actions of the two factor groups. We…
We derive a sufficient condition for stability in probability of an equilibrium of a randomly perturbed map in ${\mathbb R}^d$. This condition can be used to stabilize weakly unstable equilibria by random forcing. Analytical results on…
Trace Dynamics is a classical dynamical theory of noncommuting matrices in which cyclic permutation inside a trace is used to define the derivative with respect to an operator. We use the methods of Trace Dynamics to construct a…
Consider an ergodic non-singular action $\Gamma \cc B$ of a countable group on a probability space. The type of this action codes the asymptotic range of the Radon-Nikodym derivative, also called the {\em ratio set}. If $\Gamma \cc X$ is a…
Stability is a central property in learning and statistics promising the output of an algorithm $A$ does not change substantially when applied to similar datasets $S$ and $S'$. It is an elementary fact that any sufficiently stable algorithm…
We propose an algorithm for creating stable, ordered, swarms of active robotic agents arranged in any given pattern. The strategy involves suppressing a class of fluctuations known as "non-affine" displacements, viz. those involving…
We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to…