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...

Full description

Saved in:
Bibliographic Details
Main Author: Lapus, Raymond R.
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
id oai:animorepository.dlsu.edu.ph:faculty_research-8529
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:faculty_research-85292022-11-18T05:59:42Z On the st-spreading resistance of networks Lapus, Raymond R. 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. 2010-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/7817 Faculty Research Work Animo Repository Graph theory Mathematics
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
topic Graph theory
Mathematics
spellingShingle Graph theory
Mathematics
Lapus, Raymond R.
On the st-spreading resistance of networks
description 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.
format text
author Lapus, Raymond R.
author_facet Lapus, Raymond R.
author_sort Lapus, Raymond R.
title On the st-spreading resistance of networks
title_short On the st-spreading resistance of networks
title_full On the st-spreading resistance of networks
title_fullStr On the st-spreading resistance of networks
title_full_unstemmed On the st-spreading resistance of networks
title_sort on the st-spreading resistance of networks
publisher Animo Repository
publishDate 2010
url https://animorepository.dlsu.edu.ph/faculty_research/7817
_version_ 1767196765537173504