Browsing by Author "Alencar, David Santana Marques"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Droplet finite-size scaling of the contact process on scale-free networks revisited.(2023) Alencar, David Santana Marques; Alves, Tayroni Francisco de Alencar; Ferreira, Ronan Silva; Alves, Gladstone de Alencar; Macedo Filho, Antonio de; Lima, Francisco Welington de SousaWe present an alternative finite-size scaling (FSS) of the contact process on scale-free networks compatible with mean-field scaling and test it with extensive Monte Carlo simulations. In our FSS theory, the dependence on the system size enters the external field, which represents spontaneous contamination in the context of an epidemic model. In addition, dependence on the finite size in the scale-free networks also enters the network cutoff. We show that our theory reproduces the results of other mean-field theories on finite lattices already reported in the literature. To simulate the dynamics, we impose quasi-stationary states by reactivation. We insert spontaneously infected individuals, equivalent to a droplet perturbation to the system scaling as N⁻¹. The system presents an absorbing phase transition where the critical behavior obeys the mean-field exponents, as we show theoretically and by simulations. However, the quasi-stationary state gives finite-size logarithmic corrections, predicted by our FSS theory, and reproduces equivalent results in the literature in the thermodynamic limit. We also report the critical threshold estimates of basic reproduction number R₀ λc of the model as a linear function of the network connectivity inverse 1/z, and the extrapolation of the critical threshold function for z→∞ yields the basic reproduction number R₀ = 1 of the complete graph, as expected. Decreasing the network connectivity increases the critical R₀ for this model.Item Epidemic outbreaks on random Voronoi–Delaunay triangulations.(2020) Alencar, David Santana Marques; Alves, Tayroni Francisco de Alencar; Alves, Gladstone de Alencar; Macedo Filho, Antonio de; Ferreira, Ronan SilvaWe study epidemic outbreaks on random Delaunay triangulations by applying the Asynchronous SIR (susceptible–infected–removed) dynamics coupled to two-dimensional Voronoi–Delaunay triangulations. In order to investigate the critical behavior of the model, we obtain the cluster size distribution by using Newman–Ziff algorithm, allowing to simulate random inhomogeneous lattices and measure any desired observable related to percolation. We numerically calculate the order parameter, defined as the wrapping cluster density, the mean cluster size, and Binder cumulant ratio defined for percolation in order to estimate the epidemic threshold. Our findings suggest that the system falls into two-dimensional dynamic percolation universality class and the quenched random disorder is irrelevant, in agreement with results for classical percolation.Item Opinion dynamics systems on barabási-albert networks : biswas-chatterjee-sen model.(2023) Alencar, David Santana Marques; Alves, Tayroni Francisco de Alencar; Alves, Gladstone de Alencar; Macedo Filho, Antonio de; Ferreira, Ronan Silva; Lima, Francisco Welington de Sousa; Plascak, João AntônioA discrete version of opinion dynamics systems, based on the Biswas–Chatterjee–Sen (BChS) model, has been studied on Barabási–Albert networks (BANs). In this model, depending on a pre-defined noise parameter, the mutual affinities can assign either positive or negative values. By employing extensive computer simulations with Monte Carlo algorithms, allied with finite-size scaling hypothesis, second-order phase transitions have been observed. The corresponding critical noise and the usual ratios of the critical exponents have been computed, in the thermodynamic limit, as a function of the average connectivity. The effective dimension of the system, defined through a hyper-scaling relation, is close to one, and it turns out to be connectivity-independent. The results also indicate that the discrete BChS model has a similar behavior on directed Barabási–Albert networks (DBANs), as well as on Erdös–Rènyi random graphs (ERRGs) and directed ERRGs random graphs (DERRGs). However, unlike the model on ERRGs and DERRGs, which has the same critical behavior for the average connectivity going to infinity, the model on BANs is in a different universality class to its DBANs counterpart in the whole range of the studied connectivities.