Related papers: Poincar\'e and plancherel-polya inequalities in ha…
In this paper we will establish different weighted Poincar\'{e} inequalities with variable exponents on Carnot-Carath\'{e}odory spaces or Carnot groups. We will use different techniques to obtain these inequalities. For vector fields…
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is omega(ln n). We prove that the adjacency matrix and the Laplacian of that…
For random combinatorial optimization problems, there has been much progress in establishing laws of large numbers and computing limiting constants for the optimal value of various problems. However, there has not been as much success in…
We propose the notion of normalized Laplacian matrix $\mathcal{L}(\Phi)$ for a gain graphs and study its properties in detail, providing insights and counterexamples along the way. We establish bounds for the eigenvalues of…
Approximations of Laplace-Beltrami operators on manifolds through graph Lapla-cians have become popular tools in data analysis and machine learning. These discretized operators usually depend on bandwidth parameters whose tuning remains a…
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
The present study deals with the inhomogeneous plane symmetric models in scalar - tensor theory of gravitation. We used symmetry group analysis method to solve the field equations analytically. A new class of similarity solutions have been…
Persistent homology is constrained to purely topological persistence while multiscale graphs account only for geometric information. This work introduces persistent spectral theory to create a unified low-dimensional multiscale paradigm for…
In this paper we improve the spectral convergence rates for graph-based approximations of Laplace-Beltrami operators constructed from random data. We utilize regularity of the continuum eigenfunctions and strong pointwise consistency…
We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…
Let ${\mathcal {X}}$ be a space of homogeneous type. In this article, based on the reducing operators of matrix $A_p$-weights, the authors introduce the vector-valued Haj\l asz gradient sequences and establish some related matrix-weighted…
The combinatorial refinement techniques have proven to be an efficient approach to isomorphism testing for particular classes of graphs. If the number of refinement rounds is small, this puts the corresponding isomorphism problem in a…
Many results in extremal graph theory can be formulated as certain polynomial inequalities in graph homomorphism densities. Answering fundamental questions raised by Lov{\'a}sz, Szegedy and Razborov, Hatami and Norine proved that…
The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
In this paper, we prove the Hardy-Leray inequality and related inequalities in variable Lebesgue spaces. Our proof is based on a version of the Stein-Weiss inequality in variable Lebesgue spaces derived from two weight inequalities due to…
We apply the method of orbit harmonics to the set of break divisors and orientable divisors on graphs to obtain the central and external zonotopal algebras respectively. We then relate a construction of Efimov in the context of…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
The development of global sensitivity analysis of numerical model outputs has recently raised new issues on 1-dimensional Poincar\'e inequalities. Typically two kind of sensitivity indices are linked by a Poincar\'e type inequality, which…