Related papers: Stable components and layers
In this paper we propose a method to define the range of stability of fixed points for a variety of discrete fractional systems of the order $0 < \alpha <2$. The method is tested on various forms of fractional generalizations of the…
Graph dynamical systems (GDSs) can be used to describe a wide range of distributed, nonlinear phenomena. In this paper we characterize cycle equivalence of a class of finite GDSs called sequential dynamical systems SDSs. In general, two…
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of one-vertex insertions v_1,...,v_n, such that the neighbourhood of vertex v_i, 2<= i<= n, forms a module (a homogeneous set) of the graph…
Let $\gamma(G)$ denote the domination number of a graph $G$. A vertex $v\in V(G)$ is called a \emph{critical vertex} of $G$ if $\gamma(G-v)=\gamma(G)-1$. A graph is called \emph{vertex-critical} if every vertex of it is critical. In this…
The stability properties of simple element choices for the mixed formulation of the Laplacian are investigated numerically. The element choices studied use vector Lagrange elements, i.e., the space of continuous piecewise polynomial vector…
A metric graph is a geometric realization of a finite graph by identifying each edge with a real interval. A divisor on a metric graph $\Gamma$ is an element of the free abelian group on $\Gamma$. The rank of a divisor on a metric graph is…
A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…
In the theory of the moduli-stacks of n-pointed stable curves, there are two fundamental functors, contraction and stabilization. These functors are constructed in [4], where they are used to show that the various \bar{M_{g,n}}'s are…
We study pairs $(f, \Gamma)$ consisting of a non-Archimedean rational function $f$ and a finite set of vertices $\Gamma$ in the Berkovich projective line, under a certain stability hypothesis. We prove that stability can always be attained…
We describe a new approach to the definition of the moduli functor of stable varieties. While there is wide agreement as to what classes of varieties should appear, the notion of a family of stable surfaces is quite subtle, as key numerical…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
We describe stability conditions for pairs consisting of a coherent sheaf and a homomorphism to a fixed coherent sheaf on a projective variety. The corresponding moduli spaces are constructed for pairs on curves and surfaces. We consider…
The notion of $m/\Gamma$-pointed stable curves is introduced. It should be viewed as a generalization of the notion of m-pointed stable curves of a given genus, where the labels of the marked points are only determined up to the action of a…
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
We extend and improve the existing characterization of the dynamics of general quadratic real polynomial maps with coefficients that depend on a single parameter $\lambda$, and generalize this characterization to cubic real polynomial maps,…
A factor of a graph is a spanning subgraph. Spectral sufficient conditions are provided via spectral radius and signless Laplacian spectral radius for graphs with (i) a matching of given size (particularly, $1$-factor) containing any given…
We study a combinatorial property of subsets in finite groups that is analogous to the notion of independence in graphs. Given a group $G$ and a non-empty subset $A\subset G$, we define a (right) $s$-factor as a subset $B\subset G$…
To a finite, connected, unoriented graph of Betti-number g>=2 and valencies >=3 we associate a finitely summable, commutative spectral triple (in the sense of Connes), whose induced zeta functions encode the graph. This gives another…
The solubility graph $\Gamma_S(G)$ associated with a finite group $G$ is a simple graph whose vertices are the elements of $G$, and there is an edge between two distinct vertices if and only if they generate a soluble subgroup. In this…
A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate…