Search arXivSearch

arXiv · 2008.11453

A Framework for Quantifying Controversy of Social Network Debates Using Attributed Networks: Biased Random Walk (BRW)

Abstract

All societies have been much more bipolar over the past few years, particularly after the emergence of online social networks and media. In fact, the gap between the two ends of social spectrum is going to be even deeper after the spread of new media. In this circumstance, social polarization has been a growing concern among socialists and computer science experts because of the detrimental impact which online social networks can have on societies by adding fuel to the fire of extremism. Several types of research were conducted for proposing measures to calculate the controversy level in social networks, afterward, to reduce controversy among contradicting viewpoints, for example, by exposing opinions of one side to other side's members. Most of the attempts for quantifying social networks' controversy have considered the networks in their most primary forms, without any attributes. Although these kinds of researches provide platform-free algorithms to be used in different social networks, they are not able to take into account a great deal of useful information provided by users (node attributes).To surmount this shortcoming, we propose a framework to be utilized in different networks with different attributes. We propelled some Biased Random Walks (BRW) to find their path from start point to an initially unknown endpoint with respect to initial energy of start node and energy loss of nodes on the path. We extracted structural attribute of networks, using node2vec, and compared it with state-of-the-art algorithms, and showed its accuracy. Then, we extracted some content attributes of user and analyze their effects on the results of our algorithm. BRW is compared with another state-of-the-art controversy measuring algorithm. Then, its changes in different level of controversy in Persian Twitter is considered to show how it works in different circumstance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hanif Emamgholizadeh, Milad Nourizade, Mir Saman Tajbakhsh, Mahdieh Hashminezhad, Farzaneh Nasr Esfahani. 2020-11-07. A Framework for Quantifying Controversy of Social Network Debates Using Attributed Networks: Biased Random Walk (BRW). https://doi.org/10.1007/s13278-020-00703-1

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

User Influence Analysis Based on Blogs

Rumor and word of mouth spread at the same speed as the highway of information diffusion in the age of the internet. Social networks play quite an important role in the huge internet. Nowadays, social networks have become indispensable in our lives, especially for the government and enterprises. A social network becomes a complex information diffusion network with users working as nodes and the relationships between users working as the vehicle. In this paper, we propose three kinds of algorithms for computing user influence based on the behavior of a user's forwarding microblogs and the symbol of @ in microblogs. We evaluate the effectiveness of the algorithms by comparing the results of our work with the training data in the dataset, and in the end, it proves that our algorithms work well.

cs.SI

Location transparency reduces activity by accounts misrepresenting their location on X

Concerns about inauthentic accounts, including foreign actors posing as domestic voices, are central to debates about online discourse. Yet, little is known about accounts with inaccurate location claims and how they behave when discrepancies between their claimed and actual locations become publicly visible. In November 2025, X introduced an "About this account" feature that discloses each account's platform-inferred location of operation. We leverage this intervention in a large-scale quasi-experimental study of 8,200 politically engaged accounts claiming a U.S. location, comparing accounts whose disclosed locations matched versus contradicted their claims across 1.3 million posts and 3.6 million replies over 21 weeks. Before disclosure, location-mismatched accounts posted more misleading, scam-related, and cryptocurrency-related content, but showed no distinctive partisan leaning. Difference-in-differences estimates show that disclosure reduced the posting activity of location-mismatched accounts by 13.1% with the largest declines among accounts revealed to be in Africa (29.2%) and Asia (24.4%), and among accounts with VPN flags, username changes, or scam- and crypto-heavy content. Additionally, the decline in their replies was concentrated in interactions with U.S.-based recipients (10.3%), whereas replies to non-U.S.-based recipients showed no statistically significant change. Conversely, there was no significant change in average audience engagement with their posts. Location transparency thus works primarily by inducing restraint among the disclosed accounts rather than by shifting audience behaviour, and the accounts it constrains look at least as much like cross-border fraud as foreign political influence.

cs.SI

Diffusion-Induced Spatial Attention Overlapping Community Detection

Detection of overlapping communities is essential for modelling networks in which nodes participate simultaneously in multiple structural or functional groups. Existing graph neural network approaches commonly rely on local message passing, which can obscure community boundaries through smoothing and limit the representation of structurally relevant long-range dependencies. We introduce Diffusion-Induced Spatial Attention Community Detection (DISCO), a deep-learning framework that combines a structural prior derived from influence spreading dynamics, sparse multi-head attention, and non-negative community-affiliation learning. The prior identifies candidate interactions beyond immediate graph neighbours and biases attention according to their structural proximity, while a Bernoulli-Poisson edge-reconstruction objective enables overlapping community inference from node attributes and structural profiles, or both. Benchmark experiments show that DISCO performs competitively against established graph convolutional and graph attention approaches across different input configurations. To demonstrate its practical applicability, we present a proof-of-concept cybersecurity use case in which changes between community assignments inferred from consecutive communication-network snapshots provide an interpretable anomaly signal. Temporal community similarity identifies structural deviations, while node-level contributions help locate the devices associated with them. DISCO therefore provides both a flexible method for overlapping community detection and a foundation for analysing structural change in dynamic networks.

cs.SI