Approximating inter-point distances in directed Bernoulli graphs

A. D. Barbour, Gesine Reinert

In directed random graphs, in which edges can be assigned to have one of two directions, or perhaps both, the distance between two vertices $v$ and $v^{\prime }$ can be computed along paths…