SweptSource October A Confront Photo of Paravascular Internal Retinal Flaws

Large-amplitude fluctuations of the solar wind magnetic field can scatter energetic ions. One of the main contributions to these fluctuations is provided by solar wind discontinuities, i.e., rapid rotations of the magnetic field. This study shows that the internal configuration of such discontinuities plays a crucial role in energetic ion scattering in pitch angles. Kinetic-scale discontinuities accomplish very fast ion pitch-angle scattering. The main mechanism of such pitch-angle scattering is the adiabatic invariant destruction due to separatrix crossings in the phase space. We demonstrate that efficiency of this scattering does not depend on the magnetic field component across the discontinuity surface, i.e., both rotational and almost tangential discontinuities scatter energetic ions with the same efficiency. We also examine how the strong scattering effect depends on the deviations of the discontinuity magnetic field from the force-free one.Imitation and aspiration update rules are frequently observed in human and animal populations. While the imitation process entails payoff comparisons with surroundings, the aspiration process refers to self-evaluation. This work explores the evolution of cooperation in dyadic games under the coexistence of these two dynamics in an infinitely large well-mixed population. Two situations have been explored (i) individuals adopt either an imitation or aspiration update rule with a certain probability, and (ii) the entire population is divided into two groups where one group only uses imitative rules and the other obeys aspiration updating alone. Both premises have been modeled by taking an infinite approximation of the finite population. In particular, the second mixing principle follows an additive property the outcome of the whole population is the weighted average of outcomes from imitators and aspiration-driven individuals. Our work progressively investigates several variants of aspiration dynamics under strong selection, encompassing symmetric, asymmetric, and adaptive aspirations, which then coalesce with imitative dynamics. We also demonstrate which of the update rules performs better, under different social dilemmas, by allowing the evolution of the preference of update rules besides strategies. Aspiration dynamics always outperform imitation dynamics in the prisoner's dilemma, however, in the chicken and stag-hunt games the predominance of either update rule depends on the level of aspirations as well as on the extent of greed and fear present in the system. Finally, we examine the coevolution of strategies, aspirations, and update rules which leads to a binary state of obeying either imitation or aspiration dynamics. In such a circumstance, when aspiration dynamics prevail over imitation dynamics, cooperators and defectors coexist to an equal extent.Many complex systems occurring in the natural or social sciences or economics are frequently described on a microscopic level, e.g., by lattice- or agent-based models. To analyze the states of such systems and their bifurcation structure on the level of macroscopic observables, one has to rely on equation-free methods like stochastic continuation. Here we investigate how to improve stochastic continuation techniques by adaptively choosing the parameters of the algorithm. This allows one to obtain bifurcation diagrams quite accurately, especially near bifurcation points. We introduce lifting techniques which generate microscopic states with a naturally grown structure, which can be crucial for a reliable evaluation of macroscopic quantities. We show how to calculate fixed points of fluctuating functions by employing suitable linear fits. This procedure offers a simple measure of the statistical error. We demonstrate these improvements by applying the approach in analyses of (i) the Ising model in two dimensions, (ii) an active Ising model, and (iii) a stochastic Swift-Hohenberg model. We conclude by discussing the abilities and remaining problems of the technique.We study the finite-time erasure of a one-bit memory consisting of a one-dimensional double-well potential, with each well encoding a memory macrostate. We focus on setups that provide full control over the form of the potential-energy landscape and derive protocols that minimize the average work needed to erase the bit over a fixed amount of time. We allow for cases where only some of the information encoded in the bit is erased. For systems required to end up in a local-equilibrium state, we calculate the minimum amount of work needed to erase a bit explicitly, in terms of the equilibrium Boltzmann distribution corresponding to the system's initial potential. The minimum work is inversely proportional to the duration of the protocol. find more The erasure cost may be further reduced by relaxing the requirement for a local-equilibrium final state and allowing for any final distribution compatible with constraints on the probability to be in each memory macrostate. We also derive upper and lower bounds on the erasure cost.We investigate the heterogeneity of outcomes of repeated instances of percolation experiments in complex networks using a message-passing approach to evaluate heterogeneous, node-dependent probabilities of belonging to the giant or percolating cluster, i.e., the set of mutually connected nodes whose size scales linearly with the size of the system. We evaluate these both for large finite single instances and for synthetic networks in the configuration model class in the thermodynamic limit. For the latter, we consider both Erdős-Rényi and scale-free networks as examples of networks with narrow and broad degree distributions, respectively. For real-world networks we use an undirected version of a Gnutella peer-to-peer file-sharing network with N=62568 nodes as an example. We derive the theory for multiple instances of both uncorrelated and correlated percolation processes. For the uncorrelated case, we also obtain a closed-form approximation for the large mean degree limit of Erdős-Rényi networks.The structure of an evolving network contains information about its past. Extracting this information efficiently, however, is, in general, a difficult challenge. We formulate a fast and efficient method to estimate the most likely history of growing trees, based on exact results on root finding. We show that our linear-time algorithm produces the exact stepwise most probable history in a broad class of tree growth models. Our formulation is able to treat very large trees and therefore allows us to make reliable numerical observations regarding the possibility of root inference and history reconstruction in growing trees. We obtain the general formula 〈lnN〉≅NlnN-cN for the size dependence of the mean logarithmic number of possible histories of a given tree, a quantity that largely determines the reconstructability of tree histories. We also reveal an uncertainty principle a relationship between the inferability of the root and that of the complete history, indicating that there is a tradeoff between the two tasks; the root and the complete history cannot both be inferred with high accuracy at the same time.