English
Related papers

Related papers: Isoperimetric Inequalities in Simplicial Complexes

200 papers

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…

Machine Learning · Computer Science 2018-02-22 Andreas Loukas , Pierre Vandergheynst

We study a natural discrete Bochner-type inequality on graphs, and explore its merit as a notion of curvature in discrete spaces. An appealing feature of this discrete version seems to be that it is fairly straightforward to compute this…

Combinatorics · Mathematics 2015-10-26 Bo'az Klartag , Gady Kozma , Peter Ralli , Prasad Tetali

We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…

Combinatorics · Mathematics 2017-12-27 Péter E. Frenkel

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

Combinatorics · Mathematics 2012-10-19 Anirban Banerjee , Jürgen Jost

Given a finite simple graph $G$ on $m$ vertices, the zeon combinatorial Laplacian $\Lambda$ of $G$ is an $m\times m$ graph having entries in the complex zeon algebra $\mathbb{C}\mathfrak{Z}$. It is shown here that if the graph has a unique…

Combinatorics · Mathematics 2025-10-07 G. Stacey Staples

In spectral graph theory, the Cheeger's inequality gives upper and lower bounds of edge expansion in normal graphs in terms of the second eigenvalue of the graph's Laplacian operator. Recently this inequality has been extended to undirected…

Discrete Mathematics · Computer Science 2017-11-07 T-H. Hubert Chan , Zhihao Gavin Tang , Xiaowei Wu , Chenzi Zhang

Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…

Combinatorics · Mathematics 2016-07-26 Matthew Kahle

The asymptotic spectrum of graphs, introduced by Zuiddam (arXiv:1807.00169, 2018), is the space of graph parameters that are additive under disjoint union, multiplicative under the strong product, normalized and monotone under homomorphisms…

Combinatorics · Mathematics 2019-03-06 Péter Vrana

A Riemannian orbifold is a mildly singular generalization of a Riemannian manifold that is locally modeled on $R^n$ modulo the action of a finite group. Orbifolds have proven interesting in a variety of settings. Spectral geometers have…

Combinatorics · Mathematics 2019-05-29 Kathleen Daly , Colin Gavin , Gabriel Montes de Oca , Diana Ochoa , Elizabeth Stanhope , Sam Stewart

We present a thorough study of the theoretical properties and devise efficient algorithms for the \emph{persistent Laplacian}, an extension of the standard combinatorial Laplacian to the setting of pairs (or, in more generality, sequences)…

Combinatorics · Mathematics 2022-07-18 Facundo Mémoli , Zhengchao Wan , Yusu Wang

One of the more challenging tasks in the understanding of dynamical properties of models on top of complex networks is to capture the precise role of multiplex topologies. In a recent paper, Gomez et al. [Phys. Rev. Lett. 101, 028701…

We define and study isoparametric submanifolds of general ambient spaces and of arbitrary codimension. In particular we study their behaviour with respect to Riemannian submersions and their lift into a Hilbert space. These results are used…

Differential Geometry · Mathematics 2007-05-23 Ernst Heintze , Xiaobo Liu , Carlos Olmos

We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…

Mathematical Physics · Physics 2018-10-30 Pavel Exner , Aleksey Kostenko , Mark Malamud , Hagen Neidhardt

Consider two graphs $G$ and $H$. Let $H^k[G]$ be the lexicographic product of $H^k$ and $G$, where $H^k$ is the lexicographic product of the graph $H$ by itself $k$ times. In this paper, we determine the spectrum of $H^k[G]$ and $H^k$ when…

Combinatorics · Mathematics 2026-02-17 Nair Abreu , Domingos M. Cardoso , Paula Carvalho , Cybele T. M. Vinagre

We consider a multi-parameter model for randomly constructing simplicial complexes. This model interpolates between random clique complexes and Linial-Meshulam random $k$-dimensional complexes, two models that have been extensively studied.…

Algebraic Topology · Mathematics 2015-06-04 Christopher F. Fowler

We introduce the notion of relational symplectic groupoid as a way to integrate Poisson manifolds in general, following the construction through the Poisson sigma model (PSM) given by Cattaneo and Felder. We extend such construction to the…

Symplectic Geometry · Mathematics 2013-06-18 Ivan Contreras

We establish a symmetrization procedure in a context of general orthogonal expansions associated with a second order differential operator $L$, a `Laplacian'. Combined with a unified conjugacy scheme furnished in our earlier article it…

Classical Analysis and ODEs · Mathematics 2013-06-07 Adam Nowak , Krzysztof Stempak

In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…

Algebraic Topology · Mathematics 2015-03-03 A. Costa , M. Farber

We extend several Cheeger-type isoperimetric bounds for convex sets in Euclidean space, due to Bobkov and Kannan-Lov\'asz-Simonovits, to Riemannian manifolds having non-negative Ricci curvature. In order to extend Bobkov's bound, we require…

Functional Analysis · Mathematics 2011-05-06 Emanuel Milman

This is a note on three graph parameters motivated by the Euler-Poincare characteristic for simplicial complex. We show those three graph parameters of a given connected graph $G$ is greater than or equal to that of the complete graph with…

Combinatorics · Mathematics 2012-11-28 Hanbaek Lyu
‹ Prev 1 8 9 10 Next ›