Related papers: Random graphs, weak coarse embeddings, and higher …

Consider a random graph process where vertices are chosen from the interval $[0,1]$, and edges are chosen independently at random, but so that, for a given vertex $x$, the probability that there is an edge to a vertex $y$ decreases as the…

We study the joint degree counts in proportional attachment random graphs and find a simple representation for the limit distribution in infinite sequence space. We show weak convergence with respect to the p-norm topology for appropriate p…

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

Node embeddings map graph vertices into low-dimensional Euclidean spaces while preserving structural information. They are central to tasks such as node classification, link prediction, and signal reconstruction. A key goal is to design…

Preferential attachment graphs are random graphs designed to mimic properties of typical real world networks. They are constructed by a random process that iteratively adds vertices and attaches them preferentially to vertices that already…

It follows from the Marcus-Spielman-Srivastava proof of the Kadison-Singer conjecture that if $G=(V,E)$ is a $\Delta$-regular dense expander then there is an edge-induced subgraph $H=(V,E_H)$ of $G$ of constant maximum degree which is also…

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

Random planar graphs have been the subject of much recent work. Many basic properties of the standard uniform random planar graph P_{n}, by which we mean a graph chosen uniformly at random from the set of all planar graphs with vertex set…

The random graph is an infinite graph with the universal property that any embedding of $G-v$ extends to an embedding of $G$, for any finite graph. In this paper we show that this graph embeds in the curve graph of a surface $\Sigma$ if and…

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

We prove a general relative higher index theorem for complete manifolds with positive scalar curvature towards infinity. We apply this theorem to study Riemannian metrics of positive scalar curvature on manifolds. For every two metrics of…

We study the effect of the choice of embedding geometry on the entropy of random geometric graph ensembles with soft connection functions. First we show that when the connection range is small, the entropy is dependent only on the dimension…

Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…

A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We consider classes of pseudo-random graphs on $n$ vertices for which the degree of every vertex and the co-degree between every pair of vertices are in the intervals $(np - Cn^\delta,np+Cn^\delta)$ and $(np^2- C n^\delta, np^2 +C…

A version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time…

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

One major open conjecture in the area of critical random graphs, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [23, 24, 28, 63] is as follows: for a wide array of random…

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…