Related papers: Random walk loop soup
A Brownian spatial tree is defined to be a pair $(\mathcal{T},\phi)$, where $\mathcal{T}$ is the rooted real tree naturally associated with a Brownian excursion and $\phi$ is a random continuous function from $\mathcal{T}$ into…
In a recent paper of Eichelsbacher and Koenig (2008) the model of ordered random walks has been considered. There it has been shown that, under certain moment conditions, one can construct a k-dimensional random walk conditioned to stay in…
We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…
Random walk centrality is a fundamental metric in graph mining for quantifying node importance and influence, defined as the weighted average of hitting times to a node from all other nodes. Despite its ability to capture rich graph…
A particle moves randomly over the integer points of the real line. Jumps of the particle outside the membrane (a fixed "locally perturbating set") are i.i.d., have zero mean and finite variance, whereas jumps of the particle from the…
We offer a unified approach to the theory of concave majorants of random walks by providing a path transformation for a walk of finite length that leaves the law of the walk unchanged whilst providing complete information about the concave…
A geometric p-rough path can be seen to be a genuine path of finite p-variation with values in a Lie group equipped with a natural distance. The group and its distance lift (R^{d},+,0) and its Euclidean distance. This approach allows us to…
We consider randomized computation of continuous data in the sense of Computable Analysis. Our first contribution formally confirms that it is no loss of generality to take as sample space the Cantor space of infinite FAIR coin flips. This…
We study the analogue of Poisson ensembles of Markov loops ('loop soups') in the setting of one-dimensional diffusions. We give a detailed description of the corresponding intensity measure. The properties of this measure on loops lead us…
Infinite sums of i.i.d. random variables discounted by a multiplicative random walk are called perpetuities and have been studied by many authors. The present paper provides a log-type moment result for such random variables under minimal…
The flow of ideas has been extensively studied by physicists, psychologists, and machine learning engineers. This paper adopts specific tools from microrheology to investigate the similarity-based flow of ideas. We introduce a random walker…
It is well known that the weak limit of a suitably scaled continuous-time random walk (CTRW) is the Brownian motion. We investigate the convergence of certain patterned random matrices whose entries are independent CTRWs and their…
A noise reinforced Brownian motion is a centered Gaussian process $\hat B=(\hat B(t))_{t\geq 0}$ with covariance $E(\hat B(t)\hat B(s))=(1-2p)^{-1}t^ps^{1-p} \quad \text{for} \quad 0\leq s \leq t,$ where $p\in(0,1/2)$ is a reinforcement…
Exact coupling of random walks is studied. Conditions for admitting a successful exact coupling are given that are necessary and in the Abelian case also sufficient. In the Abelian case, it is shown that a random walk $S$ with step-length…
We consider the approximation of a convolution of possibly different probability measures by (compound) Poisson distributions and also by related signed measures of higher order. We present new total variation bounds having a better…
We define a large class of continuous time multifractal random measures and processes with arbitrary log-infinitely divisible exact or asymptotic scaling law. These processes generalize within a unified framework both the recently defined…
Random walk is a fundamental concept with applications ranging from quantum physics to econometrics. Remarkably, one specific model of random walks appears to be ubiquitous across many fields as a tool to analyze transport phenomena in…
Loop-weighted walk with parameter $\lambda\geq 0$ is a non-Markovian model of random walks that is related to the loop $O(N)$ model of statistical mechanics. A walk receives weight $\lambda^{k}$ if it contains $k$ loops; whether this is a…
This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the…
Simple random walks are a basic staple of the foundation of probability theory and form the building block of many useful and complex stochastic processes. In this paper we study a natural generalization of the random walk to a process in…