On the st-spreading resistance of networks
Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t ∈ V. Assume that s is labelled at initial time step and that every labelled vertex spreads its labelling to neighbouring vertices with probability p in one time step. In this paper, we deal with the special case of...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2010
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/7817 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | Let G = (V, E) be an undirected loopless graph with possible parallel edges and s, t ∈ V. Assume that s is labelled at initial time step and that every labelled vertex spreads its labelling to neighbouring vertices with probability p in one time step. In this paper, we deal with the special case of this spread process called st-spread resistance of G. We establish the connection between the st-spread resistance to the Kulkarni's exponential spreading model where each edge in G is an exponential random variate with intensity p. |
|---|