Charlotte Out

Charlotte Out

Auto-generated profile, based on publicly available information

Charlotte Out

University of Cambridge, Cambridge, United Kingdom

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 October 2024
Verified
Conference Paper
Open access
COCharlotte Out
Charlotte Out
STSijing Tu
Sijing Tu
SNStefan Neumann
Stefan Neumann
AZAhad N. Zehmakan
Ahad N. Zehmakan
To obtain a foundational understanding of timeline algorithms and viral content in shaping public opinions, computer scientists started to study augmented versions of opinion formation models from sociology. In this paper, we generalize the popular Friedkin--Johnsen model to include the effects of external media sources on opinion formation. Our goal is to mathematically analyze the influence of biased media, arising from factors such as manipulated news reporting or the phenomenon of false balance. Within our framework, we examine the scenario of two opposing media sources, which do not adapt their opinions like ordinary nodes, and analyze the conditions and the number of periods required for radicalizing the opinions in the network. When both media sources possess equal influence, we theoretically characterize the final opinion configuration. In the special case where there is only a single media source present, we prove that media sources which do not adapt their opinions are significantly more powerful than those which do. Lastly, we conduct the experiments on real-world and synthetic datasets, showing that our theoretical guarantees closely align with experimental simulations.

4 December 2023 in Information Sciences
Verified
Journal Article
Open access
COCharlotte Out
Charlotte Out
AZAhad N. Zehmakan
Ahad N. Zehmakan
Consider a graph G and suppose that initially each node is colored either black or white. In the majority model, in each round all nodes simultaneously update their color to the most frequent color among their neighbors. Experiments on the graph data from the real world social networks (SNs) suggest that if an extremely small set of high-degree nodes, often referred to as the elites, all agree on a color, that color becomes the dominant color at the end of the process. We propose two countermeasures that can be adopted by individual nodes relatively easily and guarantee that the elites will not have this disproportionate power to engineer the dominant output color. The first countermeasure essentially requires each node to make some new connections at random, while the second one demands the nodes to be more reluctant towards changing their color. We verify their effectiveness and correctness both theoretically and experimentally. We also investigate the majority model and a variant of it when the initial coloring is random on the real world SNs and several random graph models. In particular, our results on the Erdős-Rényi and regular random graphs confirm or support several theoretical findings or conjectures by the prior work regarding the threshold behavior of the process.