Jordan centre in random trees: persistence and distance to root
The Jordan centre of a graph is defined as a vertex whose maximum distance to other nodes
in the graph is minimal, and it finds applications in facility location and source detection …
in the graph is minimal, and it finds applications in facility location and source detection …