Related papers: The delayed uncoupled continuous-time random walks…
Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…
We introduce the continuous-time vertex-reinforced random walk (cVRRW) as a continuous-time version of the vertex-reinforced random walk (VRRW), which might open a new perspective on the study of the VRRW. It has been proved by Limic and…
Monte Carlo (MC) simulations of transport in random porous networks indicate that for high variances of the log-normal permeability distribution, the transport of a passive tracer is non-Fickian. Here we model this non-Fickian dispersion in…
This paper addresses learning end-to-end models for time series data that include a temporal alignment step via dynamic time warping (DTW). Existing approaches to differentiable DTW either differentiate through a fixed warping path or apply…
We consider a car-following model described by a delay difference equation and give its exact solutions that present propagation of a traffic jam. This model is a discrete-time version of the delayed optimal-velocity model; in the continuum…
The dynamic time warping (dtw) distance fails to satisfy the triangle inequality and the identity of indiscernibles. As a consequence, the dtw-distance is not warping-invariant, which in turn results in peculiarities in data mining…
We adapt continuous time random walk (CTRW) formalism to describe asset price evolution and discuss some of the problems that can be treated using this approach. We basically focus on two aspects: (i) the derivation of the price…
In this dissertation we demonstrate that the continuous-time quantum walk models remain powerful for nontrivial graph structures. We consider two aspects of this problem. First, it is known that the standard Continuous-Time Quantum Walk…
Diverse facets Of the Theory of Quantum Walks on Graph are reviewed Till now .In specific, Quantum network routing, Quantum Walk Search Algorithm, Element distinctness associated to the eigenvalues of Graphs and the use of these relation…
We derive an explicit expression for the Fourier-Laplace transform of the two-point distribution function $p(x_1,t_1;x_2,t_2)$ of a continuous time random walk (CTRW), thus generalizing the result of Montroll and Weiss for the single point…
We introduce a discrete-time random walk model on a one-dimensional lattice with a nonconstant sojourn time and prove that the discrete density converges to a solution of a continuum diffusion equation. Our random walk model is not…
The nonrelativistic standard model for a continuous, one-parameter diffusion process in position space is the Wiener process. As well-known, the Gaussian transition probability density function (PDF) of this process is in conflict with…
We investigate experimental design for randomized controlled trials (RCTs) with both equal and unequal treatment-control assignment probabilities. Our work makes progress on the connection between the distributional discrepancy minimization…
Delay Tolerant Networking (DTN) aims to address a myriad of significant networking challenges that appear in time-varying settings, such as mobile and satellite networks, wherein changes in network topology are frequent and often subject to…
Diffusive cosmic-ray transport in nonuniform large-scale magnetic fields in the presence of boundaries is considered. Reflecting and absorbing boundary conditions are derived for a modified telegraph equation with a convective term.…
Within many real-world networks the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal graphs requires a proximity measure to compare different…
Random walk based sampling methods have been widely used in graph sampling in recent years, while it has bias towards higher degree nodes in the sample. To overcome this deficiency, classical methods such as GMD modify the topology of…
Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign…
Spatiotemporal forecasting has various applications in neuroscience, climate and transportation domain. Traffic forecasting is one canonical example of such learning task. The task is challenging due to (1) complex spatial dependency on…
We study a one-dimensional Markov modulated random walk with jumps. It is assumed that amplitudes of jumps as well as a chosen velocity regime are random and depend on a time spent by the process at a previous state of the underlying Markov…