Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.20021

Ergodic and Metastable Behavior of Stochastic Popularity Dynamics in Social Networks

Chiara Ravazzi·Paolo Frasca·Gaya Cocca
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper studies popularity dynamics in social networks, where users' engagement with competing channels is driven by intrinsic content quality, social influence, and popularity feedback. We introduce a stochastic model in which users interact through a directed influence network and channel exposure depends jointly on these three mechanisms. We first characterize the resulting dynamics in the absence of intrinsic quality, showing that popularity concentrates asymptotically on a single channel, leading to a winner-takes-all regime. When all channels have positive intrinsic quality, we establish ergodicity of the popularity process and characterize its long-run behavior. We further show that, when intrinsic quality is small, the system exhibits metastable behavior: it can remain for long periods near configurations dominated by a single channel before transitioning to another. These results highlight how weak quality differences can coexist with strong path dependence induced by popularity feedback. We then investigate platform-level interventions and propose controls that compensate for network-induced exposure biases and mitigate excessive concentration. Analytical results are illustrated through numerical simulations and an empirical analysis of YouTube data, whose observed popularity dynamics are consistent with the proposed stochastic framework. The results provide a mathematical framework for understanding the interplay between quality, social influence, and reinforcement in online popularity dynamics.

Explore related subjects

cs.SIcs.SYeess.SYmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chiara Ravazzi, Paolo Frasca, Gaya Cocca. 2026-10-14. Ergodic and Metastable Behavior of Stochastic Popularity Dynamics in Social Networks. https://arxiv.org/abs/2610.20021

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

KEEP EXPLORING

Related papers

arXiv2026

Ideological discrepancy between Facebook pages and shared news is associated with reaction homogeneity

Cross-cutting political content is often expected to mitigate polarization, yet encounters across ideological lines do not necessarily foster more constructive engagement. We analyzed 4,584 posts from 1,243 Facebook pages sharing 761 political news links in a dataset centered on Brazil's 2018 presidential election, and introduced Bias Discrepancy, which measures how far a shared link lies from the page's ideological sharing repertoire. We examined how Bias Discrepancy related to Content Reaction Positivity (how positively the same link was received in other posts), the Reaction Homogeneity Index (whether a post's own reactions were one-sided or mixed), and the toxicity of the page's accompanying text. Reaction homogeneity was lowest at both extremes of Bias Discrepancy, and posts furthest from the page's repertoire had the highest average toxicity. In a multivariable model, greater Bias Discrepancy was associated with lower reaction homogeneity, with a magnitude similar to the link's content bias and toxicity and smaller than Content Reaction Positivity. When a page shared news that departed from its repertoire, its accompanying text tended to be more toxic and its audience's reactions more mixed.

cs.SI↗
arXiv2026

Structural Properties of DomiRank Centrality: Symmetry Axioms, an Entropy Bound, and Spectral Interpolation

DomiRank is a node-importance algorithm for unweighted networks, defined by a dynamical model governed by a competition-strength parameter, a dominance threshold, and a decay rate. We establish three structural results. First, on symmetry. Automorphism-related vertices share the same DomiRank value, and a graph whose values are pairwise distinct must be asymmetric. The orbit count bounds the number of distinct values, and regular and vertex-transitive graphs admit closed forms. Second, on entropy. The maximum of the DomiRank entropy over connected graphs, log_2 N, is attained if and only if the graph is regular. The initial entropy derivative is the degree-log-degree edge covariance, making the decrease rigorous near vanishing competition for structurally disassortative graphs, and an assortative counterexample shows it does not extend to all graphs; a sufficient-condition theorem and a refined conjecture cover the rest. Third, on spectrum. The normalized distribution is sigma-invariant if and only if the degree vector is an adjacency-matrix eigenvector. The parameter sigma interpolates continuously between degree and smallest-eigenvector centrality within the resolvent (Bonacich-type) family, its sensitivity being a second-order suppression operator on the degree vector. Graph transformations are also characterized, including the m-product. Experiments on four real networks and synthetic families up to 10^4 vertices confirm the interpolation and exhibit monotone entropy decrease, continuous ranking interpolation, decaying positive fraction and ranking reversals; where the positive fraction has decayed far from one, the limit describes the solution vector rather than the induced ranking. DomiRank is thus a tunable complement to principal-eigenvector centrality. A companion study quantifies how much of its task-level edge over a degree baseline survives degree correction.

cs.SI↗
arXiv2026

Semantic Communities and Boundary-Spanning Lyrics in K-pop: A Graph-Based Unsupervised Analysis

We examine how lyric representation shapes computational similarity using four 384-dimensional multilingual MiniLM representations of 7,891 K-pop songs by 1,456 artists from charts spanning 2000 to October 2023. Whole-song truncated embeddings provide the strongest standardized separation between neighbouring and random song pairs (1.995), compared with 1.931 for chunked documents, although chunked representations show greater adjusted Rand agreement and line-based representations yield higher modularity. Using whole-song embeddings, we construct a weighted cosine nearest-neighbour graph ($k=30$). A representative Louvain partition identifies 21 operational communities, without a corresponding robust plateau in the Markov Stability analysis. AI-assisted examination of selected lyrics and terms suggests overlapping patterns of memory, separation, longing, self-reflection, attraction, and performance. Community membership is associated with character-script composition (Cramér's $V=0.294$; permutation $p=0.001$). High-participation songs exhibit broader cross-community connectivity, while participation has weak negative associations with embedding-relative novelty. These findings show how representation choices and textual characteristics influence the network organization of a cultural corpus, subject to limitations from truncation, graph construction, and the absence of independent human semantic validation.

cs.SI↗