Related papers: Ollivier curvature, betweenness centrality and ave…
The edge betweenness centrality of an edge is loosely defined as the fraction of shortest paths between all pairs of vertices passing through that edge. In this paper, we investigate graphs where the edge betweenness centrality of edges is…
We prove Cheeger inequalities for p-Laplacians on finite and infinite weighted graphs. Unlike in previous works, we do not impose boundedness of the vertex degree, nor do we restrict ourselves to the normalized Laplacian and, more…
We prove local and global upper estimates for the infimum of the mean curvature, the scalar curvature and the norm of the shape operator of graphs in a warped product space. Using these estimates, we obtain some results on pseudo-hyperbolic…
We generalize the notion of convexity and average-convexity to the notion of weighted average-convexity. We show several results on the relation between weighted average-convexity and cooperative games. First, we prove that if a game is…
We design a deterministic algorithm that, given $n$ points in a \emph{typical} constant degree regular~graph, queries $O(n)$ distances to output a constant factor approximation to the average distance among those points, thus answering a…
In this article we prove that antitrees with suitable growth properties are examples of infinite graphs exhibiting strictly positive curvature in various contexts: in the normalized and non-normalized Bakry-\'Emery setting as well in the…
The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is…
The eccentricity of a vertex is the maximum distance from it to another vertex and the average eccentricity $ecc (G)$ of a graph $G$ is the mean value of eccentricities of all vertices of $G$. The average eccentricity is deeply connected…
We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…
The size sz(G) of an l_1-graph G=(V,E) is the minimum of n_f/t_f over all its possible l_1-embeddings f into n_f-dimensional hypercube with scale t_f. In terms of v=|V|, the sum of distances between all the pairs of vertices of G is at most…
In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…
Sharp estimates for mean curvature flow of graphs are shown and examples are given to illustrate why these are sharp. The estimates improves earlier (non-sharp) estimates of Klaus Ecker and Gerhard Huisken.
We consider the motion by mean curvature of an $n$-dimensional graph over a time-dependent domain in $\mathbb{R}^n$, intersecting $\mathbb{R}^n$ at a constant angle. In the general case, we prove local existence for the corresponding…
We prove a conjecture of Bonini et al. on the precise values of the Lin--Lu--Yau curvature of conference graphs, i.e., strongly regular graphs with parameters $(4\gamma+1,2\gamma,\gamma-1,\gamma)$. Our method depends only on the parameter…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
Recently, the author and Melentijevi\'c resolved the longstanding Gaussian curvature problem by proving the sharp inequality \[ |\mathcal{K}| < c_0 = \frac{\pi^2}{2} \] for minimal graphs over the unit disk, evaluated at the point of the…
We show that the abelian girth of a graph is at least three times its girth. We prove an analogue of the Moore bound for the abelian girth of regular graphs, where the degree of the graph is fixed and the number of vertices is large. We…
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…