Related papers: Probabilistic and Geometrical Applications to Grap…
For a graph $G=(V,E)$, let $\tau(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $\tau(G) \leq…
In this paper, we investigate the problem of finding {\it bisections} (i.e., balanced bipartitions) in graphs. We prove the following two results for {\it all} graphs $G$: (1). $G$ has a bisection where each vertex $v$ has at least $(1/4 -…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…
For each $N\geq 1$, let $G_N$ be a simple random graph on the set of vertices $[N]=\{1,2, ..., N\}$, which is invariant by relabeling of the vertices. The asymptotic behavior as $N$ goes to infinity of correlation functions: $$ \mathfrak…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
Given a finite simple graph G, let G' be its barycentric refinement: it is the graph in which the vertices are the complete subgraphs of G and in which two such subgraphs are connected, if one is contained into the other. If L(0)=0<L(1) <=…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…
We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
Let $\mu$ be a probability measure on $\mathbb{R}^n$ with a bounded density $f$. We prove that the marginals of $f$ on most subspaces are well-bounded. For product measures, studied recently by Rudelson and Vershynin, our results show there…
Our monograph presents the foundations of the theory of groups and semigroups acting isometrically on Gromov hyperbolic metric spaces. Our work unifies and extends a long list of results by many authors. We make it a point to avoid any…
Discrete curvatures are quantities associated to the nodes and edges of a graph that reflect the local geometry around them. These curvatures have a rich mathematical theory and they have recently found success as a tool to analyze networks…
The \emph{eccentricity} of a vertex $u$ in a graph $G$, denoted by $e_G(u)$, is the maximum distance from $u$ to other vertices in $G$. We study extremal problems for the average eccentricity and the first and second Zagreb eccentricity…
Succinct representations of a graph have been objects of central study in computer science for decades. In this paper, we study the operation called \emph{Distance Preserving Graph Contractions}, which was introduced by Bernstein et al.…
In this survey, we outline the role of G-functions in arithmetic geometry, notably their link with Picard-Fuchs differential equations and periods. We explain how polynomial relations between special values of G-functions arising from a…
We establish existence and regularity results for boundary value problems arising from the first variation of the Willmore energy in the graphical setting. Our focus lies on two-dimensional surfaces with fixed clamped boundary conditions,…
We obtain new sharp isoperimetric inequalities on a Riemannian manifold equipped with a probability measure, whose generalized Ricci curvature is bounded from below (possibly negatively), and generalized dimension and diameter of the convex…
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants…