Related papers: Geometric random graphs and Rado sets in sequence …
The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…
A random geometric graph $G_n$ is given by picking $n$ vertices in $\mathbb{R}^d$ independently under a common bounded probability distribution, with two vertices adjacent if and only if their $l^p$-distance is at most $r_n$. We investigate…
We investigate the class of completely regular codes in graphs with a distance partition C_0,..., C_\rho, where each set C_i, for 0<=i<=r-1, is an independent set. This work focuses on the existence problem for such codes in the…
Recently there has been increased interest in fitting generative graph models to real-world networks. In particular, Bl\"asius et al. have proposed a framework for systematic evaluation of the expressivity of random graph models. We extend…
Given any countable group $G$, we construct uncountably many quasi-isometry classes of proper geodesic metric spaces with quasi-isometry group isomorphic to $G$. Moreover, if the group $G$ is a hyperbolic group, the spaces we construct are…
The paper is devoted to a categorical study of the category of probabilistic metric spaces. The study is based on an isomorphic description of the category of probabilistic metric spaces. The isomorphic description was obtained in [3] and…
The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…
We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given…
For any countably infinite graph $G$, Ramsey's theorem guarantees an infinite monochromatic copy of $G$ in any $r$-coloring of the edges of the countably infinite complete graph $K_\mathbb{N}$. Taking this a step further, it is natural to…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
Let $ H $ be a compact subgroup of a locally compact group $G$. In this paper we define a convolution on $ M(G/H) $, the space of all complex bounded Radon measures on the homogeneous space G/H. Then we prove that the measure space $ M(G/H,…
Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…
The differential-geometric structure of the set of positive densities on a given measure space has raised the interest of many mathematicians after the discovery by C.R. Rao of the geometric meaning of the Fisher information. Most of the…
We prove that the class of reflexive asymptotic-$c_0$ Banach spaces is coarsely rigid, meaning that if a Banach space $X$ coarsely embeds into a reflexive asymptotic-$c_0$ space $Y$, then $X$ is also reflexive and asymptotic-$c_0$. In order…
The main result of this article is a rigidity result pertaining to the spreading model structure for Banach spaces coarsely embeddable into Tsirelson's original space $T^*$. Every Banach space that is coarsely embeddable into $T^*$ must be…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
A prominent tool in many problems involving metric spaces is a notion of randomized low-diameter decomposition. Loosely speaking, $\beta$-decomposition refers to a probability distribution over partitions of the metric into sets of low…
We prove that uniformly locally finite metric spaces with isomorphic Roe algebras must be coarsely equivalent. As an application, we also prove that the outer automorphism group of the Roe algebra of a metric space of bounded geometry is…
In 2013, Bollob\'as, Mitsche, and Pralat at gave upper and lower bounds for the likely metric dimension of random Erd\H{o}s-R\'enyi graphs $G(n,p)$ for a large range of expected degrees $d=pn$. However, their results only apply when $d \ge…
When studying networks using random graph models, one is sometimes faced with situations where the notion of adjacency between nodes reflects multiple constraints. Traditional random graph models are insufficient to handle such situations.…