Fanyuan Meng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Interests
Fanyuan Meng has a total of 88 co-authors. Here are the top co-authors by number of shared publications:
Jianlin Zhang
13 shared publicationsLongqing Cui
11 shared publicationsYalin Wang
9 shared publicationsXingfu Ke
8 shared publications- Run-Ran Liu
Research Center for Complexity Sciences Hangzhou Normal University 311121 Hangzhou Zhejiang China
7 shared publications Hao Yu
Department of Systems Science, School of Mathematics, Southeast University, Nanjing, China
6 shared publications
Latest Publications
- 1 November 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (11)
Sequential cascades on random hypergraphs
Sequential decisions within a group can correlate individual adoption outcomes, but this microscopic dependence is usually replaced by an imposed group-level response. We study a one-shot cascade on sparse random hypergraphs in which the first target in a newly triggered hyperedge adopts with probability p, whereas each later target adopts with probability p + Δ after a success and p − δ after a failure. For this stated process, we derive the exact target marginal qm, the complete correlated group-offspring probability-generating function Fm(z), and the early branching factor B. The classical Galton–Watson criterion then places the infinitesimal-seed onset at B=1, while its extinction fixed point depends on the complete offspring law. The new ingredients are the exact transfer-matrix offspring law for outcome memory and a matched-independent hypergraph control with the same qm and onset. For the original-cardinality null, directed-incidence percolation gives Rnull = ρnullSnull; the forward-survival and backward-reachability maps coincide for pairwise groups but generally differ for larger groups. Monte Carlo tests across group-size and degree laws support the threshold and survival predictions. A collision-aware control, which rematches the null to the number of targets actually remaining at first processing, reduces but does not remove the observed final-size gap at the tested parameters. System-size and cutoff sweeps likewise show that the 5% finite-network indicator is a proxy rather than the branching-survival probability. All claims are conditional on one-shot triggering, a vanishing seed density, and locally tree-like topology.
- 1 November 2026
- Published by AIP Publishing in Chaos: An Interdisciplinary Journal of Nonlinear Science
- Vol. 36 (11)
Sequential cascades on random hypergraphs
Sequential decisions within a group can correlate individual adoption outcomes, but this microscopic dependence is usually replaced by an imposed group-level response. We study a one-shot cascade on sparse random hypergraphs in which the first target in a newly triggered hyperedge adopts with probability p, whereas each later target adopts with probability p + Δ after a success and p − δ after a failure. For this stated process, we derive the exact target marginal qm, the complete correlated group-offspring probability-generating function Fm(z), and the early branching factor B. The classical Galton–Watson criterion then places the infinitesimal-seed onset at B=1, while its extinction fixed point depends on the complete offspring law. The new ingredients are the exact transfer-matrix offspring law for outcome memory and a matched-independent hypergraph control with the same qm and onset. For the original-cardinality null, directed-incidence percolation gives Rnull = ρnullSnull; the forward-survival and backward-reachability maps coincide for pairwise groups but generally differ for larger groups. Monte Carlo tests across group-size and degree laws support the threshold and survival predictions. A collision-aware control, which rematches the null to the number of targets actually remaining at first processing, reduces but does not remove the observed final-size gap at the tested parameters. System-size and cutoff sweeps likewise show that the 5% finite-network indicator is a proxy rather than the branching-survival probability. All claims are conditional on one-shot triggering, a vanishing seed density, and locally tree-like topology.
- 30 October 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 213
Information cascades in directed hypergraphs
- 30 October 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 213
Information cascades in directed hypergraphs
- Open Access
- 25 October 2026
- Published by Elsevier in SSRN Electronic Journal
Life-cycle order shapes cooperation in multilevel populations
Collective reproduction and population regulation both change the variation on which group selection acts. We study a finite multilevel game in which composition-changing fission and uniform group removal occur in opposite orders. The two life cycles share the same game, fecundity weights, individual updates, and final population capacity. Reversing the group-event order shifts cooperation thresholds and can reverse the relative fixation success of cooperators and defectors. Exact neutral recursions for within-group mixedness and between-group assortment explain this difference. Death--birth generates more assortment through segregation, whereas birth--death preserves existing assortment for longer. Weak selection accumulates these effects over the neutral history, so a one-step comparison cannot determine fixation. The relative rates of turnover and segregation determine whether cooperation thresholds grow linearly, diverge sublinearly, or approach finite large-group limits. Exact finite-state calculations recover the weak-selection predictions and show that stronger selection can move a fixed game outside the order-sensitive interval. For unbiased, composition-conserving inheritance in the stated class, the conditional daughter second moment determines the first-order response, although transient histories and finite-selection dynamics can differ. The evolution of cooperation thus depends on when assortment is generated and how long it persists.
- 25 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLife-cycle order shapes cooperation in multilevel populations
Collective reproduction and population regulation both change the variation on which group selection acts. We study a finite multilevel game in which composition-changing fission and uniform group removal occur in opposite orders. The two life cycles share the same game, fecundity weights, individual updates, and final population capacity. Reversing the group-event order shifts cooperation thresholds and can reverse the relative fixation success of cooperators and defectors. Exact neutral recursions for within-group mixedness and between-group assortment explain this difference. Death--birth generates more assortment through segregation, whereas birth--death preserves existing assortment for longer. Weak selection accumulates these effects over the neutral history, so a one-step comparison cannot determine fixation. The relative rates of turnover and segregation determine whether cooperation thresholds grow linearly, diverge sublinearly, or approach finite large-group limits. Exact finite-state calculations recover the weak-selection predictions and show that stronger selection can move a fixed game outside the order-sensitive interval. For unbiased, composition-conserving inheritance in the stated class, the conditional daughter second moment determines the first-order response, although transient histories and finite-selection dynamics can differ. The evolution of cooperation thus depends on when assortment is generated and how long it persists.
- 19 October 2026
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 278
Heterogeneous k-core percolation on random hypergraphs
- 19 October 2026
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 278
Heterogeneous k-core percolation on random hypergraphs
- 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
- 10 October 2026
- Published by Elsevier in SSRN Electronic Journal
Bounded-window cascades on random hypergraphs
Increasing the seed fraction is usually expected to strengthen an information cascade. Under higher-order group interactions with bounded responses, however, excessive seeding can leave many nodes active while destroying the active-hyperedge backbone that connects them. To resolve this over-seeding paradox, we propose a two-level threshold cascade model with bounded activation windows on random hypergraphs. Under the fractional convention studied here, a hyperedge activates only when its active-node fraction lies in $[m_a^{\mathrm F},m_b^{\mathrm F}]$, and a node activates only when its active-hyperedge fraction lies in $[k_a^{\mathrm F},k_b^{\mathrm F}]$. Because activation is irreversible, an inactive element that overshoots its upper threshold can never return to the activation window. We develop a path-dependent dynamic message-passing theory that tracks the first entrance into the node and hyperedge windows and predicts the final active-node ratio $r_a$. For connectivity, we supplement the marginal incidence reconstruction with an activation-time-conditioned (ATC) closure that retains the leading feedback by which a newly activated endpoint changes the later activation probability of its incident branches. The correction improves the sparse high-seed prediction on average, but it is not pointwise exact, which exposes residual multi-branch correlations. Independent finite-size graph-ensemble scans and a local cavity expansion identify a continuous high-seed structural extinction with $r_g\propto r_{0,c}-r_0$ in the baseline regime. We further compare synchronous dynamics with Gillespie asynchronous dynamics and vary the node--hyperedge rate ratio. Relative response times transfer dynamical missed-window events between the hyperedge and node levels, reshaping the intermediate-seed cascade. By contrast, the extreme high-seed tail is controlled by initial hyperedge oversaturation, which is irreversible and independent of the update ordering. The over-seeding paradox thus contains a protocol-independent structural core together with rate-dependent kinetic corrections.- 10 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessBounded-window cascades on random hypergraphs
Increasing the seed fraction is usually expected to strengthen an information cascade. Under higher-order group interactions with bounded responses, however, excessive seeding can leave many nodes active while destroying the active-hyperedge backbone that connects them. To resolve this over-seeding paradox, we propose a two-level threshold cascade model with bounded activation windows on random hypergraphs. Under the fractional convention studied here, a hyperedge activates only when its active-node fraction lies in $[m_a^{\mathrm F},m_b^{\mathrm F}]$, and a node activates only when its active-hyperedge fraction lies in $[k_a^{\mathrm F},k_b^{\mathrm F}]$. Because activation is irreversible, an inactive element that overshoots its upper threshold can never return to the activation window. We develop a path-dependent dynamic message-passing theory that tracks the first entrance into the node and hyperedge windows and predicts the final active-node ratio $r_a$. For connectivity, we supplement the marginal incidence reconstruction with an activation-time-conditioned (ATC) closure that retains the leading feedback by which a newly activated endpoint changes the later activation probability of its incident branches. The correction improves the sparse high-seed prediction on average, but it is not pointwise exact, which exposes residual multi-branch correlations. Independent finite-size graph-ensemble scans and a local cavity expansion identify a continuous high-seed structural extinction with $r_g\propto r_{0,c}-r_0$ in the baseline regime. We further compare synchronous dynamics with Gillespie asynchronous dynamics and vary the node--hyperedge rate ratio. Relative response times transfer dynamical missed-window events between the hyperedge and node levels, reshaping the intermediate-seed cascade. By contrast, the extreme high-seed tail is controlled by initial hyperedge oversaturation, which is irreversible and independent of the update ordering. The over-seeding paradox thus contains a protocol-independent structural core together with rate-dependent kinetic corrections. - 8 October 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 213
Geometric contagion on random hypergraphs with ordered interactions
- 8 October 2026
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 213
Geometric contagion on random hypergraphs with ordered interactions
- Open Access
- 7 October 2026
- Published by Elsevier in SSRN Electronic Journal
An attainable bound on selection reversals in ordered evolutionary environments
How many times can selection reverse as environmental bias varies, and what limits this number? We address this question for an ordered environmental ladder in which mutual cooperation and mutual defection move an edge in opposite directions, while mixed interactions generate a reflected nearest-neighbour walk. Under global environmental updating and fast conditional relaxation, the mixed-edge stationary distribution is geometric in the recovery-to-degradation bias $\lambda=p/q$. Weak selection on a large regular graph then reduces the fixation comparison to a rational response $\Phi(\lambda)$ determined by the exploitation landscape. We establish an attainable bound on the number of selection reversals. For an $n$-rung uniform-bias ladder, the leading fixation boundary permits at most $n-1$ reversals, with a sharper landscape-specific limit given by coefficient sign changes. A four-rung construction attains all three reversals while satisfying the specified game-class constraints, whereas an early exploitation spike produces a bounded defection-favoured interval. We further characterize fold and endpoint changes of these boundaries and show that the three-reversal construction persists under sufficiently small payoff perturbations. Finite-population simulations support the predicted two- and three-reversal sign sequences. These results provide a basis for excluding and constructing selection-reversal sequences within the global-updating, weak-selection regime.- 7 October 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAn attainable bound on selection reversals in ordered evolutionary environments
How many times can selection reverse as environmental bias varies, and what limits this number? We address this question for an ordered environmental ladder in which mutual cooperation and mutual defection move an edge in opposite directions, while mixed interactions generate a reflected nearest-neighbour walk. Under global environmental updating and fast conditional relaxation, the mixed-edge stationary distribution is geometric in the recovery-to-degradation bias $\lambda=p/q$. Weak selection on a large regular graph then reduces the fixation comparison to a rational response $\Phi(\lambda)$ determined by the exploitation landscape. We establish an attainable bound on the number of selection reversals. For an $n$-rung uniform-bias ladder, the leading fixation boundary permits at most $n-1$ reversals, with a sharper landscape-specific limit given by coefficient sign changes. A four-rung construction attains all three reversals while satisfying the specified game-class constraints, whereas an early exploitation spike produces a bounded defection-favoured interval. We further characterize fold and endpoint changes of these boundaries and show that the three-reversal construction persists under sufficiently small payoff perturbations. Finite-population simulations support the predicted two- and three-reversal sign sequences. These results provide a basis for excluding and constructing selection-reversal sequences within the global-updating, weak-selection regime. - Open Access
- 17 September 2026
- Published by Elsevier in SSRN Electronic Journal
Coupled information–epidemic dynamics in community-structured networks with individual mobility
Empirical studies demonstrate that epidemic-related negative information dissemination influences individual behaviors and reshapes disease transmission dynamics through feedback mechanisms. However, existing information–epidemic coupled models often neglect higher-order information interactions, spatial heterogeneity, and population mobility. To address these limitations, this study proposes a two-layer coupled spreading model that integrates higher-order interactions in the information layer with community-structured mobility mechanisms in the epidemic layer. The model further considers the feedback effect of regional information states on individual recovery processes, and the spreading threshold of the coupled system is derived using the microscopic Markov chain approach. Theoretical analysis and Monte Carlo simulations reveal that pairwise transmission determines the emergence of negative information spreading, while higher-order interactions promote its subsequent diffusion. Moreover, information dynamics exhibit stronger regulatory effects on epidemic transmission under moderate infection intensity, and mobility may produce a dilution effect in strongly community-structured networks with limited inter-community connections. These findings provide insights into the feedback mechanisms between negative information diffusion and epidemic transmission, offering theoretical support for adaptive information management and epidemic control.
- 17 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessCoupled information–epidemic dynamics in community-structured networks with individual mobility
Empirical studies demonstrate that epidemic-related negative information dissemination influences individual behaviors and reshapes disease transmission dynamics through feedback mechanisms. However, existing information–epidemic coupled models often neglect higher-order information interactions, spatial heterogeneity, and population mobility. To address these limitations, this study proposes a two-layer coupled spreading model that integrates higher-order interactions in the information layer with community-structured mobility mechanisms in the epidemic layer. The model further considers the feedback effect of regional information states on individual recovery processes, and the spreading threshold of the coupled system is derived using the microscopic Markov chain approach. Theoretical analysis and Monte Carlo simulations reveal that pairwise transmission determines the emergence of negative information spreading, while higher-order interactions promote its subsequent diffusion. Moreover, information dynamics exhibit stronger regulatory effects on epidemic transmission under moderate infection intensity, and mobility may produce a dilution effect in strongly community-structured networks with limited inter-community connections. These findings provide insights into the feedback mechanisms between negative information diffusion and epidemic transmission, offering theoretical support for adaptive information management and epidemic control.
- Open Access
- 7 September 2026
- Published by Elsevier in SSRN Electronic Journal
Variance-filtered nonlinear dynamics in stochastic multiplayer evolutionary games
Demographic fluctuations can alter nonlinear selection even when their instantaneous mean is zero. We develop a stochastic framework for arbitrary multistrategy, multiplayer evolutionary games in populations with regulated abundance. Starting from It\^{o} abundance diffusions, we derive a generalized replicator equation with two independent variance filters: one acts on intrinsic reproductive differences and the other on payoff differences. The neutral surfaces of these filters partition parameter space into four dynamical regimes, while their ratio controls equilibrium geometry and the sign of the payoff filter controls flow orientation. Applications to peer punishment, reward, and pool punishment reveal three qualitatively different phase-space organizations: saddle-mediated basin separation, a conservative center surrounded by closed orbits, and a nonisolated equilibrium segment with transverse stability reversal. A boundary-diffusion analysis further shows that local stability does not guarantee establishment from rarity, and an ecological slow-manifold calculation shows that the selected strategy need not maximize equilibrium abundance. These results identify variance-induced critical surfaces that can move equilibria, reverse attractors and repellers, and decouple deterministic stability, stochastic fixation, and ecological performance. Reproductive variance is therefore an organizing parameter of nonlinear evolutionary dynamics rather than a scalar correction to payoff selection.
- 7 September 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessVariance-filtered nonlinear dynamics in stochastic multiplayer evolutionary games
Demographic fluctuations can alter nonlinear selection even when their instantaneous mean is zero. We develop a stochastic framework for arbitrary multistrategy, multiplayer evolutionary games in populations with regulated abundance. Starting from It\^{o} abundance diffusions, we derive a generalized replicator equation with two independent variance filters: one acts on intrinsic reproductive differences and the other on payoff differences. The neutral surfaces of these filters partition parameter space into four dynamical regimes, while their ratio controls equilibrium geometry and the sign of the payoff filter controls flow orientation. Applications to peer punishment, reward, and pool punishment reveal three qualitatively different phase-space organizations: saddle-mediated basin separation, a conservative center surrounded by closed orbits, and a nonisolated equilibrium segment with transverse stability reversal. A boundary-diffusion analysis further shows that local stability does not guarantee establishment from rarity, and an ecological slow-manifold calculation shows that the selected strategy need not maximize equilibrium abundance. These results identify variance-induced critical surfaces that can move equilibria, reverse attractors and repellers, and decouple deterministic stability, stochastic fixation, and ecological performance. Reproductive variance is therefore an organizing parameter of nonlinear evolutionary dynamics rather than a scalar correction to payoff selection.