Related papers: Isoperimetric Inequalities in Simplicial Complexes
We prove a theorem that can be thought of as a common generalization of the Discrete Nodal Theorem and (one direction of) Cheeger's Inequality for graphs. special case of this result will assert that if the second and third eigenvalues of…
The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…
The theory of $k$-regular graphs is closely related to group theory. Every $k$-regular, bipartite graph is a Schreier graph with respect to some group $G$, a set of generators $S$ (depending only on $k$) and a subgroup $H$. The goal of this…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
Simplicial complexes constitute the underlying topology of interacting complex systems including among the others brain and social interaction networks. They are generalized network structures that allow to go beyond the framework of…
In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…
Given an arbitrary hypergraph $\mathcal{H}$, we may glue to $\mathcal{H}$ a family of hypergraphs to get a new hypergraph $\mathcal{H}'$ having $\mathcal{H}$ as an induced subhypergraph. In this paper, we introduce three gluing techniques…
Coboundary expansion is a high dimensional generalization of the Cheeger constant to simplicial complexes. Originally, this notion was motivated by the fact that it implies topological expansion, but nowadays a significant part of the…
We consider Gaussian fields of real symmetric, complex Hermitian or quaternionic Hermitian matrices over an electrical network, and describe how the isomorphisms between these fields and random walks give rise to topological expansions…
Bogomolny-Leyvraz-Schmit (1996) and Peter (2002) proposed an asymptotic formula for the correlation of the multiplicities in length spectrum on the modular surface, and Lukianov (2007) extended its asymptotic formula to the Riemann surfaces…
Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
In this paper, we investigate spectral properties of the adjacency tensor, Laplacian tensor and signless Laplacian tensor of general hypergraphs (including uniform and non-uniform hypergraphs). We obtain some bounds for the spectral radius…
The combinatorial Loewner property was introduced by Bourdon and Kleiner as a quasisymmetrically invariant substitute for the Loewner property for general fractals and boundaries of hyperbolic groups. While the Loewner property is somewhat…
Several new spectral properties of the normalized Laplacian defined for oriented hypergraphs are shown. The eigenvalue $1$ and the case of duplicate vertices are discussed; two Courant nodal domain theorems are established; new quantities…
Two short seminal papers of Margulis used Kazhdan's property $(T)$ to give, on the one hand, explicit constructions of expander graphs, and to prove, on the other hand, the uniqueness of some invariant means on compact simple Lie groups.…
We describe a natural topological generalization of edge expansion for graphs to regular CW complexes and prove that this property holds with high probability for certain random complexes.
The minimum number of observations such that the maximum likelihood estimator in a Gaussian graphical model exists with probability one is called the maximum likelihood threshold of the underlying graph G. The natural algebraic relaxation…
Here we give brief account of hermitian symplectic spaces, showing that they are intimately connected to symmetric as well as self-adjoint extensions of a symmetric operator. Furthermore we find an explicit parameterisation of the Lagrange…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…