東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ null ]

切換: 標籤 | MARC模式 | ISBD

Majority Dynamics With Almost Balanc...

Tran, Linh,

FindBook

Google Book

Amazon

博客來

Majority Dynamics With Almost Balanced Initial Settings: The Power of Few Phenomenon /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Majority Dynamics With Almost Balanced Initial Settings: The Power of Few Phenomenon // Linh Tran.
作者:	Tran, Linh,
面頁冊數:	1 electronic resource (100 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=31846177
ISBN:	9798286442133

Majority Dynamics With Almost Balanced Initial Settings: The Power of Few Phenomenon /
Tran, Linh,

Majority Dynamics With Almost Balanced Initial Settings: The Power of Few Phenomenon /Linh Tran. - 1 electronic resource (100 pages)

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

A community of n people participate in a parliamentary election with two major parties. Every person initially supports one side, and with each day, changes their opinion to match the majority among their friends. This process, commonly known as Majority Dynamics in literature, and similar processes, have been studied in many different contexts, including Statistical Physics, Computer Science, Economics and Ecology, as discussed in the influential survey by Mossel and Tamuz (2014).Tran and Vu (2019) considered the process on a Erdos-Renyi G(n, p) random graph and discovered the "Power of Few" phenomenon: Starting from a balanced initial state, one side can bribe a surprisingly small amount of voters to win every single vote a few days later. Since then, there has been a search for the minimum number of defectors needed for unanimous victory, for the widest possible range of the density p. This thesis aims to introduce the most recent results in this problem, proven by the author and collaborators, and how they correspond to progresses in another setting, where everyone chooses their initial opinions randomly and independently.Our first of two main theorem extends the Power of Few phenomenon for the widest possible range of densities: everything down to the connectivity threshold. Our second theorem is a substantially stronger version of the first, for half of the possible densities. This result also leads to a new best-known bound on the density required for unanimity in the settings with random initial opinions. We also briefly demonstrate two additional results: (1) the robustness of "Power of Few" in a more realistic setting where voters do not reliably change sides, and (2) the "Power of Few" effect in the sub-connectivity regime.

English

ISBN: 9798286442133Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Election

Majority Dynamics With Almost Balanced Initial Settings: The Power of Few Phenomenon /
LDR:03158nmm a22004333i 4500 001 2433399
005 20250825062324.5
006 m o d
007 cr|nu||||||||
008 261011s2025 miu||||||m |||||||eng d
020 $a 9798286442133
035 $a (MiAaPQD)AAI31846177
035 $a AAI31846177
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Tran, Linh, $e author. $3 3822992
245 1 0 $a Majority Dynamics With Almost Balanced Initial Settings: The Power of Few Phenomenon / $c Linh Tran.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2025
300 $a 1 electronic resource (100 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: Vu, Van Ha Committee members: Kenyon, Richard; Gilbert, Anna.
502 $b Ph.D. $c Yale University $d 2025.
520 $a A community of n people participate in a parliamentary election with two major parties. Every person initially supports one side, and with each day, changes their opinion to match the majority among their friends. This process, commonly known as Majority Dynamics in literature, and similar processes, have been studied in many different contexts, including Statistical Physics, Computer Science, Economics and Ecology, as discussed in the influential survey by Mossel and Tamuz (2014).Tran and Vu (2019) considered the process on a Erdos-Renyi G(n, p) random graph and discovered the "Power of Few" phenomenon: Starting from a balanced initial state, one side can bribe a surprisingly small amount of voters to win every single vote a few days later. Since then, there has been a search for the minimum number of defectors needed for unanimous victory, for the widest possible range of the density p. This thesis aims to introduce the most recent results in this problem, proven by the author and collaborators, and how they correspond to progresses in another setting, where everyone chooses their initial opinions randomly and independently.Our first of two main theorem extends the Power of Few phenomenon for the widest possible range of densities: everything down to the connectivity threshold. Our second theorem is a substantially stronger version of the first, for half of the possible densities. This result also leads to a new best-known bound on the density required for unanimity in the settings with random initial opinions. We also briefly demonstrate two additional results: (1) the robustness of "Power of Few" in a more realistic setting where voters do not reliably change sides, and (2) the "Power of Few" effect in the sub-connectivity regime.
546 $a English
590 $a School code: 0265
650 4 $a Mathematics. $3 515831
650 4 $a Theoretical mathematics. $3 3173530
650 4 $a Applied mathematics. $3 2122814
653 $a Election
653 $a Graph theory
653 $a Majority dynamics
653 $a Percolation
653 $a Random graphs
690 $a 0405
690 $a 0642
690 $a 0364
710 2 $a Yale University. $b Mathematics. $e degree granting institution. $3 3822989
720 1 $a Vu, Van Ha $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-12B.
790 $a 0265
791 $a Ph.D.
792 $a 2025
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=31846177