Related papers: Poincar\'e and plancherel-polya inequalities in ha…
A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita…
This paper deals with fundamental properties of Poincar\'e half-maps defined on a straight line for planar linear systems. Concretely, we focus on the analyticity of the Poincar\'e half-maps, their series expansions (Taylor and…
This article obtains purely metric counterparts of cornerstone results in the theory of embedding graphs into normed spaces. Our first main result is a metric analogue of Matou\v{s}ek's extrapolation relating the Poincar\'e constants…
We develop a combinatorial rigidity theory for symmetric bar-joint frameworks in a general finite dimensional normed space. In the case of rotational symmetry, matroidal Maxwell-type sparsity counts are identified for a large class of…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…
We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…
We prove functional inequalities on vector fields on the Euclidean space when it is equipped with a bounded measure that satisfies a Poincar\'e inequality, and study associated self-adjoint operators. The weighted Korn inequality compares…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
Cheeger-type inequalities in which the decomposability of a graph and the spectral gap of its Laplacian mutually control each other play an important role in graph theory and network analysis, in particular in the context of expander…
In this paper, a new class of hemivariational inequalities is introduced. It concerns Laplace operator on locally finite graphs together with multivalued nonmonotone nonlinearities expressed in terms of Clarke's subdifferential. First of…
In the present paper, we apply Alexandrov geometry methods to study geometric analysis aspects of infinite semiplanar graphs with nonnegative combinatorial curvature in the sense of Higuchi. We obtain the metric classification of these…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
We study Hardy-type inequalities on infinite homogeneous trees. More precisely, we derive optimal Hardy weights for the combinatorial Laplacian in this setting and we obtain, as a consequence, optimal improvements for the Poincar\'e…
In a previous paper Hua-Jost-Liu, we have applied Alexandrov geometry methods to study infinite semiplanar graphs with nonnegative combinatorial curvature. We proved the weak relative volume comparison and the Poincar\'e inequality on these…
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…
The classical Weisfeiler-Lehman method WL[2] uses edge colors to produce a powerful graph invariant. It is at least as powerful in its ability to distinguish non-isomorphic graphs as the most prominent algebraic graph invariants. It…
Polynomial invariants are fundamental objects in analysis on Lie groups and symmetric spaces. Invariant differential operators on symmetric spaces are described by Weyl group invariant polynomial. In this article we give a simple criterion…
We prove that for combinatorial graphs with non-negative Ollivier curvature, one has \[ \|P_t \mu - P_t \nu\|_1 \leq \frac{W_1(\mu,\nu)}{\sqrt{t}} \] for all probability measures $\mu,\nu$ where $P_t$ is the heat semigroup and $W_1$ is the…