Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe bold/timorous walker on the trek from home
325
0
0.0
(
0
)
Authors
Maurizio Serva
Ask ChatGPT about the research
No Arabic abstract
We study a one-dimensional random walk with memory. The behavior of the walker is modified with respect to the simple symmetric random walk (SSRW) only when he is at the maximum distance ever reached from his starting point (home). In this case, having the choice to move farther or to move closer, he decides with different probabilities. If the probability of a forward step is higher then the probability of a backward step, the walker is bold, otherwise he is timorous. We investigate the asymptotic properties of this bold/timorous random walk (BTRW) showing that the scaling behavior vary continuously from subdiffusive (timorous) to superdiffusive (bold). The scaling exponents are fully determined with a new mathematical approach.
rate research
Read More
Anomalous diffusion or, more generally, anomalous transport, with nonlinear dependence of the mean-squared displacement on the measurement time, is ubiquitous in nature. It has been observed in processes ranging from microscopic movement of molecules to macroscopic, large-scale paths of migrating birds. Using data from multiple empirical systems, spanning 12 orders of magnitude in length and 8 orders of magnitude in time, we employ a method to detect the individual underlying origins of anomalous diffusion and transport in the data. This method decomposes anomalous transport into three primary effects: long-range correlations (Joseph effect), fat-tailed probability density of increments (Noah effect), and non-stationarity (Moses effect). We show that such a decomposition of real-life data allows to infer nontrivial behavioral predictions, and to resolve open questions in the fields of single particle cell tracking and movement ecology.
We investigate the time evolution of the scores of the second most popular sport in world: the game of cricket. By analyzing the scores event-by-event of more than two thousand matches, we point out that the score dynamics is an anomalous diffusive process. Our analysis reveals that the variance of the process is described by a power-law dependence with a super-diffusive exponent, that the scores are statistically self-similar following a universal Gaussian distribution, and that there are long-range correlations in the score evolution. We employ a generalized Langevin equation with a power-law correlated noise that describe all the empirical findings very well. These observations suggest that competition among agents may be a mechanism leading to anomalous diffusion and long-range correlation.
Recent studies show that in interdependent networks a very small failure in one network may lead to catastrophic consequences. Above a critical fraction of interdependent nodes, even a single node failure can invoke cascading failures that may abruptly fragment the system, while below this critical dependency (CD) a failure of few nodes leads only to small damage to the system. So far, the research has been focused on interdependent random networks without space limitations. However, many real systems, such as power grids and the Internet, are not random but are spatially embedded. Here we analytically and numerically analyze the stability of systems consisting of interdependent spatially embedded networks modeled as lattice networks. Surprisingly, we find that in lattice systems, in contrast to non-embedded systems, there is no CD and textit{any} small fraction of interdependent nodes leads to an abrupt collapse. We show that this extreme vulnerability of very weakly coupled lattices is a consequence of the critical exponent describing the percolation transition of a single lattice. Our results are important for understanding the vulnerabilities and for designing robust interdependent spatial embedded networks.
We have studied the distribution of traffic flow $q$ for the Nagel-Schreckenberg model by computer simulations. We applied a large-deviation approach, which allowed us to obtain the distribution $P(q)$ over more than one hundred decades in probability, down to probabilities like $10^{-140}$. This allowed us to characterize the flow distribution over a large range of the support and identify the characteristics of rare and even very rare traffic situations. We observe a change of the distribution shape when increasing the density of cars from the free flow to the congestion phase. Furthermore, we characterize typical and rare traffic situations by measuring correlations of $q$ to other quantities like density of standing cars or number and size of traffic jams.
We investigate a stationary processs crypticity---a measure of the difference between its hidden state information and its observed information---using the causal states of computational mechanics. Here, we motivate crypticity and cryptic order as physically meaningful quantities that monitor how hidden a hidden process is. This is done by recasting previous results on the convergence of block entropy and block-state entropy in a geometric setting, one that is more intuitive and that leads to a number of new results. For example, we connect crypticity to how an observer synchronizes to a process. We show that the block-causal-state entropy is a convex function of block length. We give a complete analysis of spin chains. We present a classification scheme that surveys stationary processes in terms of their possible cryptic and Markov orders. We illustrate related entropy convergence behaviors using a new form of foliated information diagram. Finally, along the way, we provide a variety of interpretations of crypticity and cryptic order to establish their naturalness and pervasiveness. Hopefully, these will inspire new applications in spatially extended and network dynamical systems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
