Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.28016

An Information-Theoretic Model for the Evolution of a Social Network

Johnathan Brink·Lewis Mitchell·Mengbin Ye
View original source ↗Read source document ↗Export metadata ↓

Abstract

Echo chambers and filter bubbles provide a framework to view communication and connection in a social network age. Such systems are characterised by isolated communities regurgitating information which reinforces prior beliefs. Theoretical analysis of echo chambers is suited for a network science approach to understand the mechanics of information influences between users. Here, we propose an evolutionary network model that extends the Quoter Model, rewiring edges according to cross-entropy between text-generating nodes. Parameters characterise binary reinforcement vs exploration node intents, determining whether a node will seek high or low novelty neighbours, measured by cross-entropy. Through an empirical simulation study, we observe emergent model attributes. Specifically, we compare to a Watts--Strogatz model, highlighting parameter regions of high clustering and hyper-exploration. Further, we identify a quality of disjoint communities akin to rudimentary echo chamber structures. These findings underscore user behaviours that drive echo chamber entrenchment, contextualising future social network analysis.

Explore related subjects

cs.SI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Johnathan Brink, Lewis Mitchell, Mengbin Ye. 2026-10-20. An Information-Theoretic Model for the Evolution of a Social Network. https://arxiv.org/abs/2610.28016

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

KEEP EXPLORING

Related papers

arXiv2026

Borda Aggregation Dynamics of Preference Orderings on Networks

We introduce and analyze a discrete-time network process in which each node holds a (weak) preference ordering over a finite set of alternatives and updates by local Borda aggregation. At each step, a node forms a weighted average (row-stochastic random-walk normalization) of its neighbors' Borda score vectors and projects the aggregated score back to a weak order. Updates are bounded: in each round, a node advances by at most one step along a shortest path in the fixed graph of preference orderings, following the direction prescribed by its neighbors' Borda-aggregated preferences. Our emphasis is dynamical: we develop sufficient conditions, stated directly in terms of graph topology, weights, and the bounded step rule, for (i) self-sustained oscillations in the absence of persistent sources, and (ii) forced oscillations under contrarian persistent camps. We also record robustness (structural stability) away from score-tie hyperplanes and contrast synchronous (Variant S) and asynchronous (Variant A) updating.

cs.SI↗
arXiv2026

Inference of Hierarchical Core-Periphery Structure in Temporal Networks

Networks can have various types of mesoscale structures. One such structure is core--periphery structure, which consists of sets of densely-connected core nodes and sets of sparsely-connected peripheral nodes. Core nodes are connected densely to other core nodes and are potentially connected densely to peripheral nodes, which are connected sparsely to other nodes. There has been much research on core--periphery structure in time-independent networks, but few core--periphery detection methods have been developed for time-dependent (i.e., ``temporal") networks. Using a multilayer-network representation of temporal networks and an inference approach that employs stochastic block models, we generalize a recent method for detecting hierarchical core--periphery structure \cite{Polanco23} from time-independent networks to temporal networks. In contrast to ``onion-like'' nested core--periphery structures (where each node is assigned to a group according to how deeply it is nested in a network's core), hierarchical core--periphery structures encompass networks with nested structures, tree-like structures (where any two groups must either be disjoint or have one group as a strict subset of the other group), and general non-nested mesoscale structures (where the group assignments of nodes do not have to be nested in any way). To perform statistical inference and thereby identify hierarchical core--periphery structure, we use a Markov-chain Monte Carlo (MCMC) approach. We illustrate our method for detecting hierarchical core--periphery structure in one synthetic temporal network and two real-world temporal networks, and we discuss the structures that we identify in these networks.

cs.SI↗
arXiv2026

Higher-Order Network Structure Inference: A Topological Approach to Network Selection

Thresholding---the pruning of nodes or edges based on their properties or weights---is an essential preprocessing tool for extracting interpretable structure from complex network data, yet existing methods face several key limitations. Threshold selection often relies on heuristic methods or trial and error due to large parameter spaces and unclear optimization criteria, leading to sensitivity where small parameter variations produce significant changes in network structure. Moreover, most approaches focus on pairwise relationships between nodes, overlooking critical higher-order interactions involving three or more nodes. We introduce a systematic thresholding algorithm that uses topological data analysis to identify optimal network parameters by accounting for higher-order structural relationships. Our method uses persistent homology to favor thresholds at which the network's topological representation is stable under small parameter changes, subject to minimum requirements for higher-order features. Hyperparameters allow users to specify minimum requirements for topological features, effectively constraining the parameter search to avoid spurious solutions. We demonstrate the approach using networks of concepts linked by co-occurrence in scientific abstracts. Across scientific fields, paired comparisons with ten alternative thresholds favor our method at the median for finite-feature density and normalized total persistence in homological dimensions one and two. Our approach allows researchers to incorporate domain-specific constraints and extends beyond network thresholding to general parameterization problems in data analysis.

cs.SI↗