Silvio C. Ferreira
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Silvio C. Ferreira has a total of 78 co-authors. Here are the top co-authors by number of shared publications:
- Sidiney Geraldo Alves
Departamento de Estatística, Física e Matemática, Universidade Federal de São João Del-Rei, 36420-000, Ouro Branco, MG, Brazil
23 shared publications - Wesley Cota
Departamento de Física, Universidade Federal de Viçosa, Viçosa, Brazil
18 shared publications - Guilherme S. Costa
ICTP South American Institute for Fundamental Research and Instituto de Fíica Teórica, São Paulo State University, São Paulo, State of São Paulo
12 shared publications - Tiago J. Oliveira
Universidade Federal de Viçosa
11 shared publications - Marcelo Martins de Oliveira
Departamento de Estatística Física e Matemática Universidade Federal de São João Del-Rei 36490-972 Ouro Branco MG Brazil
10 shared publications - Diogo H. Silva
Universidade de São Paulo
8 shared publications
Latest Publications
- 30 September 2026
- Published by IOP Publishing in Europhysics Letters
- Vol. 156 (4) , 41001
Epidemic spreading on multigraphs
Multigraphs are graphs in which multiple links between pairs of nodes are allowed, whereas they are forbidden in simple graphs, the latter being widely used in network science. Simple graphs generated by the configuration model have served as a benchmark for validating theoretical approaches to dynamical processes on networks. However, generating large scale-free networks with degree exponent γ < 3 introduces uncontrolled disassortative correlations and severe computational limitations due to the prohibition of reconnecting hubs. These constraints do not exist in multigraphs. We investigate how multiple connections affect epidemic spreading by comparing several epidemic models exhibiting an active steady state on simple graphs and multigraphs sharing the same degree sequence and natural upper cutoff. By analyzing epidemic thresholds, finite-size scaling, and localization, we show that differences between simple graphs and multigraphs emerge only when epidemic activity can persist on isolated hubs (star subgraphs) for times exponentially long in the hub degree. Our results remove a methodological barrier to the study of dynamical processes on large scale-free networks.
- 30 September 2026
- Published by IOP Publishing in Europhysics Letters
- Vol. 156 (4) , 41001
Epidemic spreading on multigraphs
Multigraphs are graphs in which multiple links between pairs of nodes are allowed, whereas they are forbidden in simple graphs, the latter being widely used in network science. Simple graphs generated by the configuration model have served as a benchmark for validating theoretical approaches to dynamical processes on networks. However, generating large scale-free networks with degree exponent γ < 3 introduces uncontrolled disassortative correlations and severe computational limitations due to the prohibition of reconnecting hubs. These constraints do not exist in multigraphs. We investigate how multiple connections affect epidemic spreading by comparing several epidemic models exhibiting an active steady state on simple graphs and multigraphs sharing the same degree sequence and natural upper cutoff. By analyzing epidemic thresholds, finite-size scaling, and localization, we show that differences between simple graphs and multigraphs emerge only when epidemic activity can persist on isolated hubs (star subgraphs) for times exponentially long in the hub degree. Our results remove a methodological barrier to the study of dynamical processes on large scale-free networks.
- Open Access
- 15 July 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 8665
Efficient Gillespie algorithms for spreading phenomena in large and heterogeneous higher-order networks
Higher-order interactions, where groups of nodes interact collectively rather than pairwisely, are central to many complex systems, from neural and ecological networks to social contagion. However, simulating dynamical processes on such higher-order structures remains computationally challenging due to the combinatorial growth of possible interactions. Here, we develop efficient and statistically exact Gillespie algorithms for Markovian spreading dynamics on large and heterogeneous hypergraphs. By incorporating phantom processes − events that advance time without altering the system’s state − , we drastically reduce the computational complexity of standard algorithms (\({{\mathcal{O}}}({N}^{2})\)), achieving up to linear scaling with system size. Relying on the susceptible-infected-susceptible model with critical mass thresholds as a benchmark, we show that the optimized algorithms outperform standard approaches by several orders of magnitude, enabling simulations of networks with millions of nodes and broad heterogeneity in both degree and interaction order. Efficient sampling methods, needed to overcome the bottlenecks imposed by either a high maximum order or number of interactions, and other dynamical processes on higher-order networks are tackled. These results establish a general framework for scalable, continuous-time simulations of higher-order contagion and related dynamical processes.- 15 July 2026
- Published by Springer Nature in Nature Communications
- Vol. 17 (1) , 8665
Open AccessEfficient Gillespie algorithms for spreading phenomena in large and heterogeneous higher-order networks
Higher-order interactions, where groups of nodes interact collectively rather than pairwisely, are central to many complex systems, from neural and ecological networks to social contagion. However, simulating dynamical processes on such higher-order structures remains computationally challenging due to the combinatorial growth of possible interactions. Here, we develop efficient and statistically exact Gillespie algorithms for Markovian spreading dynamics on large and heterogeneous hypergraphs. By incorporating phantom processes − events that advance time without altering the system’s state − , we drastically reduce the computational complexity of standard algorithms (\({{\mathcal{O}}}({N}^{2})\)), achieving up to linear scaling with system size. Relying on the susceptible-infected-susceptible model with critical mass thresholds as a benchmark, we show that the optimized algorithms outperform standard approaches by several orders of magnitude, enabling simulations of networks with millions of nodes and broad heterogeneity in both degree and interaction order. Efficient sampling methods, needed to overcome the bottlenecks imposed by either a high maximum order or number of interactions, and other dynamical processes on higher-order networks are tackled. These results establish a general framework for scalable, continuous-time simulations of higher-order contagion and related dynamical processes. - 17 April 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (4) , 044308
Impacts of bridging nodes on the epidemic activation mechanisms
Bridging nodes, which connect critical components of a network, play an important role in maintaining structural integrity and facilitating communication within the network, representing indirect yet relevant connections. Epidemic triggering mechanisms in networks often involve long-range mutual activation of hubs, mediated by paths composed of low-degree nodes. While low-degree nodes are abundant in networks, their role in bridging central nodes in epidemic activation mechanisms has not been thoroughly analyzed. Starting with a backbone network with a power-law degree distribution, we investigate the role of adding degree-2 bridging nodes that are preferentially attached to hubs. Our findings reveal that bridging nodes can mediate an indirect feedback interaction between hubs that modifies the epidemic localization and activation mechanisms of the epidemic processes with recurrent infections. In particular, the collective activation observed in the presence of waning immunity, which produces a finite epidemic threshold in power-law networks with degree exponent γ>3, is altered to a localized activation with a vanishing threshold. Our numerical results are analytically supported by the nonbacktracking matrix properties that emerge in the recurrent dynamical message-passing theory.
- 17 April 2026
- Published by American Physical Society (APS) in Physical Review E
- Vol. 113 (4) , 044308
Impacts of bridging nodes on the epidemic activation mechanisms
Bridging nodes, which connect critical components of a network, play an important role in maintaining structural integrity and facilitating communication within the network, representing indirect yet relevant connections. Epidemic triggering mechanisms in networks often involve long-range mutual activation of hubs, mediated by paths composed of low-degree nodes. While low-degree nodes are abundant in networks, their role in bridging central nodes in epidemic activation mechanisms has not been thoroughly analyzed. Starting with a backbone network with a power-law degree distribution, we investigate the role of adding degree-2 bridging nodes that are preferentially attached to hubs. Our findings reveal that bridging nodes can mediate an indirect feedback interaction between hubs that modifies the epidemic localization and activation mechanisms of the epidemic processes with recurrent infections. In particular, the collective activation observed in the presence of waning immunity, which produces a finite epidemic threshold in power-law networks with degree exponent γ>3, is altered to a localized activation with a vanishing threshold. Our numerical results are analytically supported by the nonbacktracking matrix properties that emerge in the recurrent dynamical message-passing theory.
- Open Access
- 10 December 2025
- Published by Springer Nature in Research Square
Efficient Gillespie algorithms for spreading phenomena in large and heterogeneous higher-order networks
Higher-order interactions, where groups of nodes interact collectively rather than pairwise, are central to many complex systems, from neural and ecological networks to social contagion. However, simulating dynamical processes on such higher-order structures remains computationally challenging due to the combinatorial growth of possible interactions. Here, we develop efficient and statistically exact Gillespie algorithms for Markovian spreading dynamics on large and heterogeneous hypergraphs. By incorporating phantom processes $-$events that advance time without altering the system’s state$-$, we drastically reduce the computational complexity of standard algorithms (O(N 2 )), achieving near-linear scaling with system size (O(N)). Using the susceptible–infected–susceptible model with critical mass thresholds as a benchmark, we show that the optimized algorithms outperform standard approaches by several orders of magnitude, enabling simulations of networks with millions of nodes and broad heterogeneity in both degree and interaction order. These results establish a general framework for scalable, continuous-time simulations of higher-order contagion and related dynamical processes.- 10 December 2025
- Published by Springer Nature in Research Square
Open AccessEfficient Gillespie algorithms for spreading phenomena in large and heterogeneous higher-order networks
Higher-order interactions, where groups of nodes interact collectively rather than pairwise, are central to many complex systems, from neural and ecological networks to social contagion. However, simulating dynamical processes on such higher-order structures remains computationally challenging due to the combinatorial growth of possible interactions. Here, we develop efficient and statistically exact Gillespie algorithms for Markovian spreading dynamics on large and heterogeneous hypergraphs. By incorporating phantom processes $-$events that advance time without altering the system’s state$-$, we drastically reduce the computational complexity of standard algorithms (O(N 2 )), achieving near-linear scaling with system size (O(N)). Using the susceptible–infected–susceptible model with critical mass thresholds as a benchmark, we show that the optimized algorithms outperform standard approaches by several orders of magnitude, enabling simulations of networks with millions of nodes and broad heterogeneity in both degree and interaction order. These results establish a general framework for scalable, continuous-time simulations of higher-order contagion and related dynamical processes. - Open Access
- 1 September 2025
- Published by KEAI Publishing in Infectious Disease Modelling
- Vol. 10 (3) , 960-978
Impact of information dissemination and behavioural responses on epidemic dynamics: A multi-layer network analysis
Network models adeptly capture heterogeneities in individual interactions, making them well-suited for describing a wide range of real-world and virtual connections, including information diffusion, behavioural tendencies, and disease dynamic fluctuations. However, there is a notable methodological gap in existing studies examining the interplay between physical and virtual interactions and the impact of information dissemination and behavioural responses on disease propagation. We constructed a three-layer (information, cognition, and epidemic) network model to investigate the adoption of protective behaviours, such as wearing masks or practising social distancing, influenced by the diffusion and correction of misinformation. We examined five key events influencing the rate of information spread: (i) rumour transmission, (ii) information suppression, (iii) renewed interest in spreading misinformation, (iv) correction of misinformation, and (v) relapse to a stifler state after correction. We found that adopting information-based protection behaviours is more effective in mitigating disease spread than protection adoption induced by neighbourhood interactions. Specifically, our results show that warning and educating individuals to counter misinformation within the information network is a more effective strategy for curbing disease spread than suspending gossip spreaders from the network. Our study has practical implications for developing strategies to mitigate the impact of misinformation and enhance protective behavioural responses during disease outbreaks.
- 1 September 2025
- Published by KEAI Publishing in Infectious Disease Modelling
- Vol. 10 (3) , 960-978
Open AccessImpact of information dissemination and behavioural responses on epidemic dynamics: A multi-layer network analysis
Network models adeptly capture heterogeneities in individual interactions, making them well-suited for describing a wide range of real-world and virtual connections, including information diffusion, behavioural tendencies, and disease dynamic fluctuations. However, there is a notable methodological gap in existing studies examining the interplay between physical and virtual interactions and the impact of information dissemination and behavioural responses on disease propagation. We constructed a three-layer (information, cognition, and epidemic) network model to investigate the adoption of protective behaviours, such as wearing masks or practising social distancing, influenced by the diffusion and correction of misinformation. We examined five key events influencing the rate of information spread: (i) rumour transmission, (ii) information suppression, (iii) renewed interest in spreading misinformation, (iv) correction of misinformation, and (v) relapse to a stifler state after correction. We found that adopting information-based protection behaviours is more effective in mitigating disease spread than protection adoption induced by neighbourhood interactions. Specifically, our results show that warning and educating individuals to counter misinformation within the information network is a more effective strategy for curbing disease spread than suspending gossip spreaders from the network. Our study has practical implications for developing strategies to mitigate the impact of misinformation and enhance protective behavioural responses during disease outbreaks.
- 2 June 2025
- Published by Springer Nature
- p. 259-273
Examining Heterogeneity in Information Diffusion and Its Impact on Disease Spread in a Multilayer Network
- 2 June 2025
- Published by Springer Nature
- p. 259-273
Examining Heterogeneity in Information Diffusion and Its Impact on Disease Spread in a Multilayer Network
- 8 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 044302
Strong localization blurs the criticality of time series for spreading phenomena on networks
We analyze the critical time series of the order parameter generated with active to inactive phase transitions of spreading dynamics running on the top of heterogeneous networks. Different activation mechanisms that govern the dynamics near the critical point were investigated. The time series were analyzed using the visibility graph (VG) method where a disassortative degree correlation of the VG is a signature of criticality. In contrast, assortative correlation is associated with off-critical dynamics. The signature of criticality given by the VG is confirmed for collective activation phenomena, as in the case of homogeneous networks. Similarly, for a localized activation driven by a densely connected set of hubs, identified by a maximum k-core decomposition, critical times series were also successfully identified by the VG method. However, in the case of activation driven by sparsely distributed hubs, the time series criticality is blurred, being observable only for very large systems. In the case of strong structural localization induced by the presence of rare regions, an assortative VG degree correlation, typical of off-critical series, is observed. We conclude that while macroscopic times series remain good proxies for the analysis of criticality for collective or maximum k-core activation, systems under spatial localization can postpone the signatures of or, in case of extreme localization, lead to false negatives for criticality of the time series.
- 8 April 2025
- Published by American Physical Society (APS) in Physical Review E
- Vol. 111 (4) , 044302
Strong localization blurs the criticality of time series for spreading phenomena on networks
We analyze the critical time series of the order parameter generated with active to inactive phase transitions of spreading dynamics running on the top of heterogeneous networks. Different activation mechanisms that govern the dynamics near the critical point were investigated. The time series were analyzed using the visibility graph (VG) method where a disassortative degree correlation of the VG is a signature of criticality. In contrast, assortative correlation is associated with off-critical dynamics. The signature of criticality given by the VG is confirmed for collective activation phenomena, as in the case of homogeneous networks. Similarly, for a localized activation driven by a densely connected set of hubs, identified by a maximum k-core decomposition, critical times series were also successfully identified by the VG method. However, in the case of activation driven by sparsely distributed hubs, the time series criticality is blurred, being observable only for very large systems. In the case of strong structural localization induced by the presence of rare regions, an assortative VG degree correlation, typical of off-critical series, is observed. We conclude that while macroscopic times series remain good proxies for the analysis of criticality for collective or maximum k-core activation, systems under spatial localization can postpone the signatures of or, in case of extreme localization, lead to false negatives for criticality of the time series.
- Open Access
- 1 January 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (1) , 013009
Consequences of non-Markovian healing processes on epidemic models with recurrent infections on networks
Infectious diseases are marked by recovering time distributions which can be far from the exponential one associated with Markovian/Poisson processes, broadly applied in epidemic models. In the present work, we tackled this problem by investigating a susceptible-infected-recovered-susceptible model on networks with η independent infectious compartments (SI η RS), each one with a Markovian dynamics, that leads to a Gamma-distributed recovering time. We analytically develop a theory for the epidemic lifespan on star graphs with a center and K leaves, which mimic hubs on networks, showing that the epidemic lifespan scales with a non-universal power-law. Compared with standard susceptible-infected-recovered-susceptible dynamics, the epidemic lifespan on star graphs is severely reduced as the number of stages increases. In particular, the case η → ∞ leads to a finite lifespan. Numerical simulations support the approximated analytical calculations. We investigated the SI η RS dynamics on random power-law networks. When the epidemic processes are ruled by a maximum k-core activation, either the epidemic threshold or the epidemic localization pattern are unaltered. When hub mutual activation is at work, the localization is reduced but not sufficiently to alter the threshold scaling with the network size. Therefore, the activation mechanisms remain the same as in the case of Markovian healing.
- 1 January 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (1) , 013009
Open AccessConsequences of non-Markovian healing processes on epidemic models with recurrent infections on networks
Infectious diseases are marked by recovering time distributions which can be far from the exponential one associated with Markovian/Poisson processes, broadly applied in epidemic models. In the present work, we tackled this problem by investigating a susceptible-infected-recovered-susceptible model on networks with η independent infectious compartments (SI η RS), each one with a Markovian dynamics, that leads to a Gamma-distributed recovering time. We analytically develop a theory for the epidemic lifespan on star graphs with a center and K leaves, which mimic hubs on networks, showing that the epidemic lifespan scales with a non-universal power-law. Compared with standard susceptible-infected-recovered-susceptible dynamics, the epidemic lifespan on star graphs is severely reduced as the number of stages increases. In particular, the case η → ∞ leads to a finite lifespan. Numerical simulations support the approximated analytical calculations. We investigated the SI η RS dynamics on random power-law networks. When the epidemic processes are ruled by a maximum k-core activation, either the epidemic threshold or the epidemic localization pattern are unaltered. When hub mutual activation is at work, the localization is reduced but not sufficiently to alter the threshold scaling with the network size. Therefore, the activation mechanisms remain the same as in the case of Markovian healing.
- 19 August 2024
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 652
Nonuniversal critical dynamics on planar random lattices with heterogeneous degree distributions
- 19 August 2024
- Published by Elsevier in Physica A: Statistical Mechanics and its Applications
- Vol. 652
Nonuniversal critical dynamics on planar random lattices with heterogeneous degree distributions
- 17 July 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (1) , 014302
Accuracy of discrete- and continuous-time mean-field theories for epidemic processes on complex networks
Discrete- and continuous-time approaches are frequently used to model the role of heterogeneity on dynamical interacting agents on the top of complex networks. While, on the one hand, one does not expect drastic differences between these approaches, and the choice is usually based on one's expertise or methodological convenience, on the other hand, a detailed analysis of the differences is necessary to guide the proper choice of one or another approach. We tackle this problem by investigating both discrete- and continuous-time mean-field theories for the susceptible-infected-susceptible (SIS) epidemic model on random networks with power-law degree distributions. We compare the discrete epidemic link equations (ELE) and continuous pair quenched mean-field (PQMF) theories with the corresponding stochastic simulations, both theories that reckon pairwise interactions explicitly. We show that ELE converges to the PQMF theory when the time step goes to zero. We performed an epidemic localization analysis considering the inverse participation ratio (IPR). Both theories present the same localization dependence on network degree exponent : for the epidemics are localized on the maximum -core of networks with a vanishing IPR in the infinite-size limit while, for , the localization happens on hubs that do not form a densely connected set and leads to a finite value of the IPR. However, the IPR and epidemic threshold of ELE depend on the time-step discretization such that a larger time step leads to more localized epidemics. A remarkable difference between discrete- and continuous-time approaches is revealed in the epidemic prevalence near the epidemic threshold, in which the discrete-time stochastic simulations indicate a mean-field critical exponent instead of the value obtained rigorously and verified numerically for the continuous-time SIS on the same networks.- 17 July 2024
- Published by American Physical Society (APS) in Physical Review E
- Vol. 110 (1) , 014302
Accuracy of discrete- and continuous-time mean-field theories for epidemic processes on complex networks
Discrete- and continuous-time approaches are frequently used to model the role of heterogeneity on dynamical interacting agents on the top of complex networks. While, on the one hand, one does not expect drastic differences between these approaches, and the choice is usually based on one's expertise or methodological convenience, on the other hand, a detailed analysis of the differences is necessary to guide the proper choice of one or another approach. We tackle this problem by investigating both discrete- and continuous-time mean-field theories for the susceptible-infected-susceptible (SIS) epidemic model on random networks with power-law degree distributions. We compare the discrete epidemic link equations (ELE) and continuous pair quenched mean-field (PQMF) theories with the corresponding stochastic simulations, both theories that reckon pairwise interactions explicitly. We show that ELE converges to the PQMF theory when the time step goes to zero. We performed an epidemic localization analysis considering the inverse participation ratio (IPR). Both theories present the same localization dependence on network degree exponent : for the epidemics are localized on the maximum -core of networks with a vanishing IPR in the infinite-size limit while, for , the localization happens on hubs that do not form a densely connected set and leads to a finite value of the IPR. However, the IPR and epidemic threshold of ELE depend on the time-step discretization such that a larger time step leads to more localized epidemics. A remarkable difference between discrete- and continuous-time approaches is revealed in the epidemic prevalence near the epidemic threshold, in which the discrete-time stochastic simulations indicate a mean-field critical exponent instead of the value obtained rigorously and verified numerically for the continuous-time SIS on the same networks.