Related papers: Quasi-isometries between graphs with variable edge…
Vertex connectivity and edge connectivity are fundamental concepts in graph theory that have been widely studied from both structural and algorithmic perspectives. The focus of this paper is on computing these two parameters for graphs…
An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…
Extended admissible groups belong to a particular class of graphs of groups that admit a decomposition generalizing those of non-geometric 3-manifold groups and Croke-Kleiner admissible groups. In this paper, we study several…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
We prove that a quasiisometric map between rank one symmetric spaces is within bounded distance from a unique harmonic map. In particular, this completes the proof of the Schoen-Li-Wang conjecture.
The present paper is devoted to the study of mappings with finite distortion on Riemannian manifolds. Theorems on local behavior of generalized quasiisometries with unbounded characteristic of quasiconformality are obtained.
For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…
Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…
The \emph{distance-number} of a graph $G$ is the minimum number of distinct edge-lengths over all straight-line drawings of $G$ in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the…
The distortion of distances between points under maps is studied. We first prove a Schwarz-type lemma for quasiregular maps of the unit disk involving the visual angle metric. Then we investigate conversely the quasiconformality of a…
The category of metric spaces is a subcategory of quasi-metric spaces. In this paper the notion of entropy for the continuous maps of a quasi-metric space is extended via spanning and separated sets. Moreover, two metric spaces that are…
We study relations between maps between relatively hyperbolic groups/spaces and quasisymmetric embeddings between their boundaries. More specifically, we establish a correspondence between (not necessarily coarsely surjective)…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
The concept of a quasi-metric space arises by relaxing the requirement of the symmetry axiom in the definition of a metric. This small variation alters several structural properties possessed by a standard metric space. This article aims to…
Based on a notion by Gray and Kambites of hyperbolicity in the setting of semimetric spaces like digraphs or semigroups, we will construct (under a small additional geometric assumption) a boundary based on quasi-geodesic rays and anti-rays…
Let X, Y be the universal covers of two compact Riemannian manifolds (with dimension not equal to 4) with negative sectional curvature. Then every quasiisometry between them lies at a finite distance from a bilipschitz homeomorphism.
This thesis studies the graph alignment problem, the noisy version of the graph isomorphism problem, which aims to find a matching between the nodes of two graphs which preserves most of the edges. Focusing on the planted version where the…
We enumerate graph homomorphisms to quasi-complete graphs, i.e., graphs obtained from complete graphs by removing one edge. The source graphs are complete graphs, quasi-complete graphs, cycles, paths, wheels and broken wheels. These…
A celebrated theorem of Kanai states that quasi-isometries preserve isoperimetric inequalities between uniform Riemannian manifolds (with positive injectivity radius) and graphs. Our main result states that we can study the (Cheeger)…
Two emerging topics in graph theory are the study of cospectral vertices of a graph, and the study of isospectral reductions of graphs. In this paper, we prove a fundamental relationship between these two areas, which is that two vertices…