Related papers: Stochastic integration based on simple, symmetric …

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…

This paper presents a continuous and discrete Lagrangian theory for stochastic Hamiltonian systems on manifolds. The main result is to derive stochastic governing equations for such systems from a critical point of a stochastic action.…

We develop a stochastic integration theory for predictable integrands with respect to a L\'evy basis. Our approach is based on decoupling inequalities for tangent sequences and reduces the construction of the stochastic integral essentially…

Organising the relevant literature and by letting statistical convergence play the main role in the theory of compactness, a variant of compactness called statistical compactness has been achieved. As in case of sequential compactness, one…

Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. Nevertheless, in practice the number of steps required to achieve uniformly distributed samples is rather high. We propose…

The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…

An algorithm (bliss) is proposed to speed up the construction of slow adaptive walks. Slow adaptive walks are adaptive walks biased towards closer points or smaller move steps. They were previously introduced to explore a search space, e.g.…

For a spatial characteristic, there exist commonly fat-tail frequency distributions of fragment-size and -mass of glass, areas enclosed by city roads, and pore size/volume in random packings. In order to give a new analytical approach for…

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

We introduce a lattice random walk discretisation scheme for stochastic differential equations (SDEs) that samples binary or ternary increments at each step, suppressing complex drift and diffusion computations to simple 1 or 2 bit random…

A stochastic algorithm is proposed, finding some elements from the set of intrinsic $p$-mean(s) associated to a probability measure $\nu$ on a compact Riemannian manifold and to $p\in[1,\infty)$. It is fed sequentially with independent…

In this work, we introduce a theory of stochastic integration with respect to symmetric $\alpha$-stable cylindrical L\'evy processes. Since $\alpha$-stable cylindrical L\'evy processes do not enjoy a semi-martingale decomposition, our…

The aim of this paper is to develop a sequence of discrete approximations to a one-dimensional It\^o diffusion that almost surely converges to a weak solution of the given stochastic differential equation. Under suitable conditions, the…

We apply the recently developed theory of symmetry of stochastic differential equations to a stochastic version of the logistic equation, obtaining an explicit integration, i.e. an explicit formula for the process in terms of any single…

We investigate the Randomized Stochastic Accelerated Gradient (RSAG) method, utilizing either constant or adaptive step sizes, for stochastic optimization problems with generalized smooth objective functions. Under relaxed affine variance…

Many classical randomized algorithms (e.g., approximation algorithms for #P-complete problems) utilize the following random walk algorithm for {\em almost uniform sampling} from a state space $S$ of cardinality $N$: run a symmetric ergodic…

In this work we review the basic principles of stochastic logic and propose its application to probabilistic-based pattern-recognition analysis. The proposed technique is intrinsically a parallel comparison of input data to various…

The paper studies stochastic integration with respect to Gaussian processes and fields. It is more convenient to work with a field than a process: by definition, a field is a collection of stochastic integrals for a class of deterministic…

This paper provides convergence analysis for the approximation of a class of path-dependent functionals underlying a continuous stochastic process. In the first part, given a sequence of weak convergent processes, we provide a sufficient…

Computing the similarity between two probability distributions is a recurring theme across control. We introduce a unified family of distances between the probability distributions of two random variables that is based on the discrepancy…