scholarly journals Predicting the mean first passage time (MFPT) to reach any state for a passive dynamic walker with steady state variability

PLoS ONE ◽  
2018 ◽  
Vol 13 (11) ◽  
pp. e0207665
Author(s):  
Isuri Wijesundera ◽  
Malka N. Halgamuge ◽  
Ampalavanapillai Nirmalathas ◽  
Thrishantha Nanayakkara
Keyword(s):  
Steady State ◽  
First Passage Time ◽  
Passage Time ◽  
Mean First Passage Time ◽  
First Passage ◽  
The Mean ◽  
Passive Dynamic Walker

scholarly journals APLIKASI MODEL RANTAI MARKOV UNTUK MENGANALISIS TINGKAT KENYAMANAN DI KOTA MAJENE BERDASARKAN TEMPERATURE HUMIDITY INDEX (THI)

2021 ◽  
Vol 15 (1) ◽  
pp. 009-014
Author(s):  
Muhammad Abdy ◽  
Wahidah Sanusi ◽  
Rahmawati Rahmawati
Keyword(s):  
Steady State ◽  
Residence Time ◽  
Mean Residence Time ◽  
First Passage Time ◽  
Passage Time ◽  
Mean First Passage Time ◽  
First Passage ◽  
Temperature Humidity Index ◽  
Humidity Index ◽  
The Mean

This study applied the Markov chain model on the daily temperature and relative humidity data that was collected from the Meteorology and Geophysics Agency station in Majene district for the period 1983 to 2011. This study aims to analyze the comfortable level category in the Majene city based on the Temperature Humidity Index by calculating the probability of steady-state, the mean residence time and the mean first passage time. Categorizing the level of comfortable which is based on the Temperature Humidity Index consists of three categories, namely the comfortable, quite comfortable and uncomfortable. The trend of comfortable levels in the Majene city from 1983 to 2011 was fluctuated in the categories of quite comfortable and uncomfortable. Uncomfortable category occurs in October and November each year. The steady-state probability values indicates that the quite comfortable category has the highest chance of appearance, which is around 70%, and the comfortable category has the smallest chance of appearance, which is only about 5%. Meanwhile, the mean residence time and the mean first passage time indicate that the quite comfortable category have the longest duration of occurrence, which is around 5 days, and has the shortest duration to recur after occurring in the previous event, which is around 1.43 days.

scholarly journals Mean first-passage time of a tumor cell growth system with time delay and colored cross-correlated noises excitation

2017 ◽  
Vol 37 (2) ◽  
pp. 191-198 ◽  
Author(s):  
Shenghong Li ◽  
Yong Huang
Keyword(s):  
Time Delay ◽  
Noise Intensity ◽  
First Passage Time ◽  
Passage Time ◽  
Mean First Passage Time ◽  
Tumor Cell Growth ◽  
First Passage ◽  
Growth System ◽  
The Mean ◽  
Correlated Noises

In this paper, the mean first-passage time of a delayed tumor cell growth system driven by colored cross-correlated noises is investigated. Based on the Novikov theorem and the method of probability density approximation, the stationary probability density function is obtained. Then applying the fastest descent method, the analytical expression of the mean first-passage time is derived. Finally, effects of different kinds of delays and noise parameters on the mean first-passage time are discussed thoroughly. The results show that the time delay included in the random force, additive noise intensity and multiplicative noise intensity play a positive role in the disappearance of tumor cells. However, the time delay included in the determined force and the correlation time lead to the increase of tumor cells.

Scaling of average receiving time on double-weighted polygon networks

2021 ◽  
Author(s):  
Xiaoyan Li ◽  
Yu Sun
Keyword(s):  
Iterative Method ◽  
Path Length ◽  
First Passage Time ◽  
Passage Time ◽  
Traffic Networks ◽  
Mean First Passage Time ◽  
First Passage ◽  
Specific Calculation ◽  
Calculation Process ◽  
The Mean

In this paper, we introduce a class of double-weighted polygon networks with two different meanings of weighted factors [Formula: see text] and [Formula: see text], which represent path-difficulty and path-length, respectively, based on actual traffic networks. Picking an arbitrary node from the hub nodes set as the trap node, and the double-weighted polygon networks are divided into [Formula: see text] blocks by combining with the iterative method. According to biased random walks, the calculation expression of average receiving time (ART) of any polygon networks is given by using the intermediate quantity the mean first-passage time (MFPT), which is applicable to any [Formula: see text] ([Formula: see text]) polygon networks. What is more, we display the specific calculation process and results of ART of the double-weighted quadrilateral networks, indicating that ART grows exponentially with respect to the networks order and the exponent is [Formula: see text] which grows with the product of [Formula: see text]. When [Formula: see text] increases, ART increases linearly ([Formula: see text]) or sublinearly ([Formula: see text]) with the size of networks, and the smaller value of [Formula: see text], the higher transportation efficiency.

Calculations of first passage time of delayed tree-like networks

2015 ◽  
Vol 29 (28) ◽  
pp. 1550200
Author(s):  
Shuai Wang ◽  
Weigang Sun ◽  
Song Zheng
Keyword(s):  
Random Walks ◽  
First Passage Time ◽  
Passage Time ◽  
The Novel ◽  
Mean First Passage Time ◽  
First Passage ◽  
Initial Node ◽  
Network Parameters ◽  
Self Similar ◽  
The Mean

In this paper, we study random walks in a family of delayed tree-like networks controlled by two network parameters, where an immobile trap is located at the initial node. The novel feature of this family of networks is that the existing nodes have a time delay to give birth to new nodes. By the self-similar network structure, we obtain exact solutions of three types of first passage time (FPT) measuring the efficiency of random walks, which includes the mean receiving time (MRT), mean sending time (MST) and mean first passage time (MFPT). The obtained results show that the MRT, MST and MFPT increase with the network parameters. We further show that the values of MRT, MST and MFPT are much shorter than the nondelayed counterpart, implying that the efficiency of random walks in delayed trees is much higher.

Sign in / Sign up

Export Citation Format

Share Document