Gross Oliver (fiberzone92)

Many self-propelled objects are large enough to exhibit inertial effects but still suffer from environmental fluctuations. The corresponding basic equations of motion are governed by active Langevin dynamics, which involve inertia, friction, and stochastic noise for both the translational and orientational degrees of freedom coupled via the self-propulsion along the particle orientation. In this paper, we generalize the active Langevin model to time-dependent parameters and explicitly discuss the effect of time-dependent inertia for achiral and chiral particles. Realizations of this situation are manifold, ranging from minirockets (which are self-propelled by burning their own mass), to dust particles in plasma (which lose mass by evaporating material), to walkers with expiring activity. Here we present analytical solutions for several dynamical correlation functions, such as mean-square displacement and orientational and velocity autocorrelation functions. If the parameters exhibit a slow power law in time, we obtain anomalous superdiffusion with a nontrivial dynamical exponent. Finally, we constitute the "Langevin rocket" model by including orientational fluctuations in the traditional Tsiolkovsky rocket equation. We calculate the mean reach of the Langevin rocket and discuss different mass ejection strategies to maximize it. Our results can be tested in experiments on macroscopic robotic or living particles or in self-propelled mesoscopic objects moving in media of low viscosity, such as complex plasma.Among various algorithms of multifractal analysis (MFA) for complex networks, the sandbox MFA algorithm behaves with the best computational efficiency. However, the existing sandbox algorithm is still computationally expensive for MFA of large-scale networks with tens of millions of nodes. It is also not clear whether MFA results can be improved by a largely increased size of a theoretical network. To tackle these challenges, a computationally efficient sandbox algorithm (CESA) is presented in this paper for MFA of large-scale networks. selleckchem Distinct from the existing sandbox algorithm that uses the shortest-path distance matrix to obtain the required information for MFA of networks, our CESA employs the compressed sparse row format of the adjacency matrix and the breadth-first search technique to directly search the neighbor nodes of each layer of center nodes, and then to retrieve the required information. A theoretical analysis reveals that the CESA reduces the time complexity of the existing sandbox algorithm from cubic to quadratic, and also improves the space complexity from quadratic to linear. Then the CESA is demonstrated to be effective, efficient, and feasible through the MFA results of (u,v)-flower model networks from the fifth to the 12th generations. It enables us to study the multifractality of networks of the size of about 11 million nodes with a normal desktop computer. Furthermore, we have also found that increasing the size of (u,v)-flower model network does improve the accuracy of MFA results. Finally, our CESA is applied to a few typical real-world networks of large scale.We consider the problem of the absence of backscattering in the transport of Manakov solitons on a line. The concept of transparent boundary conditions is used for modeling the reflectionless propagation of Manakov vector solitons in a one-dimensional domain. Artificial boundary conditions that ensure the absence of backscattering are derived and their numerical implementation is demonstrated.Reduction of collective dynamics of large heterogeneous populations to low-dimensional mean-field models is an important task of modern theoretical neuroscience. Such models can be derived from microscopic equations, for example with the help of Ott-Antonsen theory. An often used assumption of the Lorentzian distribution of the unit parameters makes the reduction especially efficient. However, the Lorentzian distribution is often implausi