Related papers: Poincar\'e and plancherel-polya inequalities in ha…
In this paper, we derive Li-Yau inequality for unbounded Laplacian on complete weighted graphs with the assumption of the curvature-dimension inequality $CDE'(n,K)$, which can be regarded as a notion of curvature on graphs. Furthermore, we…
We introduce the notion of an interpolating path on the set of probability measures on finite graphs. Using this notion, we first prove a displacement convexity property of entropy along such a path and derive Prekopa-Leindler type…
On a periodic planar graph whose edge weights satisfy a certain simple geometric condition, the discrete Laplacian and d-bar operators have the property that their determinants and inverses only depend on the local geometry of the graph. We…
In this paper, we study some functional inequalities (such as Poincar\'e inequalities, logarithmic Sobolev inequalities, generalized Cheeger isoperimetric inequalities, transportation-information inequalities and transportation-entropy…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…
This work considers new entropy-based proofs of some known, or otherwise refined, combinatorial bounds for bipartite graphs. These include upper bounds on the number of the independent sets, lower bounds on the minimal number of colors in…
Concentration results and probabilistic analysis for combinatorial problems like the TSP, MWST, graph coloring have received much attention, but generally, for i.i.d. samples (i.i.d. points in the unit square for the TSP, for example).…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…
In this paper, we present a version of horizontal weighted Hardy-Rellich type and Caffarelli-Kohn-Nirenberg type inequalities on stratified groups and study some of their consequences. Our results reflect on many results previously known in…
This paper concerns the eigenvalues of the Neumann-Poincar\'e operator, a boundary integral operator associated with the harmonic double-layer potential. Specifically, we examine how the eigenvalues depend on the support of integration and…
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct applications in the…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
We define a new Cheeger-like constant for graphs and we use it for proving Cheeger-like inequalities that bound the largest eigenvalue of the normalized Laplace operator.
We study spectral properties of the standard (also called Kirchhoff) Laplacian and the anti-standard (or anti-Kirchhoff) Laplacian on a finite, compact metric graph. We show that the positive eigenvalues of these two operators coincide…
Spectral graph sparsification has emerged as a powerful tool in the analysis of large-scale networks by reducing the overall number of edges, while maintaining a comparable graph Laplacian matrix. In this paper, we present an efficient…
Three new combinations of convex bodies are introduced and studied: the $L_p$ fiber, $L_p$ chord and graph combinations. These combinations are defined in terms of the fibers and graphs of pairs of convex bodies, and each operation…
We study $p$-energy functionals on infinite locally summable graphs for $p\in (1,\infty)$ and show that many well-known characterizations for a parabolic space are also true in this discrete, non-local and non-linear setting. Among the…
We consider functions on a graph $G$ whose evolution in time $-\infty<t<\infty$ is governed by a Schr\"{o}dinger type equation with a combinatorial Laplace operator on the right side. For a given subset $S$ of vertices of $G$ we compute a…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
Network representations often cannot fully account for the structural richness of complex systems spanning multiple levels of organisation. Recently proposed high-order information-theoretic signals are well-suited to capture synergistic…