Abstract

We examine computing the maximum expected influence on paths and trees using the independent cascade model. We designed a polynomial time method for determining the expected influence from any initial state on the independent cascade model on acyclic influence graphs in O(|V(G)|² · max {|V(G)|,|V(E)|}) time. We designed a polynomial time program that would computes the maximum expected influence and optimal initially selected nodes on arbitrary paths in O(|V(T)|⁶/[epsilon]) on approximating the maximum expected influence on arbitrary trees with absolute error of at most ([epsilon] · 2|V(T)|).

Library of Congress Subject Headings

Paths and cycles (Graph theory); Trees (Graph theory); Graph theory--Data processing

Publication Date

2011

Document Type

Thesis

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Homan, Christopher

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA166.22 .M68 2011

Campus

RIT – Main Campus

Download

Share

COinS