東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Analysis, Modeling, and Control of D...

Amelkin, Victor.

FindBook

Google Book

Amazon

博客來

Analysis, Modeling, and Control of Dynamic Processes in Networks.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Analysis, Modeling, and Control of Dynamic Processes in Networks./
作者:	Amelkin, Victor.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	182 p.
附註:	Source: Dissertations Abstracts International, Volume: 80-04, Section: B.
Contained By:	Dissertations Abstracts International80-04B.
標題:	Computer Engineering. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10830255
ISBN:	9780438417359

Analysis, Modeling, and Control of Dynamic Processes in Networks.
Amelkin, Victor.

Analysis, Modeling, and Control of Dynamic Processes in Networks. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 182 p.

Source: Dissertations Abstracts International, Volume: 80-04, Section: B.

Thesis (Ph.D.)--University of California, Santa Barbara, 2018.

This item must not be added to any third party search indexes.

Dynamic network processes have surrounded people for millennia. Information spread through social networks, alliance formation in financial and organizational networks, heat diffusion through material networks, and distributed synchronization in robotic networks are just a few examples. Network processes are studies along three dimensions: analysis of network processes through the data produced by them; designing complex plausible, yet, tractable mathematical models for network processes; and designing control mechanisms that would guide network processes towards desirable evolution patterns. This thesis advances the frontier of knowledge about network processes along each of these three dimensions, emphasizing applications to social networks. The first part of the thesis is dedicated to the design of a method for model-driven analysis of a polar opinion formation process in social networks. The core of the method is a distance measure quantifying the likelihood of a social network's transitioning between different states with respect to a chosen opinion dynamics model characterizing expected evolution of the network's state. I describe how to design such a distance measure relying upon the classical transportation problem, compute it in linear time, and use it in applications. In the second part of the thesis, I focus on designing a model for polar opinion formation in social networks, and define a class of non-linear models that capture the dependence of the users' opinion formation behavior upon the opinions themselves. The obtained models are connected to socio-psychological theories, and their behavior is theoretically analyzed employing tools from non-smooth analysis and a generalization of LaSalle Invariance Principle. The third part of the thesis targets the problem of defense against social control. While the existing socio-psychological theories as well as influence maximization techniques expose the opinion formation process in social networks to external attacks, I propose an algorithm that nullifies the effect of such attacks by strategically recommending a small number of new edges to the network's users. The optimization problem underlying the algorithm is NP-hard, and I provide a pseudo-linear time heuristic-drawing upon the theory of Markov chains-that solves the problem approximately and performs well in experiments.

ISBN: 9780438417359Subjects--Topical Terms:

1567821
Computer Engineering.
Subjects--Index Terms:

Control theory

Analysis, Modeling, and Control of Dynamic Processes in Networks.
LDR:03700nmm a2200397 4500 001 2273564
005 20201109124808.5
008 220629s2018 ||||||||||||||||| ||eng d
020 $a 9780438417359
035 $a (MiAaPQ)AAI10830255
035 $a (MiAaPQ)ucsb:13966
035 $a AAI10830255
040 $a MiAaPQ $c MiAaPQ
100 1 $a Amelkin, Victor. $3 3551013
245 1 0 $a Analysis, Modeling, and Control of Dynamic Processes in Networks.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 182 p.
500 $a Source: Dissertations Abstracts International, Volume: 80-04, Section: B.
500 $a Publisher info.: Dissertation/Thesis.
500 $a Advisor: Singh, Ambuj K.
502 $a Thesis (Ph.D.)--University of California, Santa Barbara, 2018.
506 $a This item must not be added to any third party search indexes.
506 $a This item must not be sold to any third party vendors.
520 $a Dynamic network processes have surrounded people for millennia. Information spread through social networks, alliance formation in financial and organizational networks, heat diffusion through material networks, and distributed synchronization in robotic networks are just a few examples. Network processes are studies along three dimensions: analysis of network processes through the data produced by them; designing complex plausible, yet, tractable mathematical models for network processes; and designing control mechanisms that would guide network processes towards desirable evolution patterns. This thesis advances the frontier of knowledge about network processes along each of these three dimensions, emphasizing applications to social networks. The first part of the thesis is dedicated to the design of a method for model-driven analysis of a polar opinion formation process in social networks. The core of the method is a distance measure quantifying the likelihood of a social network's transitioning between different states with respect to a chosen opinion dynamics model characterizing expected evolution of the network's state. I describe how to design such a distance measure relying upon the classical transportation problem, compute it in linear time, and use it in applications. In the second part of the thesis, I focus on designing a model for polar opinion formation in social networks, and define a class of non-linear models that capture the dependence of the users' opinion formation behavior upon the opinions themselves. The obtained models are connected to socio-psychological theories, and their behavior is theoretically analyzed employing tools from non-smooth analysis and a generalization of LaSalle Invariance Principle. The third part of the thesis targets the problem of defense against social control. While the existing socio-psychological theories as well as influence maximization techniques expose the opinion formation process in social networks to external attacks, I propose an algorithm that nullifies the effect of such attacks by strategically recommending a small number of new edges to the network's users. The optimization problem underlying the algorithm is NP-hard, and I provide a pseudo-linear time heuristic-drawing upon the theory of Markov chains-that solves the problem approximately and performs well in experiments.
590 $a School code: 0035.
650 4 $a Computer Engineering. $3 1567821
650 4 $a Computer science. $3 523869
653 $a Control theory
653 $a Model-driven analysis
653 $a Network science
653 $a Non-linear model
653 $a Social network
690 $a 0464
690 $a 0984
710 2 $a University of California, Santa Barbara. $b Computer Science. $3 1018455
773 0 $t Dissertations Abstracts International $g 80-04B.
790 $a 0035
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10830255