Chen Dong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Chen Dong has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
Pingle Yang
3 shared publications- Fanyuan Meng
Alibaba Research Center for Complexity Sciences, Hangzhou Normal University, Hangzhou, China
2 shared publications Jianlin Zhang
2 shared publicationsJuntao Lu
2 shared publications- Aoxue Qiu1 shared publication
Fanyuan Meng
Research Center for Complexity Sciences Hangzhou Normal University Hangzhou China
1 shared publication
Latest Publications
- 12 October 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 213
Sequential dual-threshold cascade dynamics on random hypergraphs
- 12 October 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 213
Sequential dual-threshold cascade dynamics on random hypergraphs
- Open Access
- 2 May 2026
- Published by Elsevier in SSRN Electronic Journal
Sequential dual-threshold cascade dynamics on random hypergraphs
Existing cascade models on hypergraphs universally adopt homogeneous node roles and single-stage synchronous activation, failing to capture the hierarchical sequential decision-making in real social groups, where leader consensus must precede follower mobilization. To fill this gap, we propose a novel two-stage threshold cascade model on role-differentiated hypergraphs, which enforces a strict sequential activation rule: a hyperedge can only activate its follower set via the overall execution threshold \(\phi_2\) after its leader subset meets the leader consensus threshold \(\phi_1\). We derive the self-consistent equation for steady-state cascade size via mean-field approximation and cavity method, and validate theoretical predictions through numerical simulations on Poisson and uniform hyperedge size distributions. Our results show that the system exhibits universal discontinuous first-order phase transitions, with the leader threshold \(\phi_1\) dominating cascade initiation. We further find that the "small leader - large follower" configuration significantly reduces the critical initial seed fraction, and uncover a non-monotonic discrete truncation effect under uniform distributions. This work provides a rigorous theoretical framework for hierarchical contagion in higher-order networks.- 2 May 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessSequential dual-threshold cascade dynamics on random hypergraphs
Existing cascade models on hypergraphs universally adopt homogeneous node roles and single-stage synchronous activation, failing to capture the hierarchical sequential decision-making in real social groups, where leader consensus must precede follower mobilization. To fill this gap, we propose a novel two-stage threshold cascade model on role-differentiated hypergraphs, which enforces a strict sequential activation rule: a hyperedge can only activate its follower set via the overall execution threshold \(\phi_2\) after its leader subset meets the leader consensus threshold \(\phi_1\). We derive the self-consistent equation for steady-state cascade size via mean-field approximation and cavity method, and validate theoretical predictions through numerical simulations on Poisson and uniform hyperedge size distributions. Our results show that the system exhibits universal discontinuous first-order phase transitions, with the leader threshold \(\phi_1\) dominating cascade initiation. We further find that the "small leader - large follower" configuration significantly reduces the critical initial seed fraction, and uncover a non-monotonic discrete truncation effect under uniform distributions. This work provides a rigorous theoretical framework for hierarchical contagion in higher-order networks. - 6 March 2026
- Published by Elsevier in Neurocomputing
- Vol. 680
CBFSIM: A community-based four-stage framework for identifying influential spreaders in social networks
- 6 March 2026
- Published by Elsevier in Neurocomputing
- Vol. 680
CBFSIM: A community-based four-stage framework for identifying influential spreaders in social networks
- 23 January 2026
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 38 (3)
MADS‐UC: Finding Key Users in Online Social Networks Through Users Activation Activeness and Combination Weighting MCDM
In online social networks, identifying influential users is crucial for maintaining network stability and accelerating information dissemination. However, most of the existing research evaluate the influence of users according to the topological structure of local or global networks, which ignores the historical information and social interactions of users. In this work, we introduce a novel algorithm called MADS‐UC to pinpoint the influential super‐spreaders of information. Specifically, three kinds of activation influence between each pair of users are defined to better portray the mutual interactions with each other, and the proposed measure makes full consideration of the topological and historical information of networks, and the social interactions of users. Then, a hybrid multi‐attribute decision‐making algorithm is put forward to evaluate the influence of users, while the obtained three kinds of activation influence are introduced as basic indicators, and the weight for each indicator is determined from both subjective and objective dimensions. Finally, to achieve a good balance between algorithm accuracy and time complexity, the influential users are identified by considering the interactions between a user and other users within its influence range. We collect seven real‐world datasets from the Sina Weibo platform in 2024 about mobile product Honor, and a series of experiments is conducted to validate the effectiveness of the MADS‐UC algorithm. Experimental results show that MADS‐UC surpasses six widely used algorithms in robustness, sensitivity analysis, and distinguishing capability, which is useful in accelerating the dissemination of information in the product marketing process.
- 23 January 2026
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 38 (3)
MADS‐UC: Finding Key Users in Online Social Networks Through Users Activation Activeness and Combination Weighting MCDM
In online social networks, identifying influential users is crucial for maintaining network stability and accelerating information dissemination. However, most of the existing research evaluate the influence of users according to the topological structure of local or global networks, which ignores the historical information and social interactions of users. In this work, we introduce a novel algorithm called MADS‐UC to pinpoint the influential super‐spreaders of information. Specifically, three kinds of activation influence between each pair of users are defined to better portray the mutual interactions with each other, and the proposed measure makes full consideration of the topological and historical information of networks, and the social interactions of users. Then, a hybrid multi‐attribute decision‐making algorithm is put forward to evaluate the influence of users, while the obtained three kinds of activation influence are introduced as basic indicators, and the weight for each indicator is determined from both subjective and objective dimensions. Finally, to achieve a good balance between algorithm accuracy and time complexity, the influential users are identified by considering the interactions between a user and other users within its influence range. We collect seven real‐world datasets from the Sina Weibo platform in 2024 about mobile product Honor, and a series of experiments is conducted to validate the effectiveness of the MADS‐UC algorithm. Experimental results show that MADS‐UC surpasses six widely used algorithms in robustness, sensitivity analysis, and distinguishing capability, which is useful in accelerating the dissemination of information in the product marketing process.