2026-09-19T05:23:05Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/1073772022-01-13T07:54:01Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
John N. Tsitsiklis.
Ben Chaouch, Zied
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2017-03-10T15:07:48Z
2017-03-10T15:07:48Z
2016
2016
http://hdl.handle.net/1721.1/107377
973722726
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 131-132).
The problem of maximizing the spread of an opinion inside a social network has been investigated extensively during the past decade. The importance of this problem in applications such as marketing has been amplified by the major expansion of online social networks. In this thesis, we study opinion control policies, first under a broad class of deterministic dynamics governing the interactions inside a network, and then under the classical "Voter Model". In the former case, we design a policy that a controller can follow in order to spread an opinion inside a network with the smallest possible cost. In the latter case, we consider networks whose underlying graph is the d-dimensional integer torus Zd/n, and we design policies that minimize the expected time until the network reaches a consensus. We also show that, in dimension d >/= 2, dynamic policies do not perform significantly better than static policies, while, in dimension d = 1, optimal dynamic policies perform much better than optimal static policies..
by Zied Ben Chaouch.
S.M.
132 pages
eng
Massachusetts Institute of Technology
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.
http://dspace.mit.edu/handle/1721.1/7582
Electrical Engineering and Computer Science.
Influence maximization over a network : static and dynamic policies
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="89126f18-9292-47af-8991-a17387d44d2a">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Influence maximization over a network : static and dynamic policies</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2016</PublicationDate>
<Authors>
<Author>
<DisplayName>Ben Chaouch, Zied</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>The problem of maximizing the spread of an opinion inside a social network has been investigated extensively during the past decade. The importance of this problem in applications such as marketing has been amplified by the major expansion of online social networks. In this thesis, we study opinion control policies, first under a broad class of deterministic dynamics governing the interactions inside a network, and then under the classical "Voter Model". In the former case, we design a policy that a controller can follow in order to spread an opinion inside a network with the smallest possible cost. In the latter case, we consider networks whose underlying graph is the d-dimensional integer torus Zd/n, and we design policies that minimize the expected time until the network reaches a consensus. We also show that, in dimension d >/= 2, dynamic policies do not perform significantly better than static policies, while, in dimension d = 1, optimal dynamic policies perform much better than optimal static policies..</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>