Search arXivSearch

arXiv · 2501.08498

Heterogeneous Update Processes Shape Information Cascades in Social Networks

Abstract

A common assumption in the literature on information diffusion is that populations are homogeneous regarding individuals' information acquisition and propagation process: Individuals update their informed and actively communicating state either through imitation (simple contagion) or peer influence (complex contagion). Here, we study the impact of the mixing and placement of individuals with different update processes on how information cascades in social networks. We consider Simple Spreaders, which take information from a random neighbor and communicate it, and Threshold-based Spreaders, which require a threshold number of active neighbors to change their state to active communication. Even though, in a population made exclusively of Simple Spreaders, information reaches all elements of any (connected) network, we show that, when Simple and Threshold-based Spreaders coexist and occupy random positions in a social network, the number of Simple Spreaders systematically amplifies the cascades only in degree heterogeneous networks (exponential and scale-free). In random and modular structures, this cascading effect originated by Simple Spreaders only exists above a critical mass of these individuals. In contrast, when Threshold-based Spreaders are assorted preferentially in the nodes with a higher degree, the cascading effect of Simple Spreaders vanishes, and the spread of information is drastically impaired. Overall, the study highlights the significance of the strategic placement of different roles in networked structures, with Simple Spreaders driving widespread cascades in heterogeneous networks and Threshold-based Spreaders playing a critical regulatory role in information spread with a tunable effect based on the threshold value.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Flávio L. Pinheiro, Vítor V. Vasconcelos. 2025-01-15. Heterogeneous Update Processes Shape Information Cascades in Social Networks. https://arxiv.org/abs/2501.08498

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

KEEP EXPLORING

Related papers

Highway Congestion Reduction through Reinforcement Learning Based Eulerian Headway Control

Connected automated vehicles (CAVs) equipped with adaptive cruise control (ACC) create new opportunities for highway congestion mitigation. Traditional practice relies on Eulerian variable speed limits (VSL) which regulate traffic through roadside signs, but suffer from infrequent updates and limited driver compliance. Recent research explored Lagrangian strategies that directly control individual vehicles, offering high reactivity and compliance, yet in realistic multi-lane settings they depend on drivers' latent lane-change intentions, making robust vehicle-level decisions difficult. Hence, we propose an Eulerian control system optimized through reinforcement learning, that (i) leverages ACC for reactivity and compliance, and (ii) obviates dependence on latent driver intentions by regulating aggregate density near bottlenecks, crucially via headway commands rather than speed commands. We evaluate two variants of our system, time-headway and distance-headway control, in large-scale simulations across a range of traffic conditions. Both variants outperform baselines, improving traffic flow by up to 10.6% over human traffic and 6.7% over traditional VSL. To strengthen evaluation, we propose a novel boundary-aware speed metric addressing a recognized flaw in simulation studies with dynamic vehicle entry and exit. The empirical results, together with our emphasis on deployable system design, suggest a path towards practical, safe, and scalable highway congestion mitigation.

cs.MA

The Bystander Effect in Multi-Agent Reasoning: Quantifying Cognitive Loafing in Collaborative Interactions

Multi-agent systems (MAS) assume that collaborating inherently improves Large Language Model (LLM) reasoning. We challenge this by demonstrating that simulated social pressure triggers an algorithmic ``Bystander Effect,'' inducing severe cognitive loafing. By evaluating 22,500 deterministic trajectories across 3 dataset contexts (GAIA, SWE-bench, Multi-Challenge) with 3 state-of-the-art (SOTA) models, we semantically audit internal reasoning traces against external outputs. We formalize the \textit{Interaction Depth Limit} ($D_L$), the exact plurality threshold where an agent's logical sovereignty collapses into social compliance. Crucially, we uncover the \textit{Sovereignty Gap}: models frequently compute the correct derivation internally but suffer ``Alignment Hallucinations'' -- actively subjugating empirical evidence to sycophantically appease a simulated swarm. We prove that multi-agent social load is strictly non-commutative; the "brand" identity of the ``Lead Anchor'' auditor disproportionately dictates the swarm's integrity. These findings expose architectural vulnerabilities, proving that unstructured multi-agent topologies can degrade independent reasoning.

cs.MA

CONCAT: Consensus- and Confidence-Driven Ad Hoc Teaming for Efficient LLM-Based Multi-Agent Systems

Although large language model (LLM) based multi-agent systems (MAS) show their capability to solve complex tasks and achieve higher performance over single agent systems, they lead to huge computational overheads because of heavy communication between agents. Previous research has made efforts to train a sparse multi-agent graph or fine-tune a planner to orchestrate the workflow better. However, such extra training processes introduce computational costs and limit MAS to specific domains, therefore compromising their generalizability. In this paper, we propose CONCAT, a training-free multi-agent collaboration framework based on CONsensus and Confidence-driven Ad hoc Teaming to efficiently organize agent interactions. Specifically, agents are clustered based on their initial answers, and leaders of each cluster are selected based on the agents' confidence. Then, a heuristic function based on the Theory of Mind is designed to predict the collaboration benefits between every two leaders according to their answers and confidence. Finally, an ad hoc multi-agent network is organized after evicting a percentage of communications based on the predicted benefits. Experiments across three LLMs and three benchmarks show that CONCAT achieves up to 2.02x higher efficiency (accuracy/latency ratio) than LLM-Debate and outperforms training-aware methods such as AgentDropout, while reducing average latency by 50.1% on Qwen2.5-14B-Instruct, without any task-specific training.

cs.MA