Mina Young Pedersen

dblp:249/2704 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2024
0000-0001-8122-6236ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 first-author · 3 since 2021
YearPublicationVenuePosition
2024 Visibility and exploitation in social networks
abstract
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.
Rustam Galimullin, Mina Young Pedersen
Math. Struct. Comput. Sci.2
2022 Logic of Visibility in Social Networks
Rustam Galimullin, Mina Young Pedersen, Marija Slavkovik 0001
WoLLIC2
2021 Modal Logics and Group Polarization
abstract
Abstract This paper proposes different ways of modally defining properties related to the concept of balance in signed social networks where relations can be either positive or negative. The motivation is to be able to formally reason about the social phenomenon of group polarization based on balance theory. The starting point is a recently developed basic modal logic that axiomatizes the class of social networks that are balanced up to a certain degree. This property is not modally definable but can be captured using a deduction rule. In this work, we examine different possibilities for extending this basic language to define frame properties such as balance and related properties such as non-overlapping positive and negative relations and collective connectedness as axioms. Furthermore, we define the property of full balance rather than balanced-up-to-a-degree. We look into the complexity of the model checking problem and show a non-compactness result of the extended language. Along the way, we provide axioms for weak balance. We also look at a full hybrid extension and reason about network changes with dynamic modalities. Then, to explore the measures of how far a network is from polarization, we consider variations of measures in relation to balance.
Mina Young Pedersen, Sonja Smets, Thomas Ågotnes
J. Log. Comput.1