相关论文: The Total Variation Flow in Metric Random Walk Spa…

Random walks are a fundamental model in applied mathematics and are a common example of a Markov chain. The limiting stationary distribution of the Markov chain represents the fraction of the time spent in each state during the stochastic…

We develop a general mathematical framework for variational problems where the unknown function assumes values in the space of probability measures on some metric space. We study weak and strong topologies and define a total variation…

This paper is devoted to the investigation of gradient flows in asymmetric metric spaces (for example, irreversible Finsler manifolds and Minkowski normed spaces) by means of discrete approximation. We study basic properties of curves and…

Modeling stochastic dynamics from discrete observations is a key interdisciplinary challenge. Existing methods often fail to estimate the continuous evolution of probability densities from trajectories or face the curse of dimensionality.…

The purpose of this paper is to extend the investigation of the Fleming-Viot process in discrete space started in a previous work to two specific examples. The first one corresponds to a random walk on the complete graph. Due to its…

Let $\mathcal G$ be an infinite graph -- not necessarily one-ended -- on which the simple random walk is transient. We define a variant of the continuous-time random walk on $\mathcal G$ which reaches $\infty$ in finite time and "reflects…

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy's quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has $l$ integer self-loops, can be generalized to a…

Graph vertex embeddings based on random walks have become increasingly influential in recent years, showing good performance in several tasks as they efficiently transform a graph into a more computationally digestible format while…

We prove results for random walks in dynamic random environments which do not require the strong uniform mixing assumptions present in the literature. We focus on the "environment seen from the walker"-process and in particular its…

We investigate some previously unexplored (or underexplored) computational aspects of total variation (TV) distance. First, we give a simple deterministic polynomial-time algorithm for checking equivalence between mixtures of product…

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

We study the problem of estimating the value function of discrete-time switched systems under arbitrary switching. Unlike the switched LQR problem, where both inputs and mode sequences are optimized, we consider the case where switching is…

We define quantization scheme for discrete-time random walks on the half-line consistent with Szegedy's quantization of finite Markov chains. Motivated by the Karlin and McGregor description of discrete-time random walks in terms of…

In this paper, we establish a novel connection between total variation (TV) distance estimation and probabilistic inference. In particular, we present an efficient, structure-preserving reduction from relative approximation of TV distance…

Under steady flow conditions, the topological complexity inherent to all random 3D porous media imparts complicated flow and transport dynamics. It has been established that this complexity generates persistent chaotic advection via a…

Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…

Consider the random walk $G_n : = g_n \ldots g_1$, $n \geq 1$, where $(g_n)_{n\geq 1}$ is a sequence of independent and identically distributed random elements with law $\mu$ on the general linear group ${\rm GL}(V)$ with $V=\mathbb R^d$.…

We consider the model of random walk on dynamical percolation introduced by Peres, Stauffer and Steif (2015). We obtain comparison results for this model for hitting and mixing times and for the spectral-gap and log-Sobolev constant with…

Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These…

In recent years, total variation (TV) and Euler's elastica (EE) have been successfully applied to image processing tasks such as denoising and inpainting. This paper investigates how to extend TV and EE to the supervised learning settings…