Related papers: Markov Random Walk Representations with Continuous…
We obtain discrete mixture representations for parametric families of probability distributions on Euclidean spheres, such as the von Mises--Fisher, the Watson and the angular Gaussian families. In addition to several special results we…
The sampling of the configuration space in diffusion Monte Carlo (DMC) is done using walkers moving randomly. In a previous work on the Hubbard model [\href{https://doi.org/10.1103/PhysRevB.60.2299}{Assaraf et al.~Phys.~Rev.~B \textbf{60},…
Working withing the framework of Hopf algebras, a random walk and the associated diffusion equation are constructed on a space that is algebraically described as the merging of the real line algebra with the anyonic line algebra.…
We present a new method to compute the first crossing distribution in excursion set theory for the case of correlated random walks. We use a combination of the path integral formalism of Maggiore & Riotto, and the integral equation solution…
Diffusions are a successful technique to sample from high-dimensional distributions. The target distribution can be either explicitly given or learnt from a collection of samples. They implement a diffusion process whose endpoint is a…
We examine diffusion-limited aggregation for a one-dimensional random walk with long jumps. We achieve upper and lower bounds on the growth rate of the aggregate as a function of the number of moments a single step of the walk has. In this…
We consider the task of filtering a dynamic parameter evolving as a diffusion process, given data collected at discrete times from a likelihood which is conjugate to the marginal law of the diffusion, when a generic dual process on a…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We consider a previously devised model describing Levy random walks (Phys. Rev E 79, 011110; 80, 031148, (2009)). It is demonstrated numerically that the given model describes Levy random walks with superdiffusive, ballistic, as well as…
We consider random walks in dynamic random environments, with an environment generated by the time-reversal of a Markov process from the oriented percolation universality class. If the influence of the random medium on the walk is small in…
Continuous time random walks (CTRWs) are versatile models for anomalous diffusion processes that have found widespread application in the quantitative sciences. Their scaling limits are typically non-Markovian, and the computation of their…
Starting with a percolation model in $\Z^d$ in the subcritical regime, we consider a random walk described as follows: the probability of transition from $x$ to $y$ is proportional to some function $f$ of the size of the cluster of $y$.…
We analyze a class of continuous time random walks in $\mathbb R^d,d\geq 2,$ with uniformly distributed directions. The steps performed by these processes are distributed according to a generalized Dirichlet law. Given the number of changes…
In network embedding, random walks play a fundamental role in preserving network structures. However, random walk based embedding methods have two limitations. First, random walk methods are fragile when the sampling frequency or the number…
Continuous time random walks have random waiting times between particle jumps. We define the correlated continuous time random walks (CTRWs) that converge to fractional Pearson diffusions (fPDs). The jumps in these CTRWs are obtained from…
In this paper continuous time random walk models approximating fractional space-time diffusion processes are studied. Stochastic processes associated with the considered equations represent time-changed processes, where the time-change…
Behind the nice unification provided by the notion of the level 2.5 in the field of large deviations for time-averages over a long Markov trajectory, there are nevertheless very important qualitative differences between the meaning of the…
We describe an exact approach for calculating transition probabilities and waiting times in finite-state discrete-time Markov processes. All the states and the rules for transitions between them must be known in advance. We can then…
We derive an exact closed-form analytical expression for the distribution of the cover time for a random walk over an arbitrary graph. In special case, we derive simplified exact expressions for the distributions of cover time for a…
Although many successful ensemble clustering approaches have been developed in recent years, there are still two limitations to most of the existing approaches. First, they mostly overlook the issue of uncertain links, which may mislead the…