Cited By
View all- Chen YKannan SKhanna S(2020)Near-Perfect Recovery in the One-Dimensional Latent Space ModelProceedings of The Web Conference 202010.1145/3366423.3380261(1932-1942)Online publication date: 20-Apr-2020
We consider the following long-range percolation model: an undirected graph with the node set {0, 1, ..., N}d, has edges (x, y) selected with probability ≈ β/||x -y||s if ||x - y|| < 1, and with probability 1 if ||x - y|| = 1, for some parameters β, s < ...
We study the asymptotic growth of the diameter of a graph obtained by adding sparse “long” edges to a square box in <span>\documentclass{article} \usepackage{amsmath,amsfonts}\pagestyle{empty}\begin{document} ${\mathbb Z}^d$ \end{document}<***...
The eccentricity e(υ) of υ is the distance to a farthest vertex from υ. The diameter diam(G) is the maximum eccentricity among the vertices of G. The contraction of edge e = uυ in G consists of removing e and identifying u and υ as a single new vertex w,...
Society for Industrial and Applied Mathematics
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in