Author
Listed:
- Yin, Qian
- Wan, Yicong
- Wang, Zhishuang
- Guo, Linyuan
- Hong, Zhiyong
Abstract
To describe the significant group interactions and higher-order effects in competitive information spreading on real online social systems, this study constructs a competitive information spreading framework based on a single-layer hypergraph to characterize the competitive diffusion process of multiple types of information in group environments. In this model, both pairwise contact-based spreading and higher-order spreading driven by the overall opinion atmosphere within hyperedges are considered. Based on the proposed spreading mechanism, this paper develops the corresponding microscopic Markov chain dynamical equations and theoretically analyzes the outbreak threshold conditions under both single-information spreading and competitive spreading. Numerical simulations verify the validity of the analytical results and reveal various influences exerted by several key factors on competitive spreading behavior. The results show that a message type with a higher transmission rate is more likely to dominate in this competition, and higher-order interactions can further amplify that spreading ability for the dominant message type and accelerate its diffusion process. Compared with Poisson hypergraphs, the dominant information in power-law hypergraphs usually reaches a higher steady-state density. The steady-state survival regions of the two competing information types are mainly determined by their relative spreading abilities, and the analytically derived thresholds are highly consistent with the numerical results. In addition, the structural positions of initial spreader nodes can significantly affect the competition outcome, and may even enable information with a lower transmission rate to reverse the competition and finally survive. The intervention by fixed-state spreader nodes can also significantly enhance the competitive advantage of the corresponding information and effectively change the competition pattern. The present work offers a new analytical reference to understanding these spreading laws as well as regulation mechanisms of competitive information in higher-order group environments.
Suggested Citation
Yin, Qian & Wan, Yicong & Wang, Zhishuang & Guo, Linyuan & Hong, Zhiyong, 2026.
"Dynamics of competitive information propagation on hypergraphs,"
Chaos, Solitons & Fractals, Elsevier, vol. 210(P1).
Handle:
RePEc:eee:chsofr:v:210:y:2026:i:p1:s0960077926008088
DOI: 10.1016/j.chaos.2026.118667
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:chsofr:v:210:y:2026:i:p1:s0960077926008088. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thayer, Thomas R. (email available below). General contact details of provider: https://www.journals.elsevier.com/chaos-solitons-and-fractals .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.