Related papers: Random Walks on Simplicial Complexes and Harmonics
We study models of continuous time, symmetric, $\Z^d$-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We…
Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…
We study non-expanding random walks on the space of affine lattices and establish a new classification theorem for stationary measures. Further, we prove a theorem that relates the genericity with respect to these random walks to Birkhoff…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case. We compute these…
It has been shown recently that graph signals with small total variation can be accurately recovered from only few samples if the sampling set satisfies a certain condition, referred to as the network nullspace property. Based on this…
In this paper, we study the graph-based semi-supervised learning for classifying nodes in attributed networks, where the nodes and edges possess content information. Recent approaches like graph convolution networks and attention mechanisms…
We study the asymptotic behavior of the simple random walk on oriented version of $\mathbb{Z}^2$. The considered latticesare not directed on the vertical axis but unidirectional on the horizontal one, with symmetric random orientations…
We give a complete classification of scaling limits of randomly trapped random walks and associated clock processes on $\mathbb Z^d$, $d\ge 2$. Namely, under the hypothesis that the discrete skeleton of the randomly trapped random walk has…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
We construct random walks taking place on the k-cells of free G-CW complexes of finite type. These random walks define operators acting on the cellular k-chains that relate nicely to the (upper) cellular k-Laplacian. As an application, we…
We develop lagged Metropolis-Hastings walk for sampling from simple undirected graphs according to given stationary sampling probabilities. We explain how to apply the technique together with designed graphs for sampling of units-in-space.…
We introduce the concept of a deterministic walk. Confining our attention to the finite state case, we establish hypotheses that ensure that the deterministic walk is transitive, and show that this property is in some sense robust. We also…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
In this paper, we propose an extension of quantum searches on graphs driven by quantum walks to simplicial complexes. To this end, we newly define a quantum walk on simplicial complex which is an alternative of preceding studies by authors.…
We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…
We study the Ergodic Properties of Random Walks in stationary ergodic environments without uniform ellipticity under a minimal assumption. There are two main components in our work. The first step is to adopt the arguments of Lawler to…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
Message-passing architectures struggle to sufficiently model long-range dependencies in node and graph prediction tasks. We propose a novel approach exploiting hierarchical graph structures and adaptive random walks to address this…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…