Related papers: Sublinear Morse Geodesics and First Passage Percol…
This paper investigates the addition of random edges to arbitrary dense graphs; in particular, we determine the number of random edges required to ensure various monotone properties including the appearance of a fixed size clique, small…
We show that if $(X,d)$ is a metric space which admits a consistent convex geodesic bicombing, then we can construct a conical bicombing on $CB(X)$, the hyperspace of nonempty, closed, bounded, and convex subsets of $X$ (with the Hausdorff…
Metric graphs are ubiquitous in science and engineering. For example, many data are drawn from hidden spaces that are graph-like, such as the cosmic web. A metric graph offers one of the simplest yet still meaningful ways to represent the…
We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…
We define a random graph obtained via connecting each point of $\mathbb{Z}^d$ independently to a fixed number $1 \leq k \leq 2d$ of its nearest neighbors via a directed edge. We call this graph the directed $k$-neighbor graph. Two natural…
In this paper we consider the problem of approximating Euclidean distances by the infinite integer grid graph. Although the topology of the graph is fixed, we have control over the edge-weight assignment $w:E\to \mathbb{R}_{\ge 0}$, and…
Many concrete problems are formulated in terms of a finite set of points in $R^n$ which, via the ambient Euclidean metric, becomes a finite metric space. To obtain information from such a space, it is often useful to associate a graph to…
We study local modifications of the graph distance in large random triangulations. Our main results show that, in large scales, the modified distance behaves like a deterministic constant $\mathbf{c}~\in~(0,\infty)$ times the usual graph…
In this paper we introduce the perturbed version of the Barab\'asi-Albert random graph with multiple type edges and prove the existence of the (generalized) asymptotic degree distribution. Similarly to the non-perturbed case, the asymptotic…
For a given graph $G$, the metric and edge metric dimensions of $G$, $\dim(G)$ and ${\rm edim}(G)$, are the cardinalities of the smallest possible subsets of vertices in $V(G)$ such that they uniquely identify the vertices and the edges of…
Geodesic coalescence, or the tendency of geodesics to merge together, is a hallmark phenomenon observed in a variety of planar random geometries involving a random distortion of the Euclidean metric. As a result of this, the union of…
Let $(\Sigma, g)$ be a closed, oriented, negatively curved surface, and fix pairwise disjoint simple closed geodesics $\gamma_{\star,1}, \dots \gamma_{\star, r}$. We give an asymptotic growth as $L \to +\infty$ of the number of primitive…
A set S of vertices of a graph G is a geodesic transversal of G if every maximal geodesic of G contains at least one vertex of S. We determine a smallest geodesic transversal in certain interconnection networks such as mesh of trees, and…
We investigate intersections of geodesic lines in $H^2$ and in an associated tree T, proving the following result. Let M be a punctured hyperbolic torus and let $\gamma$ be a closed geodesic in M. Any edge of any triangle formed by distinct…
The directed landscape is a prominent model of random geometry which is believed to be the universal scaling limit of all planar random geometries in the Kardar-Parisi-Zhang universality class. It comes equipped with a few different natural…
An isoperimetric upper bound on the resistance is given. As a corollary we resolve two problems, regarding mean commute time on finite graphs and resistance on percolation clusters. Further conjectures are presented.
Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local…
Extremal properties of sparse graphs, randomly perturbed by the binomial random graph are considered. It is known that every $n$-vertex graph $G$ contains a complete minor of order $\Omega(n/\alpha(G))$. We prove that adding $\xi n$ random…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
We define a growing model of random graphs. Given a sequence of nonnegative integers $\{d_n\}_{n=0}^\infty$ with the property that $d_i\leq i$, we construct a random graph on countably infinitely many vertices $v_0,v_1\ldots$ by the…