Abstract

We consider two options for a particle’s entire journey through a certaindirectedgraph. Both options involve a random assignment to the journey route to be followed. We are interested in the option that offers, on average, the shortest route. Therefore, we determine the average journey length for each of the two options. As part of our analysis, we provesome combinatorial identities that appear to be new. Some suggestions for further work are given.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call