Search arXiv⌕ Search

arXiv · 2610.20381

Contagious Misinterpretations: Social Learning with Shared Interpretations

Abstract

When people discuss which of several hypotheses is true, they share not only their beliefs but also their interpretation of each one, that is, the distribution of signals each hypothesis is expected to produce. This interpretation is an opinion about what each hypothesis means and what evidence it predicts, and it is revised only through conversation, not by confronting it with the observed data. Standard non-Bayesian social learning captures only belief-sharing and keeps the likelihoods private. We study what happens when agents share both beliefs and likelihoods under static networks. We show that interpretations converge geometrically to a common reading shaped by the most influential agents. Then, beliefs concentrate, almost surely and at an exponential rate, on the hypothesis that, under this consensus interpretation, best explains the signals privately observed by all agents taken together. As a result, sharing interpretations can lead a population to adopt, unanimously and confidently, a hypothesis it would have rejected if it had shared only beliefs. Whether this helps or hurts when a true hypothesis exists depends on how accurately agents initially read the data they observe. When every agent initially interprets the true hypothesis exactly as the data it would observe, sharing interpretations cannot strictly improve learning and can strictly harm it when agents observe different data distributions. When interpretations are logically coherent and some agents misread their own data, sharing can either rescue the population, leading it to learn the true hypothesis, if an accurate reading dominates the interpretation network, or corrupt it, leading it to a wrong hypothesis, if a misreading one does.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pol Rodríguez Farrés, Jesus Cerquides. 2026-10-14. Contagious Misinterpretations: Social Learning with Shared Interpretations. https://arxiv.org/abs/2610.20381

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

KEEP EXPLORING

Related papers

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↗

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↗

Multiplicative Path Weights in Networks: From Katz Connectivity to Mean First-Passage Times

Signal dispersion, stress propagation in interbank systems, and transmission probabilities in epidemic and reliability models are all captured by studying paths on directed graphs where the path weight is defined as the product of its edge weights. Connectivity in such networks is naturally quantified by aggregating these multiplicative path weights across nodes. This paper provides a comprehensive treatise on connectivity and ranking measures based on multiplicative path weights. We demonstrate how standard all-path connectivity, such as the standard Katz centrality, can be extended beyond its classical spectral threshold. In addition, we derive closed-form expressions for connectivity based on first-hit paths and introduce a new version of Katz centrality. Furthermore, for random edge weights, we derive resolvent-based expressions for the first and second moments, alongside variance bounds, under a path-indexed coupling framework. Finite irreducible Markov chains are a subclass of the models studied, and we show that the scaled matrix of first-hit path probabilities is the probability-generating function for first-passage and return times, and that differentiation yields the classical first-passage times. Numerical examples illustrate the application of our results in a variety of settings.

cs.SI↗