Related papers: Stability in a group
We prove a homological stability theorem for the subgroup of the mapping class group acting as the identity on some fixed portion of the first homology group of the surface. We also prove a similar theorem for the subgroup of the mapping…
We study ergodic properties of a family of traffic maps acting in the space of bi-infinite sequences of real numbers. The corresponding dynamics mimics the motion of vehicles in a simple traffic flow, which explains the name. Using…
It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…
As a common generalization of previously solved optimization problems concerning bipartite stable matchings, we describe a strongly polynomial network flow based algorithm for computing $\ell$ disjoint stable matchings with minimum total…
We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…
We develop a bipartite rigidity theory for bipartite graphs parallel to the classical rigidity theory for general graphs, and define for two positive integers $k,l$ the notions of $(k,l)$-rigid and $(k,l)$-stress free bipartite graphs. This…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…
We show that if $G$ is a discrete Abelian group and $A \subset G$ has $\|1_A\|_{B(G)} \leq M$ then $A$ is $O(\exp(\pi M))$-stable in the sense of Terry and Wolf.
In this work we prove that the local $\gamma$-factor arising from the doubling integrals for split general spin groups is stable. This deep property of the $\gamma$-factor constitutes an important ingredient in the application of the…
We investigate the linear instability of flows that are stable according to Rayleigh's criterion for rotating fluids. Using Taylor-Couette flow as a primary test case, we develop large Reynolds number matched asymptotic expansion theories.…
A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…
Motivated by data on coauthorships in scientific publications, we analyze a team formation process that generalizes matching models and network formation models, allowing for overlapping teams of heterogeneous size. We apply different…
Let {\phi} be an automorphism on a connected Lie group G. Through several G-subgroups associated to the dynamics of {\phi} we analyze their topological entropy. Assume that G belongs to the class of finite semisimple center Lie groups which…
Suppose that two vector fields on a smooth manifold render some equilibrium point globally asymptotically stable (GAS). We show that there exists a homotopy between the corresponding semiflows such that this point remains GAS along this…
We show that a $k$-stable set in a finite group can be approximated, up to given error $\epsilon>0$, by left cosets of a subgroup of index $\epsilon^{\text{-}O_k(1)}$. This improves the bound in a similar result of Terry and Wolf on stable…
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…
The two-phase horizontally periodic quasistationary Stokes flow in $\mathbb{R}^2$, describing the motion of two immiscible fluids with equal viscosities that are separated by a sharp interface, which is parameterized as the graph of a…
In this paper, we exploit the theory of dense graph limits to provide a new framework to study the stability of graph partitioning methods, which we call structural consistency. Both stability under perturbation as well as asymptotic…
This paper provides sufficient conditions for global asymptotic stability and global exponential stability, which can be applied to nonlinear, large-scale, uncertain discrete-time systems. The conditions are derived by means of vector…
We develop a method to prove almost global stability of stochastic differential equations in the sense that almost every initial point (with respect to the Lebesgue measure) is asymptotically attracted to the origin with unit probability.…