Visibility and exploitation in social networks
Social media is not a neutral channel. How visible information posted online is depends on many factors such as the network structure, the emotional volatility of the content, and the design of the social media platform. In this paper, we use formal methods to study the visibility of agents and info...
Gespeichert in:
| Veröffentlicht in: | Mathematical structures in computer science 2024-08, Vol.34 (7), p.615-644 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 644 |
|---|---|
| container_issue | 7 |
| container_start_page | 615 |
| container_title | Mathematical structures in computer science |
| container_volume | 34 |
| creator | Galimullin, Rustam Pedersen, Mina Young |
| description | Social media is not a neutral channel. How visible information posted online is depends on many factors such as the network structure, the emotional volatility of the content, and the design of the social media platform. In this paper, we use formal methods to study the visibility of agents and information in a social network, as well as how vulnerable the network is to exploitation. We introduce a modal logic to reason about a social network of agents that can follow each other, post, and share information. We show that by imposing some simple rules on the system, a potentially malicious agent can take advantage of the network construction to post an unpopular opinion that may reach many agents. The network is presented both in static and dynamic forms. We prove completeness, expressivity, and model checking problem complexity results for the corresponding logical systems. |
| doi_str_mv | 10.1017/S0960129523000397 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3131716316</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cupid>10_1017_S0960129523000397</cupid><sourcerecordid>3131716316</sourcerecordid><originalsourceid>FETCH-LOGICAL-c312t-8630af17fe253f3d15a550cbcff95743498d552d7939d1986a670fcd8c8677903</originalsourceid><addsrcrecordid>eNp1kM1LAzEQxYMoWKt_gLcFz1tndppkc5TiFxQ8-HFd0nxI6nZTky3a_94tLXgQYWAOb35vHo-xS4QJAsrrZ1ACsFK8IgAgJY_YCKdClTXI6piNdnK500_ZWc5LACQENWKTt5DDIrSh3xa6s4X7Xrcx9LoPsStCV-Rogm6LzvVfMX3kc3bidZvdxWGP2evd7cvsoZw_3T_ObualIaz6shYE2qP0ruLkySLXnINZGO8Vl1OaqtpyXlmpSFlUtdBCgje2NrWQUgGN2dXed53i58blvlnGTeqGlw0NySUKGmbMcH9lUsw5Od-sU1jptG0Qml0tzZ9aBoYOjF4tUrDv7tf6f-oHIH5iZg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3131716316</pqid></control><display><type>article</type><title>Visibility and exploitation in social networks</title><source>Cambridge University Press Journals Complete</source><creator>Galimullin, Rustam ; Pedersen, Mina Young</creator><creatorcontrib>Galimullin, Rustam ; Pedersen, Mina Young</creatorcontrib><description>Social media is not a neutral channel. How visible information posted online is depends on many factors such as the network structure, the emotional volatility of the content, and the design of the social media platform. In this paper, we use formal methods to study the visibility of agents and information in a social network, as well as how vulnerable the network is to exploitation. We introduce a modal logic to reason about a social network of agents that can follow each other, post, and share information. We show that by imposing some simple rules on the system, a potentially malicious agent can take advantage of the network construction to post an unpopular opinion that may reach many agents. The network is presented both in static and dynamic forms. We prove completeness, expressivity, and model checking problem complexity results for the corresponding logical systems.</description><identifier>ISSN: 0960-1295</identifier><identifier>EISSN: 1469-8072</identifier><identifier>DOI: 10.1017/S0960129523000397</identifier><language>eng</language><publisher>Cambridge, UK: Cambridge University Press</publisher><subject>Design factors ; Digital media ; Exploitation ; Formal method ; Logic ; Social network analysis ; Social networks ; Special Issue: WoLLIC 2022 ; Visibility</subject><ispartof>Mathematical structures in computer science, 2024-08, Vol.34 (7), p.615-644</ispartof><rights>The Author(s), 2023. Published by Cambridge University Press</rights><rights>The Author(s), 2023. Published by Cambridge University Press. This work is licensed under the Creative Commons Attribution License This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited. (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c312t-8630af17fe253f3d15a550cbcff95743498d552d7939d1986a670fcd8c8677903</cites><orcidid>0000-0001-8122-6236</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.cambridge.org/core/product/identifier/S0960129523000397/type/journal_article$$EHTML$$P50$$Gcambridge$$Hfree_for_read</linktohtml><link.rule.ids>164,314,776,780,27901,27902,55603</link.rule.ids></links><search><creatorcontrib>Galimullin, Rustam</creatorcontrib><creatorcontrib>Pedersen, Mina Young</creatorcontrib><title>Visibility and exploitation in social networks</title><title>Mathematical structures in computer science</title><addtitle>Math. Struct. Comp. Sci</addtitle><description>Social media is not a neutral channel. How visible information posted online is depends on many factors such as the network structure, the emotional volatility of the content, and the design of the social media platform. In this paper, we use formal methods to study the visibility of agents and information in a social network, as well as how vulnerable the network is to exploitation. We introduce a modal logic to reason about a social network of agents that can follow each other, post, and share information. We show that by imposing some simple rules on the system, a potentially malicious agent can take advantage of the network construction to post an unpopular opinion that may reach many agents. The network is presented both in static and dynamic forms. We prove completeness, expressivity, and model checking problem complexity results for the corresponding logical systems.</description><subject>Design factors</subject><subject>Digital media</subject><subject>Exploitation</subject><subject>Formal method</subject><subject>Logic</subject><subject>Social network analysis</subject><subject>Social networks</subject><subject>Special Issue: WoLLIC 2022</subject><subject>Visibility</subject><issn>0960-1295</issn><issn>1469-8072</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>IKXGN</sourceid><recordid>eNp1kM1LAzEQxYMoWKt_gLcFz1tndppkc5TiFxQ8-HFd0nxI6nZTky3a_94tLXgQYWAOb35vHo-xS4QJAsrrZ1ACsFK8IgAgJY_YCKdClTXI6piNdnK500_ZWc5LACQENWKTt5DDIrSh3xa6s4X7Xrcx9LoPsStCV-Rogm6LzvVfMX3kc3bidZvdxWGP2evd7cvsoZw_3T_ObualIaz6shYE2qP0ruLkySLXnINZGO8Vl1OaqtpyXlmpSFlUtdBCgje2NrWQUgGN2dXed53i58blvlnGTeqGlw0NySUKGmbMcH9lUsw5Od-sU1jptG0Qml0tzZ9aBoYOjF4tUrDv7tf6f-oHIH5iZg</recordid><startdate>20240801</startdate><enddate>20240801</enddate><creator>Galimullin, Rustam</creator><creator>Pedersen, Mina Young</creator><general>Cambridge University Press</general><scope>IKXGN</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-8122-6236</orcidid></search><sort><creationdate>20240801</creationdate><title>Visibility and exploitation in social networks</title><author>Galimullin, Rustam ; Pedersen, Mina Young</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c312t-8630af17fe253f3d15a550cbcff95743498d552d7939d1986a670fcd8c8677903</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Design factors</topic><topic>Digital media</topic><topic>Exploitation</topic><topic>Formal method</topic><topic>Logic</topic><topic>Social network analysis</topic><topic>Social networks</topic><topic>Special Issue: WoLLIC 2022</topic><topic>Visibility</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Galimullin, Rustam</creatorcontrib><creatorcontrib>Pedersen, Mina Young</creatorcontrib><collection>Cambridge Journals Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Mathematical structures in computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Galimullin, Rustam</au><au>Pedersen, Mina Young</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Visibility and exploitation in social networks</atitle><jtitle>Mathematical structures in computer science</jtitle><addtitle>Math. Struct. Comp. Sci</addtitle><date>2024-08-01</date><risdate>2024</risdate><volume>34</volume><issue>7</issue><spage>615</spage><epage>644</epage><pages>615-644</pages><issn>0960-1295</issn><eissn>1469-8072</eissn><abstract>Social media is not a neutral channel. How visible information posted online is depends on many factors such as the network structure, the emotional volatility of the content, and the design of the social media platform. In this paper, we use formal methods to study the visibility of agents and information in a social network, as well as how vulnerable the network is to exploitation. We introduce a modal logic to reason about a social network of agents that can follow each other, post, and share information. We show that by imposing some simple rules on the system, a potentially malicious agent can take advantage of the network construction to post an unpopular opinion that may reach many agents. The network is presented both in static and dynamic forms. We prove completeness, expressivity, and model checking problem complexity results for the corresponding logical systems.</abstract><cop>Cambridge, UK</cop><pub>Cambridge University Press</pub><doi>10.1017/S0960129523000397</doi><tpages>30</tpages><orcidid>https://orcid.org/0000-0001-8122-6236</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0960-1295 |
| ispartof | Mathematical structures in computer science, 2024-08, Vol.34 (7), p.615-644 |
| issn | 0960-1295 1469-8072 |
| language | eng |
| recordid | cdi_proquest_journals_3131716316 |
| source | Cambridge University Press Journals Complete |
| subjects | Design factors Digital media Exploitation Formal method Logic Social network analysis Social networks Special Issue: WoLLIC 2022 Visibility |
| title | Visibility and exploitation in social networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T20%3A17%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Visibility%20and%20exploitation%20in%20social%20networks&rft.jtitle=Mathematical%20structures%20in%20computer%20science&rft.au=Galimullin,%20Rustam&rft.date=2024-08-01&rft.volume=34&rft.issue=7&rft.spage=615&rft.epage=644&rft.pages=615-644&rft.issn=0960-1295&rft.eissn=1469-8072&rft_id=info:doi/10.1017/S0960129523000397&rft_dat=%3Cproquest_cross%3E3131716316%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3131716316&rft_id=info:pmid/&rft_cupid=10_1017_S0960129523000397&rfr_iscdi=true |