Related papers: Notes on the stable regularity lemma
This article gives an overview of the emerging literature on large deviations for random graphs. Written for the general mathematical audience, the article begins with a short introduction to the theory of large deviations. This is followed…
The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
In this work, we present a generalization of extended persistent homology to filtrations of graded sub-groups by defining relative homology in this setting. Our work provides a more comprehensive and flexible approach to get an algebraic…
In this paper, we propose a method based on GMM (the generalized method of moments) to estimate the parameters of stable distributions with $0<\alpha<2$. We don't assume symmetry for stable distributions.
The stability theorem for persistent homology is a central result in topological data analysis. While the original formulation of the result concerns the persistence barcodes of $\mathbb{R}$-valued functions, the result was later cast in a…
The aim of this article is to give a rather extensive, and yet nontechnical, account of the birth of the regularity theory for generalized minimal surfaces, of its various ramifications along the decades, of the most recent developments,…
A graph $\Gamma$ is said to be stable if for the direct product $\Gamma\times\mathbf{K}_2$, ${\rm Aut}(\Gamma \times \mathbf{K}_2)$ is isomorphic to ${\rm Aut}(\Gamma) \times \mathbb{Z}_2$; otherwise, it is called unstable. An unstable…
The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…
In this paper, we study properties and patterns on permutations of multisets whose multivariate generating functions are symmetric. We interpret this phenomenon through the lens of group actions and define such a property or pattern as…
It is proved that vertical graphs and radial graphs are strongly stable for a certain type of densities in Euclidean space ${\mathbb R}^{n+1}$. Particular cases of these densities include translators, expanders and singular minimal…
This paper is devoted to the stability analysis of an n species Lotka-Volterra system with discrete and distributed delays. Stochastic perturbations to the parameters of the model are allowed. Sufficient conditions for the almost sure…
This paper is largely concerned with constructing coarse moduli spaces for Artin stacks. The main purpose of this paper is to introduce the notion of stability on an arbitrary Artin stack and construct a coarse moduli space for the open…
In the present work we suggest a general covariant theory which can be used to study the stability of any physical system treated geometrically. Stability conditions are connected to the magnitude of the deviation vector. This theory is a…
We show that the steady-state variance as a performance measure for a class of networked linear control systems is expressible as the summation of a rational function over the Laplacian eigenvalues of the network graph. Moreover, we…
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit…
We prove a general homological stability theorem for certain families of groups equipped with product maps, followed by two theorems of a new kind that give information about the last two homology groups outside the stable range. (These…
The paper discusses a simple method of using the parametric continuation method to designate complex diagrams of steady states. The main advantage of the discussed approach is the fact that it does not require the installation of huge…
In this paper we formulate and prove a general theorem of stability of exactness properties under the pro-completion, which unifies several such theorems in the literature and gives many more. The theorem depends on a formal approach to…
We determine all of lines in the moduli space $M$ of stable bundles for arbitrary rank and degree. A further application of minimal rational curves is also given in last section.