Related papers: Coboundary expanders
A matrix-weighted graph is an undirected graph with a $k\times k$ positive semidefinite matrix assigned to each edge. There are natural generalizations of the Laplacian and adjacency matrices for such graphs. These matrices can be used to…
Random walks are a common model for exploration and discovery of complex networks. While numerous algorithms have been proposed to map out an unknown network, a complementary question arises: in a known network, which nodes and edges are…
Given a CW-complex A we define an `A-shaped' homology theory which behaves nicely towards A-homotopy groups allowing the generalization of many classical results. We also develop a relative version of the Federer spectral sequence for…
In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex. Using this…
We show that for a compact surface without boundary $M$ the set of cw-expansive homeomorphisms is dense in the set of all the homeomorphisms of $M$ with respect to the $C^0$ topology. After this we show that for a generic homeomorphism $f$…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We present a generalization of Brouwer's conjectural family of inequalities -- a popular family of inequalities in spectral graph theory bounding the partial sum of the Laplacian eigenvalues of graphs -- for the case of abstract simplicial…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have…
We determine the Castelnuovo-Mumford regularity of binomial edge ideals of complement reducible graphs (cographs). For cographs with $n$ vertices the maximum regularity grows as $2n/3$. We also bound the regularity by graph theoretic…
This paper proves a conjecture of Fomin and Shapiro that their combinatorial model for any Bruhat interval is a regular CW complex which is homeomorphic to a ball. The model consists of a stratified space which may be regarded as the link…
The complexity and non-Euclidean structure of graph data hinder the development of data augmentation methods similar to those in computer vision. In this paper, we propose a feature augmentation method for graph nodes based on topological…
Bounded infinite graphs are defined on the basis of natural physical requirements. When specialized to trees this definition leads to a natural conjecture that the average connectivity dimension of bounded trees cannot exceed two. We verify…
We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
In this paper, we consider a one-dimensional random geometric graph process with the inter-nodal gaps evolving according to an exponential AR(1) process, which may serve as a mobile wireless network model. The transition probability matrix…
Random graphs are more and more used for modeling real world networks such as evolutionary networks of proteins. For this purpose we look at two different models and analyze how properties like connectedness and degree distributions are…
We give a new lower bound on the expansion coefficient of an edge-vertex graph of a $d$-regular graph. As a consequence, we obtain an improvement on the lower bound on relative minimum distance of the expander codes constructed by Sipser…
Cells forming various epithelial tissues have a strikingly universal distribution for the number of their edges. It is generally assumed that this topological feature is predefined by the statistics of individual cell divisions in growing…
Random walks on a graph reflect many of its topological and spectral properties, such as connectedness, bipartiteness and spectral gap magnitude. In the first part of this paper we define a stochastic process on simplicial complexes of…