Related papers: Constraint stability in permutations and action tr…
We study actions of groups by homeomorphisms on $\mathbf{R}$ (or an interval) that are minimal, have solvable germs at $\pm \infty$ and contain a pair of elements of a certain type. We call such actions coherent. We establish that such an…
In this paper we define and investigate a class of groups characterized by a representation-theoretic property we call purely noncommuting or PNC. This property guarantees that the group has an action on a smooth projective variety with…
We discuss a general framework of monotone skew-product semiflows under a connected group action. In a prior work, a compact connected group $G$-action has been considered on a strongly monotone skew-product semiflow. Here we relax the…
The present article considers stability of the solutions to nonlinear and nonautonomous compartmental systems governed by ordinary differential equations (ODEs). In particular, compartmental systems with a right-hand side that can be…
Model averaging techniques based on resampling methods (such as bootstrapping or subsampling) have been utilized across many areas of statistics, often with the explicit goal of promoting stability in the resulting output. We provide a…
The existence of the {\em typical set} is key for data compression strategies and for the emergence of robust statistical observables in macroscopic physical systems. Standard approaches derive its existence from a restricted set of…
For \Gamma a countable amenable group consider those actions of \Gamma as measure-preserving transformations of a standard probability space, written as {T_\gamma}_{\gamma \in \Gamma} acting on (X,{\cal F}, \mu). We say…
We introduce the notion of hyperfiniteness for permutation actions of countable groups on countable sets and give a geometric and analytic characterization, similar to the known characterizations for amenable actions. We also answer a…
Various types of stabilizing controls lead to a deterministic difference equation with the following property: once the initial value is positive, the solution tends to the unique positive equilibrium. Introducing additive perturbations can…
We use algebraic arc complexes to prove a homological stability result for symplectic groups with slope 2/3 for rings with finite unitary stable rank. Symplectic groups are here interpreted as the automorphism groups of formed spaces with…
We consider an action of a countable amenable group on a compact metric space, focusing on the set of generic points with respect to a fixed F{\o}lner sequence. For a given characteristic class, we prove that the set of points that are…
A system made up of N interacting species is considered. Self-reaction terms are assumed of the logistic type. Pairwise interactions take place among species according to different modalities, thus yielding a complex asymmetric disordered…
This paper addresses the stability analysis of infinite-dimensional sampled-data systems under unbounded perturbations. We present two classes of unbounded perturbations preserving the exponential stability of sampled-data systems. To this…
The relationship between overparameterization, stability, and generalization remains incompletely understood in the setting of discontinuous classifiers. We address this gap by establishing a generalization bound for finite function classes…
We study the stable behaviour of discrete dynamical systems where the map is convex and monotone with respect to the standard positive cone. The notion of tangential stability for fixed points and periodic points is introduced, which is…
We examine the issue of stability of probability in reasoning about complex systems with uncertainty in structure. Normally, propositions are viewed as probability functions on an abstract random graph where it is implicitly assumed that…
Permutations of correlated sequences of random variables appear naturally in a variety of applications such as graph matching and asynchronous communications. In this paper, the asymptotic statistical behavior of such permuted sequences is…
Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
We introduce the notion of continuous twisted partial actions of a locally compact group on a C*-algebra. With such, we construct an associated C*-algebraic bundle called the semidirect product bundle. Our main theorem shows that, given any…