Related papers: Stability in a group
This work establishes rigorous, novel and widely applicable stability guarantees and transferability bounds for graph convolutional networks -- without reference to any underlying limit object or statistical distribution. Crucially,…
This note is a commentary on the model-theoretic interpretation of Grothendieck's double limit characterization of weak relative compactness.
Let G be a connected reductive group defined over a non-archimedean local field of characteristic 0. We assume G is quasi-split, adjoint and absolutly simple. Let g be the Lie algebra of G. We consider the space of the invariant…
A new proof of a result of Lutz Weis is given, that states that the stability of a positive strongly continuous semigroup $(e^{tA})_{t \ge 0}$ on $L_p$ may be determined by the quantity $s(A)$. We also give an example to show that the…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
We investigate the regularity of the strongly continuous semigroup associated with a system of two coupled second order evolution equations with indirect damping, whose stability was recently studied by Hao et al. By deriving the asymptotic…
We consider a cantilevered (clamped-free) beam in an axial potential flow. Certain flow velocities may bring about a bounded-response instability in the structure, termed {\em flutter}. As a preliminary analysis, we employ the theory of…
We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…
This paper answers the question if a qualitatively heterogeneous passive networked system containing damped and undamped nodes shows consensus in the output of the nodes in the long run. While a standard Lyapunov analysis shows that the…
We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…
Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…
We give a sufficient condition for the nonlinear stability of steady flows of a two-dimensional ideal fluid in a bounded multiply-connected domain, which generalizes a stability criterion proved by Arnold in the 1960s. The most important…
A square (0,1)-matrix X of order n > 0 is called fully indecomposable if there exists no integer k with 0 < k < n, such that X has a k by n-k zero submatrix. A stable set of a graph G is a subset of pairwise nonadjacent vertices. The…
The stability against perturbations of a dynamical system conserving a generalized phase-space volume is studied by exploiting the similarity between statistical physics formalism and that of ergodic theory. A general continuity theorem is…
A linear stability analysis of the hydrodynamic equations of a model for confined quasi-two-dimensional granular gases is carried out. The stability analysis is performed around the homogeneous steady state (HSS) reached eventually by the…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We characterize stability of graph C*-algebras by giving five conditions equivalent to their stability. We also show that if G is a graph with no sources, then C*(G) is stable if and only if each vertex in G can be reached by an infinite…
The global steady state of a system in thermal equilibrium exponentially favors configurations with lesser energy. This principle is a powerful explanation of self-organization because energy is a local property of a configuration. For…
The word stable is used to describe a situation when mathematical objects that almost satisfy an equation are close to objects satisfying it exactly. We study operator-algebraic forms of stability for unitary representations of groups and…
We present a method which provides a unified framework for most stability theorems that have been proved in graph and hypergraph theory. Our main result reduces stability for a large class of hypergraph problems to the simpler question of…