Ask a Question

Prefer a chat interface with context about you and your work?

Distance distribution in random graphs and application to network exploration

Distance distribution in random graphs and application to network exploration

We consider the problem of determining the proportion of edges that are discovered in an Erd\ifmmode \mbox{\H{o}}\else \H{o}\fi{}s-R\'enyi graph when one constructs all shortest paths from a given source node to all other nodes. This problem is equivalent to the one of determining the proportion of edges connecting nodes that …