MFPT calculation for random walks in inhomogeneous networks

Knowing the expected arrival time at a particular state, also known as the mean first passage time (MFPT), often plays an important role for a large class of random walkers in their respective state-spaces. Contrasting to ideal conditions required by recent advancements on MFPT estimations, many nat...

Full description

Bibliographic Details
Main Authors: Wijesundera, Isuri, Halgamuge, Malka N., Nirmalathas, Ampalavanapillai, Nanayakkara, Thrishantha
Format: Article in Journal/Newspaper
Language:unknown
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S0378437116302837
id ftrepec:oai:RePEc:eee:phsmap:v:462:y:2016:i:c:p:986-1002
record_format openpolar
spelling ftrepec:oai:RePEc:eee:phsmap:v:462:y:2016:i:c:p:986-1002 2024-04-14T08:15:50+00:00 MFPT calculation for random walks in inhomogeneous networks Wijesundera, Isuri Halgamuge, Malka N. Nirmalathas, Ampalavanapillai Nanayakkara, Thrishantha http://www.sciencedirect.com/science/article/pii/S0378437116302837 unknown http://www.sciencedirect.com/science/article/pii/S0378437116302837 article ftrepec 2024-03-19T10:34:16Z Knowing the expected arrival time at a particular state, also known as the mean first passage time (MFPT), often plays an important role for a large class of random walkers in their respective state-spaces. Contrasting to ideal conditions required by recent advancements on MFPT estimations, many naturally occurring random walkers encounter inhomogeneity of transport characteristics in the networks they walk on. This paper presents a heuristic method to divide an inhomogeneous network into homogeneous network primitives (NPs) optimized using particle swarm optimizer, and to use a ‘hop-wise’ MFPT calculation method. This methodology’s potential is demonstrated through simulated random walks and with a case study using the dataset of past cyclone tracks over the North Atlantic Ocean. Parallel processing was used to increase calculation efficiency. The predictions using the proposed method are compared to real data averages and predictions assuming homogeneous transport properties. The results show that breaking the problem into NPs reduces the average error from 18.8% to 5.4% with respect to the homogeneous network assumption. MFPT; Random walk; Inhomogeneous; Network primitives; PSO; Cyclone prediction; Article in Journal/Newspaper North Atlantic RePEc (Research Papers in Economics)
institution Open Polar
collection RePEc (Research Papers in Economics)
op_collection_id ftrepec
language unknown
description Knowing the expected arrival time at a particular state, also known as the mean first passage time (MFPT), often plays an important role for a large class of random walkers in their respective state-spaces. Contrasting to ideal conditions required by recent advancements on MFPT estimations, many naturally occurring random walkers encounter inhomogeneity of transport characteristics in the networks they walk on. This paper presents a heuristic method to divide an inhomogeneous network into homogeneous network primitives (NPs) optimized using particle swarm optimizer, and to use a ‘hop-wise’ MFPT calculation method. This methodology’s potential is demonstrated through simulated random walks and with a case study using the dataset of past cyclone tracks over the North Atlantic Ocean. Parallel processing was used to increase calculation efficiency. The predictions using the proposed method are compared to real data averages and predictions assuming homogeneous transport properties. The results show that breaking the problem into NPs reduces the average error from 18.8% to 5.4% with respect to the homogeneous network assumption. MFPT; Random walk; Inhomogeneous; Network primitives; PSO; Cyclone prediction;
format Article in Journal/Newspaper
author Wijesundera, Isuri
Halgamuge, Malka N.
Nirmalathas, Ampalavanapillai
Nanayakkara, Thrishantha
spellingShingle Wijesundera, Isuri
Halgamuge, Malka N.
Nirmalathas, Ampalavanapillai
Nanayakkara, Thrishantha
MFPT calculation for random walks in inhomogeneous networks
author_facet Wijesundera, Isuri
Halgamuge, Malka N.
Nirmalathas, Ampalavanapillai
Nanayakkara, Thrishantha
author_sort Wijesundera, Isuri
title MFPT calculation for random walks in inhomogeneous networks
title_short MFPT calculation for random walks in inhomogeneous networks
title_full MFPT calculation for random walks in inhomogeneous networks
title_fullStr MFPT calculation for random walks in inhomogeneous networks
title_full_unstemmed MFPT calculation for random walks in inhomogeneous networks
title_sort mfpt calculation for random walks in inhomogeneous networks
url http://www.sciencedirect.com/science/article/pii/S0378437116302837
genre North Atlantic
genre_facet North Atlantic
op_relation http://www.sciencedirect.com/science/article/pii/S0378437116302837
_version_ 1796314307784343552