Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userObservation time dependent mean first passage time of diffusion and sub-diffusion processes
111
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The mean first passage time, one of the important characteristics for a stochastic process, is often calculated assuming the observation time is infinite. However, in practice, the observation time, T, is always finite and the mean first passage time (MFPT) is dependent on the length of the observation time. In this work, we investigate the observation time dependence of the MFPT of a particle freely moving in the interval [-L,L] for a simple diffusion model and four different models of subdiffusion, the fractional diffusion equation (FDE), scaled Brown motion (SBM), fractional Brownian motion (FBM), and stationary Markovian approximation model of SBM and FBM. We find that the MFPT is linearly dependent on T in the small T limit for all the models investigated, while the large-T behavior of the MFPT is sensitive to stochastic properties of the transport model in question. We also discuss the relationship between the observation time, T, dependence and the travel-length, L, dependence of the MFPT. Our results suggest the observation time dependency of the MFPT can serve as an experimental measure that is far more sensitive to stochastic properties of transport processes than the mean square displacement.
rate research
Read More
We present the analysis of the first passage time problem on a finite interval for the generalized Wiener process that is driven by Levy stable noises. The complexity of the first passage time statistics (mean first passage time, cumulative first passage time distribution) is elucidated together with a discussion of the proper setup of corresponding boundary conditions that correctly yield the statistics of first passages for these non-Gaussian noises. The validity of the method is tested numerically and compared against analytical formulae when the stability index $alpha$ approaches 2, recovering in this limit the standard results for the Fokker-Planck dynamics driven by Gaussian white noise.
We perform an in-depth study for mean first-passage time (MFPT)---a primary quantity for random walks with numerous applications---of maximal-entropy random walks (MERW) performed in complex networks. For MERW in a general network, we derive an explicit expression of MFPT in terms of the eigenvalues and eigenvectors of the adjacency matrix associated with the network. For MERW in uncorrelated networks, we also provide a theoretical formula of MFPT at the mean-field level, based on which we further evaluate the dominant scalings of MFPT to different targets for MERW in uncorrelated scale-free networks, and compare the results with those corresponding to traditional unbiased random walks (TURW). We show that the MFPT to a hub node is much lower for MERW than for TURW. However, when the destination is a node with the least degree or a uniformly chosen node, the MFPT is higher for MERW than for TURW. Since MFPT to a uniformly chosen node measures real efficiency of search in networks, our work provides insight into general searching process in complex networks.
The chaotic diffusion for particles moving in a time dependent potential well is described by using two different procedures: (i) via direct evolution of the mapping describing the dynamics and ; (ii) by the solution of the diffusion equation. The dynamic of the diffusing particles is made by the use of a two dimensional, nonlinear area preserving map for the variables energy and time. The phase space of the system is mixed containing both chaos, periodic regions and invariant spanning curves limiting the diffusion of the chaotic particles. The chaotic evolution for an ensemble of particles is treated as random particles motion and hence described by the diffusion equation. The boundary conditions impose that the particles can not cross the invariant spanning curves, serving as upper boundary for the diffusion, nor the lowest energy domain that is the energy the particles escape from the time moving potential well. The diffusion coefficient is determined via the equation of the mapping while the analytical solution of the diffusion equation gives the probability to find a given particle with a certain energy at a specific time. The momenta of the probability describe qualitatively the behavior of the average energy obtained by numerical simulation, which is investigated either as a function of the time as well as some of the control parameters of the problem.
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media, especially complex real networks, is a theoretical challenge. In this paper, we investigate a simple random walk on the the pseudofractal scale-free web (PSFW) with a perfect trap located at a node with the highest degree, which simultaneously exhibits the remarkable scale-free and small-world properties observed in real networks. We obtain the exact solution for the MFPT that is calculated through the recurrence relations derived from the structure of PSFW. The rigorous solution exhibits that the MFPT approximately increases as a power-law function of the number of nodes, with the exponent less than 1. We confirm the closed-form solution by direct numerical calculations. We show that the structure of PSFW can improve the efficiency of transport by diffusion, compared with some other structure, such as regular lattices, Sierpinski fractals, and T-graph. The analytical method can be applied to other deterministic networks, making the accurate computation of MFPT possible.
We study the properties of the ``Rigid Laplacian operator, that is we consider solutions of the Laplacian equation in the presence of fixed truncation errors. The dynamics of convergence to the correct analytical solution displays the presence of a metastable set of numerical solutions, whose presence can be related to granularity. We provide some scaling analysis in order to determine the value of the exponents characterizing the process. We believe that this prototype model is also suitable to provide an explanation of the widespread presence of power-law in social and economic system where information and decision diffuse, with errors and delay from agent to agent.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
