Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
1 answer
567 views

Random graphs and Benjamini-Schramm convergence

I am looking for literature on the question whether a randomly chosen sequence of $k$-regular graphs converges in the Benjamini-Schramm sense to the universal covering with probability one. There are ...
user avatar
5 votes
2 answers
474 views

Another graph characteristic

This question concerns a method of drawing graphs and a graph characteristic about which I want to learn more. Consider a connected directed graph with at least one node with in-degree 0 and one node ...
Hans-Peter Stricker's user avatar
4 votes
0 answers
94 views

Finding closest set of K disjoint hyperspheres to a point in $\mathbb{R}^n$ with uniform radius

I am interested in the following problem: in $\mathbb{R}^n$, we have $N$ overlapping hyperspheres all with the same radius. Given a point $p$ in $\mathbb{R}^n$, the objective is to find the $K$ non ...
eagle34's user avatar
  • 161
7 votes
1 answer
757 views

Length of nearest neighbor path in travel salesman problem

Given $n$ nodes uniformly distributed in $[0,1]^2$, consider the nearest neighbor algorithm to solve traveling salesman problem, i.e., each time I select the nearest neighbor not visited so far as the ...
lchen's user avatar
  • 367
9 votes
4 answers
371 views

Diameter of random segment intersection graph?

I have an even number of points $n$ randomly distributed (uniformly) in a disk. Then the points are randomly connected to form $n/2$ segments, a perfect matching. Finally, I form the intersection ...
Joseph O'Rourke's user avatar
0 votes
0 answers
320 views

Gromov-Hausdorff distance measure between minimum spanning trees

I am trying to compare minimum spanning trees through time. I have two questions: 1-Is it possible to measure the similarity between two minimum spanning trees with Gromov-Hausdorff distance measure ...
Sam's user avatar
  • 1
4 votes
0 answers
128 views

Metrized categories

Motivation: Let $\Gamma = (V,E)$ be a directed graph. To each edge $e \in E$, choose a value $\kappa^e \in \mathbb R$, representing the cost of transporting one unit of "stuff" through the edge. Let $\...
Tom LaGatta's user avatar
  • 8,512
4 votes
2 answers
882 views

The probability distribution for vertex degree in a unit disc graph generated from random points on a plane

Imagine I cover an arbitrarily large plane with randomly placed points at some density $\rho$ s.t. the number of points in any randomly sampled area $A$ (of arbitrary shape and size) is $\approx A*\...
FloatingLantern's user avatar
3 votes
1 answer
443 views

What is the expected value for this

If there are $8$ random points in the plane whose horizontal coordinate and vertical coordinate are uniformly distributed on the open interval $\left(0,1\right)$, what is the expected largest size of ...
user0o's user avatar
  • 31
3 votes
0 answers
146 views

The mean number of vertices in small connected components of random geometric graphs

I place $N$ points on a circular plane of radius $R$, and draw edges to connect points that are less than or equal to some distance $D$ to form a set of graphs or cliques $G_i$. As a function of $N$, ...
EclipseInterlude's user avatar