相关论文: Ollivier curvature, betweenness centrality and ave…

Kemeny's constant quantifies a graph's connectivity by measuring the average time for a random walker to reach any other vertex. We introduce two concepts of the directional derivative of Kemeny's constant with respect to an edge and use…

Let $G$ be a graph with adjacency eigenvalues $\lambda_1 \geq \cdots \geq \lambda_n$. Both $\lambda_1 + \lambda_n$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$. Csikv\'ari proved in 2022 that for odd girth 5…

There are several notions of convergence for sequences of bounded degree graphs. One such notion is left convergence, which is based on counting neighborhood distributions. Another notion is right convergence, based on counting…

We introduce the concept of distance ideals of graphs, which can be regarded as a generalization of the Smith normal form and the spectra of the distance matrix of a graph. We obtain a classification of the graphs with at most one trivial…

Betweenness centrality is a centrality measure based on the overall amount of shortest paths passing through a given vertex. A graph is betweenness-uniform if all its vertices have the same betweenness centrality. We study the properties of…

We prove an inequality relating the isoperimetric profile of a graph to the decay of the random walk total variation distance $\sup_{x\sim y} ||P^n(x,\cdot)-P^n(y,\cdot)||_{\mathrm{TV}}$. This inequality implies a quantitative version of a…

The main result of this paper gives a plenary proof on the curvature estimates for $k$ curvature equations with general right hand sides with $n<2k$ based on a concavity inequality. We further give a explicit lower bound of the inequality.

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…

Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…

This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

In recent years extensions of manifold Ricci curvature to discrete combinatorial objects such as graphs and hypergraphs (popularly called as "network shapes"), have found a plethora of applications in a wide spectrum of research areas…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…

We show that the generalized Ricci tensor of a weighted complete Riemannian manifold can be retrieved asymptotically from a scaled metric derivative of Wasserstein 1-distances between normalized weighted local volume measures. As an…

In the degree-diameter problem for Abelian Cayley and circulant graphs of diameter 2 and arbitrary degree d there is a wide gap between the best lower and upper bounds valid for all d, being quadratic functions with leading coefficient 1/4…

Lin, Lu, and Yau formulated the Ricci curvature of edges in simple undirected graphs[2]. Using their formulations, we calculate the Ricci curvatures of Cayley graphs for the dihedral groups, the general quaternion groups, and cyclic groups…

The well-known 1-2-3 Conjecture asserts that the edges of every graph without isolated edges can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general, while it is known to be…

Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…

A connected and nonempty graph A is defined as generalized t-edge distance-balanced, while for each edge f={\alpha}\{beta} the number of edges nearer to {\alpha} than \{beta} are equal to t-times of edges nearer to \{beta} than to {\alpha},…