Related papers: Random Walk for modelling Multi Core Fiber cross-t…
To analyze a homogeneous weakly coupled multicore fiber (WC-MCF) based transmission system via simulation, we propose an efficient (fast and accurate) WC-MCF's channel model, which can describe the propagation effects including attenuation,…
We investigate the evolution of decorrelation bandwidth of inter core crosstalk (IC-XT) in homogeneous weakly coupled multicore fibers (WC-MCFs). The modified mode-coupled equations (MCEs) are numerically solved by combining the fourth…
Motivated by the Internet-of-things and sensor networks for cyberphysical systems, the problem of dynamic sensor activation for the centralized tracking of an i.i.d. time-varying process is examined. The tradeoff is between energy…
A novel version of the Continuous-Time Random Walk (CTRW) model with memory is developed. This memory means the dependence between arbitrary number of successive jumps of the process, while waiting times between jumps are considered as…
We propose two different schemes of realizing a virtual walk corresponding to a kinetic exchange model of opinion dynamics. The walks are either Markovian or non-Markovian in nature. The opinion dynamics model is characterized by a…
In this paper we present analytical and random walk based solutions to diffusion in semi-permeable layered media with varying diffusivity. We propose a new random walk transit model (hybrid model) based on treating the membrane permeability…
The study of quantum walks has been shown to have a wide range of applications in areas such as artificial intelligence, the study of biological processes, and quantum transport. The quantum stochastic walk, which allows for incoherent…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
Random walk is an explainable approach for modeling natural processes at the molecular level. The Random Permutation Set Theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Dempster-Shafer Theory.…
We explore static noise in a discrete quantum random walk over a homogeneous cyclic graph, focusing on spectral and dynamical properties. Using a three-parameter unitary coin, we control the spectral structure of the noiseless step operator…
We consider a population of $N$ labeled random walkers moving on a substrate, and an excitation jumping among the walkers upon contact. The label $\mathcal{X}(t)$ of the walker carrying the excitation at time $t$ can be viewed as a…
We study the problem of detecting a random walk on a graph from a sequence of noisy measurements at every node. There are two hypotheses: either every observation is just meaningless zero-mean Gaussian noise, or at each time step exactly…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling…
We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…
We study a simple run-and-tumble random walk whose switching frequency from run mode to tumble mode and the reverse depend on a stochastic signal. We consider a particularly sharp, step-like dependence, where the run to tumble switching…
For more than a century lattice random walks have been employed ubiquitously, both as a theoretical laboratory to develop intuition about more complex stochastic processes and as a tool to interpret a vast array of empirical observations.…
Item-based models are among the most popular collaborative filtering approaches for building recommender systems. Random walks can provide a powerful tool for harvesting the rich network of interactions captured within these models. They…
Blockchain and general purpose distributed ledgers are foundational technologies which bring significant innovation in the infrastructures and other underpinnings of our socio-economic systems. These P2P technologies are able to securely…
This article introduces a model for interacting vertex-reinforced random walks, each taking values on a complete sub-graph of a locally finite undirected graph. The transition probability for a walk to a given vertex depends on the…