Random Information Spread in Networks

Details Random Information Spread in Networks Random Information Spread in Networks

2010-08-12

arxiv.org/abs/1008.2081v2

Mathematics

Combinatorics

17 pages, 1 figure

Scientific paper

Let G=(V,E) be an undirected loopless graph with possible parallel edges and s and t be two vertices of G. Assume that vertex s is labelled at the initial time step and that every labelled vertex copies its labelling to neighbouring vertices along edges with one labelled endpoint independently with probability p in one time step. In this paper, we establish the equivalence between the expected s-t first arrival time of the above spread process and the notion of the stochastic shortest s-t path. Moreover, we give a short discussion of analytical results on special graphs including the complete graph and s-t series-parallel graphs. Finally, we propose some lower bounds for the expected s-t first arrival time.

Affiliated with

Also associated with

No associations

Rating

Random Information Spread in Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Information Spread in Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Information Spread in Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-586738