English
Related papers

Related papers: Poincar\'e and plancherel-polya inequalities in ha…

200 papers

In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…

Combinatorics · Mathematics 2022-07-11 John Stewart Fabila-Carrasco , Fernando Lledó , Olaf Post

We develop a calculus based on graph enumeration for $S_n$-equivariant motivic invariants of graphically stratified moduli spaces. We apply our theory to the Deligne--Mumford moduli space $\overline{\mathcal{M}}_{g, n}$ and to the space of…

Algebraic Geometry · Mathematics 2025-10-09 Siddarth Kannan , Terry Dekun Song

We prove a scale of generalized $L^p$-Poincar\'e inequalities and Sobolev type inequalities on graphs with polynomial volume growth. They are optimal on Vicsek graphs.

Functional Analysis · Mathematics 2019-02-08 Li Chen

We prove a spectral decomposition theorem for a well-known self-similar graph, for some finite graphs which are quotients of this graph and for a compactification of it.

Dynamical Systems · Mathematics 2007-09-04 Jean-François Quint

For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.

Spectral Theory · Mathematics 2021-03-29 Amru Hussein

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

Spectral Theory · Mathematics 2019-04-25 Marwa Balti

Deriving meaningful representations from complex, high-dimensional data in unsupervised settings is crucial across diverse machine learning applications. This paper introduces a framework for multi-scale graph network embedding based on…

Machine Learning · Computer Science 2025-08-12 Shay Deutsch , Lionel Yelibi , Alex Tong Lin , Arjun Ravi Kannan

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…

Combinatorics · Mathematics 2016-07-12 Ori Parzanchevski , Ron Rosenthal , Ran J. Tessler

We study harmonic functions on general weighted graphs which allow for a compatible intrinsic metric. We prove an $L^{p}$ Liouville type theorem which is a quantitative integral $L^{p}$ estimate of harmonic functions analogous to Karp's…

Metric Geometry · Mathematics 2013-09-18 Bobo Hua , Matthias Keller

We prove local $L^p$-Poincar\'e inequalities, $ p\in[1,\infty]$, on quasiconvex sets in infinite graphs endowed with a family of locally doubling measures, and global $L^p$-Poincar\'e inequalities on connected sets for flow measures on…

Functional Analysis · Mathematics 2023-06-02 Matteo Levi , Federico Santagati , Anita Tabacco , Maria Vallarino

In the framework of a strictly local regular Dirichlet space ${\bf X}$ we introduce the subspaces $PW_{\omega},\>\>\omega>0,$ of Paley-Wiener functions of bandwidth $\omega$. It is shown that every function in $PW_{\omega},\>\>\omega>0,$ is…

Functional Analysis · Mathematics 2019-12-18 Isaac Z. Pesenson

We review a method to obtain optimal Poincar\'e-Hardy-type inequalities on the hyperbolic spaces, and discuss briefly generalisations to certain classes of Riemannian manifolds. Afterwards, we recall a corresponding result on homogeneous…

Analysis of PDEs · Mathematics 2025-02-21 Florian Fischer , Christian Rose

We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…

Combinatorics · Mathematics 2025-04-16 Sinan G. Aksoy , Stephen J. Young

Discrete versions of the Laplace and Dirac operators haven been studied in the context of combinatorial models of statistical mechanics and quantum field theory. In this paper we introduce several variations of the Laplace and Dirac…

Mathematical Physics · Physics 2022-03-08 Beata Casiday , Ivan Contreras , Thomas Meyer , Sabrina Mi , Ethan Spingarn

This paper introduces certain elliptic Harnack inequalities for harmonic functions in the setting of the product space $M \times X$, where $M$ is a (weighted) Riemannian Manifold and $X$ is a countable graph. Since some standard arguments…

Probability · Mathematics 2015-06-30 Mark Cerenzia , Laurent Saloff-Coste

This paper introduces Polynomial Graphical Lasso (PGL), a new approach to learning graph structures from nodal signals. Our key contribution lies in modeling the signals as Gaussian and stationary on the graph, enabling the development of a…

Signal Processing · Electrical Eng. & Systems 2024-04-04 Andrei Buciulea , Jiaxi Ying , Antonio G. Marques , Daniel P. Palomar

As the classical $(p,q)$-Poincar\'e inequality is known to fail for $0 < p < 1$, we introduce the notion of weighted multilinear Poincar\'e inequality as a natural alternative when $m$-fold products and $1/m < p$ are considered. We prove…

Classical Analysis and ODEs · Mathematics 2010-02-22 Diego Maldonado , Kabe Moen , Virginia Naibo

We investigate combinatorial properties of a graph polynomial indexed by half-edges of a graph which was introduced recently to understand the connection between Feynman rules for scalar field theory and Feynman rules for gauge theory. We…

Combinatorics · Mathematics 2012-07-24 Dirk Kreimer , Karen Yeats

We show some non-standard Poincar\'e type estimates in the biparametric setting with appropriate weights. We will derive these results using variants from classical estimates exploiting the interplay between maximal functions and fractional…

Classical Analysis and ODEs · Mathematics 2021-09-24 María Eugenia Cejas , Carolina Mosquera , Carlos Pérez , Ezequiel Rela

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

Combinatorics · Mathematics 2010-06-08 J. A. De Loera , C. Hillar , P. N. Malkin , M. Omar