相关论文: Stability for large forbidden subgraphs

We show a general result known as the Erdos_Sos Conjecture: if $E(G)>{1/2}(k-1)n$ where $G$ has order $n$ then $G$ contains every tree of order $k+1$ as a subgraph.

We prove anti-concentration results for polynomials of independent random variables with arbitrary degree. Our results extend the classical Littlewood-Offord result for linear polynomials, and improve several earlier estimates. We discuss…

Rallis and Soudry have proven the stability under twists by highly ramified characters of the local gamma factor arising from the doubling method, in the case of a symplectic group or orthogonal group G over a local non-archimedean field F…

An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…

We give sufficient conditions for stability of a continuous-time linear switched system consisting of finitely many subsystems. The switching between subsystems is governed by an underlying graph. The results are applicable to switched…

We construct a local Lipschitz graph around a soliton of the cubic focusing NLS in three dimensions on which global solutions exist, and asymptotic stability as well as scattering holds.

We study the ergodic and statistical properties of a class of maps of the circle and of the interval of Lorenz type which present indifferent fixed points and points with unbounded derivative. These maps have been previously investigated in…

In the plane, we consider the problem of reconstructing a domain from the normal derivative of its Green's function (with fixed pole) relative to the Dirichlet problem for the Laplace operator. By means of the theory of conformal mappings,…

Erd\H{o}s proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.

We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable.…

We prove existence of finitely many ergodic equilibrium states for a large class of non-uniformly expanding local homeomorphisms on compact manifolds and Holder continuous potentials with not very large oscillation. No Markov structure is…

We investigate stability of a solution of a hybrid system in the sense that the graphs of solutions from nearby initial conditions remain close and tend towards the graph of the given solution. In this manner, a small continuous-time…

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

A set $\mathcal{G}$ of planar graphs on the same number $n$ of vertices is called simultaneously embeddable if there exists a set $P$ of $n$ points in the plane such that every graph $G \in \mathcal{G}$ admits a (crossing-free)…

Mapping class groups satisfy cohomological stability. In this note we show how results by Bestvina and Fujiwara imply that the bounded cohomology does not stabilize, additionally we show that stabily polynomials in the Mumford-Morita-Miller…

We prove homological stability for sequences of "oriented configuration spaces" as the number of points in the configuration goes to infinity. These are spaces of configurations of n points in a connected manifold M of dimension at least 2…

We prove the existence and describe limiting curves resulting from deviations in partial sums in the ergodic theorem for cylindrical functions and polynomial (self-similar) adic systems. For a general ergodic measure-preserving…

Given a real $\mu\geq 1$, a graph $H$ is $\mu$-almost-regular if $\Delta(H)\leq \mu \delta(H)$. The celebrated regularization theorem of Erd\H{o}s and Simonovits states that for every real $0<\varepsilon<1$ there exists a real…

Periodic orbits for the classical $\phi^4$ theory on the one dimensional lattice are systematically constructed by extending the normal modes of the harmonic theory, for periodic, fixed and free boundary conditions. Through the process, we…