相关论文: Domination and regularity
We prove a general duality theorem for tangle-like dense objects in combinatorial structures such as graphs and matroids. This paper continues, and assumes familiarity with, the theory developed in [6]
We study the properties of certain graphs involving the sums of primes. Their structure largely turns out to relate to the distribution of prime gaps and can be roughly seen in Cram\'er's model as well. We also discuss generalizations to…
We first introduce the concept of (k,k',k'')-domination numbers in graphs, which is a generalization of many domination parameters. Then we find lower and upper bounds for this parameter, which improve many well-known results in…
The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are…
We exhibit a connection between geometric stability theory and the classification of unstable structures at the level of simplicity and the $\mathrm{NSOP}_{1}$-$\mathrm{SOP}_{3}$ gap. Particularly, we introduce generic expansions $T^{R}$ of…
We give a representation for regular forms associated with dominated $C_0$-semigroups which, in turn, characterises domination of $C_0$-semigroups associated with regular forms. In addition, we prove a relationship between the positivity of…
We say that a graph $H$ dominates another graph $H'$ if the number of homomorphisms from $H'$ to any graph $G$ is dominated, in an appropriate sense, by the number of homomorphisms from $H$ to $G$. We study the family of dominating graphs,…
We investigate the notion of Gaussian domination for the spin $O(N)$ model on general finite graphs. We begin by proving a general inequality for spin correlations under the assumption of Gaussian domination, which directly implies…
For regularized distributions we establish stability of the characterization of the normal law in Cramer's theorem with respect to the total variation norm and the entropic distance. As part of the argument, Sapogov-type theorems are…
Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…
For graphs $G$ and $H$, what relations can be determined between $t(G,W)$ and $t(H,W)$ for a general graph $W$? We study this problem through the framework of the density domination exponent, which is defined to be the smallest constant $c$…
This paper initiates the study of fractional eternal domination in graphs, a natural relaxation of the well-studied eternal domination problem. We study the connections to flows and linear programming in order to obtain results on the…
We initiate a systematic study of \emph{generic stability independence} and introduce the class of \emph{treeless theories} in which this notion of independence is particularly well-behaved. We show that the class of treeless theories…
A general theory is developed for the evolution of the cell order (CO) distribution in planar granular systems. Dynamic equations are constructed and solved in closed form for several examples: systems under compression; dilation of very…
The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…
In this article, we review and discuss different aspects of stability and genericity of some properties of space-times which occur in various contexts in the General Theory of Relativity. We also give argument supporting the conclusion that…
In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and…
In [1], the authors have studied stability of certain causal properties of space-times in general relativity. As a continuation of this work, in the present paper, we review and discuss, some more aspects of stability which occur in various…
We study generically stable types/measures in both classical and continuous logics, and their connection with randomization and modes of convergence of types/measures.
We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $\mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by…