Related papers: General diffusions on metric graphs as limits of t…

Donsker Theorem is perhaps the most famous invariance principle result for Markov processes. It states that when properly normalized, a random walk behaves asymptotically like a Brownian motion. This approach can be extended to general…

Anomalous diffusion is frequently described by scaled Brownian motion (SBM), a Gaussian process with a power-law time dependent diffusion coefficient. Its mean squared displacement is $\langle x^2(t)\rangle\simeq\mathscr{K}(t)t$ with…

Stochastic diffusion is the noisy and uncertain process through which dynamics like epidemics, or agents like animal species, disperse over a larger area. Understanding these processes is becoming increasingly important as we attempt to…

We establish the convergence of the densities of a sequence of nonlinear functionals of an underlying Gaussian process to the density of a Gamma distribution. The key idea of our work is a new density formula for random variables in the…

The separating time for two probability measures on a filtered space is an extended stopping time which captures the phase transition between equivalence and singularity. More specifically, two probability measures are equivalent before…

We consider extended slow-fast systems of N interacting diffusions. The typical behavior of the empirical density is described by a nonlinear McKean-Vlasov equation depending on , the scaling parameter separating the time scale of the slow…

We study lower bounds for the problem of approximating a one dimensional distribution given (noisy) measurements of its moments. We show that there are distributions on $[-1,1]$ that cannot be approximated to accuracy $\epsilon$ in…

Recent advances in stochastic gradient techniques have made it possible to estimate posterior distributions from large datasets via Markov Chain Monte Carlo (MCMC). However, when the target posterior is multimodal, mixing performance is…

We consider a finite-state, continuous-time Markov process, represented in the "linear framework" by a directed graph with labelled edges which specifies the infinitesimal generator of the process. If the graph is strongly connected, the…

The phenomenon of macroscopic homogenization is illustrated with a simple example of diffusion. We examine the conditions under which a $d$--dimensional simple random walk in a symmetric random media converges to a Brownian motion. For…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

The need to calibrate increasingly complex statistical models requires a persistent effort for further advances on available, computationally intensive Monte Carlo methods. We study here an advanced version of familiar Markov Chain Monte…

Consider a non-symmetric generalized diffusion $X(\cdot)$ in ${\bbR}^d$ determined by the differential operator $A(\msx)=-\sum_{ij} \partial_ia_{ij}(\msx)\partial_j +\sum_i b_i(\msx)\partial_i$. In this paper the diffusion process is…

We propose and analyze a time-stepping discontinuous Petrov-Galerkin method combined with the continuous conforming finite element method in space for the numerical solution of time-fractional subdiffusion problems. We prove the existence,…

We develop exact Markov chain Monte Carlo methods for discretely-sampled, directly and indirectly observed diffusions. The qualification "exact" refers to the fact that the invariant and limiting distribution of the Markov chains is the…

We propose a variety of models of random walk, discrete in space and time, suitable for simulating stable random variables of arbitrary index $\alpha$ ($0< \alpha \le 2$), in the symmetric case. We show that by properly scaled transition to…

We study a diffusion approximation for a model of stochastic motion of a particle in one spatial dimension. The velocity of the particle is constant but the direction of the motion undergoes random changes with a Poisson clock. Moreover,…

We study distributions of meeting times for finite symmetric Markov chains. For Markov kernels defined on large state spaces which satisfy certain weak inhomogeneity in return probabilities of points up to large numbers of steps, we obtain…

In this study, we introduce a novel method for generating new synthetic samples that are independent and identically distributed (i.i.d.) from high-dimensional real-valued probability distributions, as defined implicitly by a set of Ground…

We argue that existing training-free segmentation methods rely on an implicit and limiting assumption, that segmentation is a spectral graph partitioning problem over diffusion-derived affinities. Such approaches, based on global graph…