相关论文: Stability for large forbidden subgraphs

We investigate a hierarchy of semidefinite bounds $\vartheta^{(r)}(G)$ for the stability number $\alpha(G)$ of a graph $G$, based on its copositive programming formulation and introduced by de Klerk and Pasechnik [{\em SIAM J. Optim.} 12…

We consider the stability of synchronized chaos in coupled map lattices and in coupled ordinary differential equations. Applying the theory of Hermitian and positive semidefinite matrices we prove two results that give simple bounds on…

A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…

Let $G$ be an $n$-node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC'17) for bimodular integer programs can be used to find a maximum weight stable set in $G$ in strongly polynomial time.…

Tur\'an's Theorem says that an extremal $K_{r+1}$-free graph is $r$-partite. The Stability Theorem of Erd\H{o}s and Simonovits shows that if a $K_{r+1}$-free graph with $n$ vertices has close to the maximal $t_r(n)$ edges, then it is close…

We introduce the notion of sink-stable sets of a digraph and prove a min-max formula for the maximum cardinality of the union of k sink-stable sets. The results imply a recent min-max theorem of Abeledo and Atkinson on the Clar number of…

Ergodic properties of the signal-filtering pair are studied for continuous time finite Markov chains, observed in white noise. The obtained law of large numbers is applied to the stability problem of the nonlinear filter with respect to…

A stationary random graph is a random rooted graph whose distribution is invariant under re-rooting along the simple random walk. We adapt the entropy technique developed for Cayley graphs and show in particular that stationary random…

In this paper, we review recent results on stability and instability in logarithmic Sobolev inequalities, with a particular emphasis on strong norms. We consider several versions of these inequalities on the Euclidean space, for the…

Associated to every group with a weak spherical Tits system of rank n+1 with an appropriate rank n subgroup, we construct a relative spectral sequence involving group homology of Levi subgroups of both groups. Using the fact that such Levi…

A consequence of Ore's classic theorem characterizing the maximal graphs with given order and diameter is a determination of the largest such graphs. We give a very short and simple proof of this smaller result, based on a well-known…

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…

We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices. Further, we use stable sets to obtain an improved Lower…

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…

We establish (i) stability of Lyapunov exponents and (ii) convergence in probability of Oseledets spaces for semi-invertible matrix cocycles, subjected to small random perturbations. The first part extends results of Ledrappier and Young to…

This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…

The stability number of a graph G, denoted by alpha(G), is the cardinality of a stable set of maximum size in G. A graph is well-covered if every maximal stable set has the same size. G is a Koenig-Egervary graph if its order equals…

We lift the classical theorem of Arnol'd on homological stability for configurations spaces of the plane to the motivic world. More precisely, we prove that the schemes of unordered configurations of points in the affine line satisfy…

We present new short proofs to both the exact and the stability results of two extremal problems. The first one is the extension of Tur\'{a}n's theorem in hypergraphs, which was firstly studied by Mubayi $\cite{MU06}$. The second one is…

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…