Related papers: Epsilon-saturation for stable graphs and Littlesto…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…
In this paper, a phenomenological theory of saturated ferromagnetoelastic conductors is established using a multi-continuum model and the classical laws of mechanics, thermodynamics and electromagnetics. The theory is nonlinear and is valid…
A new model realisation of the vector curvaton paradigm is presented and analysed. The model consists of a single massive Abelian vector field, with a Maxwell type kinetic term. By assuming that the kinetic function and the mass of the…
The usual passivity theorem considers a closed-loop, the direct chain of which consists of a strictly passive stable operator $H_{1}$, and the feedback chain of which consists of a passive operator $H_{2}$. Then the closed-loop is stable.…
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…
We investigate stability of the Einstein static solution against homogeneous scalar, vector and tensor perturbations in the context of Rastall theory of gravity. We show that this solution in the presence of perfect fluid and vacuum energy…
Rigidity theory studies the properties of graphs that can have rigid embeddings in a euclidean space $\mathbb{R}^d$ or on a sphere and which in addition satisfy certain edge length constraints. One of the major open problems in this field…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
We show how graph theory concepts can provide an insight into the origin of slow dynamics in systems with kinetic constraints. In particular, we observe that slow dynamics is related to the presence of strong hierarchies between nodes on…
In this note we prove that finitely generated virtually free groups are stable with respect to a normalized $p$-Schatten norm for $1\leq p < \infty$. In particular, this implies that virtually free groups are Hilbert-Schmidt stable.
We demonstrate that graphs embedded on surfaces are a powerful and practical tool to generate, characterize and simulate networks with a broad range of properties. Remarkably, the study of topologically embedded graphs is non-restrictive…
For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…
We prove a squeezing/stability theorem for delta-epsilon controlled L-groups when the control map is a fibration on a finite polyhedron. A relation with boundedly-controlled L-groups is also discussed.
This paper introduces the notion of weak rigidity to characterize a framework by pairwise inner products of inter-agent displacements. Compared to distance-based rigidity, weak rigidity requires fewer constrained edges in the graph to…
The notion of `stable rank' of a matrix is central to the analysis of randomized matrix algorithms, covariance estimation, deep neural networks, and recommender systems. We compare the properties of the stable rank and intrinsic dimension…
This is a short expository account of the regularity lemma for stable graphs proved by the authors, with some comments on the model theoretic context, written for a general logical audience.
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…
We consider sets and maps defined over an o-minimal structure over the reals, such as real semi-algebraic or subanalytic sets. A {\em monotone map} is a multi-dimensional generalization of a usual univariate monotone function, while the…
For $\alpha \in (1,2]$, the $\alpha$-stable graph arises as the universal scaling limit of critical random graphs with i.i.d. degrees having a given $\alpha$-dependent power-law tail behavior. It consists of a sequence of compact measured…
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…