Related papers: Regularized Dikin Walks for Sampling Truncated Log…

We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recently introduced framework of Lelli and Stauffer, we consider…

We consider random walk in Dirichlet random environment in ${\mathbf{Z}^d, d\ge 3}$, which corresponds to the case where the environment is constructed from i.i.d. transition probabilities at each vertex with a Dirichlet distribution with…

We revisit the statistics of extremes and records of symmetric random walks with stochastic resetting, extending earlier studies in several directions. We put forward a diffusive scaling regime (symmetric step length distribution with…

In this paper, we study the problem of sampling from log-concave distributions supported on convex, compact sets, with a particular focus on the randomized midpoint discretization of both vanilla and kinetic Langevin diffusions in this…

Sampling algorithms play an important role in controlling the quality and runtime of diffusion model inference. In recent years, a number of works~\cite{chen2023sampling,chen2023ode,benton2023error,lee2022convergence} have proposed schemes…

We analyze the hit-and-run algorithm for sampling uniformly from an isotropic convex body $K$ in $n$ dimensions. We show that the algorithm mixes in time $\tilde{O}(n^2/ \psi_n^2)$, where $\psi_n$ is the smallest isoperimetric constant for…

There has been a recent surge of powerful tools to show rapid mixing of Markov chains, via functional inequalities such as Poincar\'e inequalities. In many situations, Markov chains fail to mix rapidly from a worst-case initialization, yet…

Given a finite graph G, a vertex of the lamplighter graph consists of a zero-one labeling of the vertices of G, and a marked vertex of G. For transitive graphs G, we show that, up to constants, the relaxation time for simple random walk in…

We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently…

We study the complexity of sampling, rounding, and integrating arbitrary logconcave functions. Our new approach provides the first complexity improvements in nearly two decades for general logconcave functions for all three problems, and…

Sampling from log-concave distributions is a well researched problem that has many applications in statistics and machine learning. We study the distributions of the form $p^{*}\propto\exp(-f(x))$, where…

Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random…

Random walkers absorbing on a boundary sample the Harmonic Measure linearly and independently: we discuss how the recurrence times between impacts enable non-linear moments of the measure to be estimated. From this we derive a new technique…

We introduce a notion called entropic independence that is an entropic analog of spectral notions of high-dimensional expansion. Informally, entropic independence of a background distribution $\mu$ on $k$-sized subsets of a ground set of…

Most approximation algorithms for #P-complete problems (e.g., evaluating the permanent of a matrix or the volume of a polytope) work by reduction to the problem of approximate sampling from a distribution $\pi$ over a large set $\S$. This…

Logconcave functions represent the current frontier of efficient algorithms for sampling, optimization and integration in R^n. Efficient sampling algorithms to sample according to a probability density (to which the other two problems can…

For a graph $G$ on $n$ vertices, naively sampling the position of a random walk of at time $t$ requires work $\Omega(t)$. We desire local access algorithms supporting $\text{position}(G,s,t)$ queries, which return the position of a random…

For a difference approximations of multidimensional diffusion, the truncated local limit theorem is proved. Under very mild conditions on the distribution of the difference terms, this theorem provides that the transition probabilities of…

We map the problem of diffusion in the quenched trap model onto a new stochastic process: Brownian motion which is terminated at the coverage "time" ${\cal S}_\alpha=\sum_{x=-\infty} ^\infty (n_x)^\alpha$ with $n_x$ being the number of…

Using the electric and coupling approaches, we derive a series of results concerning the mixing times for the stratified random walk on the d-cube, inspired in the results of Chung and Graham (1997) Stratified random walks on the n-cube.