東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Probabilistic Variations of Zero For...

Brennan, Zachary Daniel,

FindBook

Google Book

Amazon

博客來

Probabilistic Variations of Zero Forcing and Power Domination /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Probabilistic Variations of Zero Forcing and Power Domination // Zachary Daniel Brennan.
作者:	Brennan, Zachary Daniel,
面頁冊數:	1 electronic resource (93 pages)
附註:	Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
Contained By:	Dissertations Abstracts International86-12B.
標題:	Mathematics. -
電子資源:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31936489
ISBN:	9798286430307

Probabilistic Variations of Zero Forcing and Power Domination /
Brennan, Zachary Daniel,

Probabilistic Variations of Zero Forcing and Power Domination /Zachary Daniel Brennan. - 1 electronic resource (93 pages)

Source: Dissertations Abstracts International, Volume: 86-12, Section: B.

Zero forcing is a graph propagation process in which white vertices are colored blue by neighboring blue vertices. Probabilistic zero forcing is a generalization of zero forcing where a blue vertex $v$ colors a white neighbor blue with probability proportional to the number of blue neighbors of $v$. In this dissertation we introduce two probabilistic variations on zero forcing and probabilistic zero forcing with connections to disease spread and power grid modeling.The first variation is reversion probabilistic zero forcing (RPZF), which generalizes probabilistic zero forcing so that blue vertices now "recover" (revert to being white) at some fixed rate. We formalize the study of RPZF through Markov chain theory, which provides methods of calculating any graph's probability of becoming all white or all blue from a given starting configuration as well as the time at which this is expected to occur.Moreover, the long-term behavior of the process is studied in-depth on the complete graph and some related structures, developing a threshold number of blue vertices such that with high probability the graph is entirely blue in the next round.The second variation is fragile power domination. The power domination problem seeks to minimize the number of phasor measurement units (PMUs) necessary to monitor the power grid. This is formalized in a graph theoretic process consisting of a domination step (sensors observe neighboring vertices) and a zero forcing step (observation propagates throughout the graph according to the zero forcing rule). Fragile power domination introduces random sensor failure before the domination step, and the goal of fragile power domination is to understand optimal sensor placements under different probabilities of sensor failure. In particular, we study the expected number of observed vertices and relate this to fault-tolerant and PMU-defect-robust power domination.

English

ISBN: 9798286430307Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Graph theory

Probabilistic Variations of Zero Forcing and Power Domination /
LDR:03362nmm a22004333i 4500 001 2433434
005 20250825062331.5
006 m o d
007 cr|nu||||||||
008 261011s2025 miu||||||m |||||||eng d
020 $a 9798286430307
035 $a (MiAaPQD)AAI31936489
035 $a AAI31936489
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Brennan, Zachary Daniel, $e author. $0 (orcid)0000-0001-5704-2285 $3 3823045
245 1 0 $a Probabilistic Variations of Zero Forcing and Power Domination / $c Zachary Daniel Brennan.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2025
300 $a 1 electronic resource (93 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
500 $a Advisors: Herzog, David; Hogben, Leslie Committee members: Lidicky, Bernard; Lutz, Jack; Martin, Ryan.
502 $b Ph.D. $c Iowa State University $d 2025.
520 $a Zero forcing is a graph propagation process in which white vertices are colored blue by neighboring blue vertices. Probabilistic zero forcing is a generalization of zero forcing where a blue vertex $v$ colors a white neighbor blue with probability proportional to the number of blue neighbors of $v$. In this dissertation we introduce two probabilistic variations on zero forcing and probabilistic zero forcing with connections to disease spread and power grid modeling.The first variation is reversion probabilistic zero forcing (RPZF), which generalizes probabilistic zero forcing so that blue vertices now "recover" (revert to being white) at some fixed rate. We formalize the study of RPZF through Markov chain theory, which provides methods of calculating any graph's probability of becoming all white or all blue from a given starting configuration as well as the time at which this is expected to occur.Moreover, the long-term behavior of the process is studied in-depth on the complete graph and some related structures, developing a threshold number of blue vertices such that with high probability the graph is entirely blue in the next round.The second variation is fragile power domination. The power domination problem seeks to minimize the number of phasor measurement units (PMUs) necessary to monitor the power grid. This is formalized in a graph theoretic process consisting of a domination step (sensors observe neighboring vertices) and a zero forcing step (observation propagates throughout the graph according to the zero forcing rule). Fragile power domination introduces random sensor failure before the domination step, and the goal of fragile power domination is to understand optimal sensor placements under different probabilities of sensor failure. In particular, we study the expected number of observed vertices and relate this to fault-tolerant and PMU-defect-robust power domination.
546 $a English
590 $a School code: 0097
650 4 $a Mathematics. $3 515831
650 4 $a Theoretical mathematics. $3 3173530
650 4 $a Applied mathematics. $3 2122814
653 $a Graph theory
653 $a Linear algebra
653 $a Markov chains
653 $a Zero forcing
690 $a 0405
690 $a 0642
690 $a 0364
710 2 $a Iowa State University. $b Mathematics. $e degree granting institution. $3 3822982
720 1 $a Herzog, David $e degree supervisor.
720 1 $a Hogben, Leslie $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-12B.
790 $a 0097
791 $a Ph.D.
792 $a 2025
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31936489