# Shortest paths in random graphs [closed]

I am currently faced with two similar problems.

First: given a random graph $G(n,p)$ in the Erdös-Renyi-model and a randomly chosen edge $e$, what is the expected number of shortest paths using $e$?

Second: given a complete graph with edge weights uniformly randomly chosen in the interval $[1, 1000]$ and a random edge of weight $\ell$. What is the expected number of shortest paths in the graph using the selected edge?

## closed as off-topic by Matthew Conroy, JonMark Perry, Claude Leibovici, Adriano, erfinkMay 17 '17 at 8:19

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Matthew Conroy, JonMark Perry, Claude Leibovici, Adriano, erfink
If this question can be reworded to fit the rules in the help center, please edit the question.