RESUMO
In the last years, a few experiments in the fields of biological and soft matter physics in colloidal suspensions have reported "normal diffusion" with a Laplacian probability distribution in the particle's displacements (i.e., Brownian yet non-Gaussian diffusion). To model this behavior, different stochastic and microscopic models have been proposed, with the former introducing new random elements that incorporate our lack of information about the media and the latter describing a limited number of interesting physical scenarios. This incentivizes the search of a more thorough understanding of how the media interacts with itself and with the particle being diffused in Brownian yet non-Gaussian diffusion. For this reason, a comprehensive mathematical model to explain Brownian yet non-Gaussian diffusion that includes weak molecular interactions is proposed in this paper. Based on the theory of interfaces by De Gennes and Langevin dynamics, it is shown that long-range interactions in a weakly interacting fluid at shorter time scales leads to a Laplacian probability distribution in the radial particle's displacements. Further, it is shown that a phase separation can explain a high diffusivity and causes this Laplacian distribution to evolve towards a Gaussian via a transition probability in the interval of time as it was observed in experiments. To verify these model predictions, the experimental data of the Brownian motion of colloidal beads on phospholipid bilayer by Wang et al. are used and compared with the results of the theory. This comparison suggests that the proposed model is able to explain qualitatively and quantitatively the Brownian yet non-Gaussian diffusion.
RESUMO
Based on the behavior of the quantum particles, it is possible to formulate mathematical expressions to develop metaheuristic search optimization algorithms. This paper presents three novel quantum-inspired algorithms, which scenario is a particle swarm that is excited by a Lorentz, Rosen-Morse, and Coulomb-like square root potential fields, respectively. To show the computational efficacy of the proposed optimization techniques, the paper presents a comparative study with the classical particle swarm optimization (PSO), genetic algorithm (GA), and firefly algorithm (FFA). The algorithms are used to solve 24 benchmark functions that are categorized by unimodal, multimodal, and fixed-dimension multimodal. As a finding, the algorithm inspired in the Lorentz potential field presents the most balanced computational performance in terms of exploitation (accuracy and precision), exploration (convergence speed and acceleration), and simulation time compared to the algorithms previously mentioned. A deeper analysis reveals that a strong potential field inside a well with weak asymptotic behavior leads to better exploitation and exploration attributes for unimodal, multimodal, and fixed-multimodal functions.