English
Related papers

Related papers: Random Walk with Long-Range Constraints

200 papers

In this article we study the distribution of the number of points of a simple random walk, visited a given number of times (the k-multiple point range). In a previous article we had developed a graph theoretical approach which is now…

Probability · Mathematics 2013-12-02 Daniel Hoef

We investigate the relation between the local picture left by the trajectory of a simple random walk on the torus (Z/NZ)^d, d >= 3, until u N^d time steps, u > 0, and the model of random interlacements recently introduced by Sznitman. In…

Probability · Mathematics 2009-07-22 David Windisch

In this paper we study a random graph with $N$ nodes, where node $j$ has degree $D_j$ and $\{D_j\}_{j=1}^N$ are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^{-\tau+1}$ for some $\tau>3$ and some constant $c>0$. This…

Probability · Mathematics 2007-05-23 Remco van der Hofstad , Gerard Hooghiemstra , Piet Van Mieghem

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$.…

Probability · Mathematics 2022-09-13 Hui Xiao , Ion Grama , Quansheng Liu

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

Probability · Mathematics 2020-01-06 Marek Biskup , Pierre-François Rodriguez

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…

Data Structures and Algorithms · Computer Science 2021-02-16 Amartya Shankha Biswas , Edward Pyne , Ronitt Rubinfeld

A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…

Statistical Mechanics · Physics 2010-07-28 G. Le Caer

A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…

Probability · Mathematics 2024-11-06 Hamin Jung

We are interested in recovering information on a stochastic block model from the subgraph discovered by an exploring random walk. Stochastic block models correspond to populations structured into a finite number of types, where two…

Statistics Theory · Mathematics 2021-06-08 Viet Chi Tran , Thi Phuong Thuy Vo

We study random one-Lipschitz integer functions $f$ on the vertices of a finite connected graph, sampled according to the weight $W(f) = \prod_{\langle v, w \rangle \in E} \mathbf{c}^{ \mathbb{I} \{ f(v) = f(w) \} }$ where $\mathbf{c} \geq…

Probability · Mathematics 2023-09-27 Alex M. Karrila

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…

Probability · Mathematics 2011-10-27 Ron Rosenthal

We prove the limit theorem for paths of random walks with $n$ steps in $\mathbb{R}^d$ as $n$ and $d$ both go to infinity. For this, the paths are viewed as finite metric spaces equipped with the $\ell_p$-metric for $p\in[1,\infty)$. Under…

Probability · Mathematics 2025-12-15 Bochen Jin

We study, in d-dimensions, the random walker with geometrically shrinking step sizes at each hop. We emphasize the integrated quantities such as expectation values, cumulants and moments rather than a direct study of the probability…

Statistical Mechanics · Physics 2009-11-11 Tonguc Rador

We introduce a discrete-time random walk model on a one-dimensional lattice with a nonconstant sojourn time and prove that the discrete density converges to a solution of a continuum diffusion equation. Our random walk model is not…

Analysis of PDEs · Mathematics 2023-02-14 Jaywan Chung , Yong-Jung Kim , Min-Gi Lee

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…

Probability · Mathematics 2014-10-02 Jiří Černý , Tobias Wassmer

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

Probability · Mathematics 2018-01-23 Charles Bordenave , Pietro Caputo , Justin Salez

Continuous time random Walk model has been versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as disordered or porous media. We are studying the continuous limits of Heterogeneous…

Statistical Mechanics · Physics 2020-06-23 Liubov Tupikina

The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…

Statistical Mechanics · Physics 2017-03-29 Tomasz Srokowski

We study the long-time behavior of decoupled continuous-time random walks characterized by superheavy-tailed distributions of waiting times and symmetric heavy-tailed distributions of jump lengths. Our main quantity of interest is the…

Statistical Mechanics · Physics 2011-12-30 S. I. Denisov , S. B. Yuste , Yu. S. Bystrik , H. Kantz , K. Lindenberg

Given $0<\alpha\leq\pi$, ${\epsilon}>0$ and $n$, we define random graphs on the $d$-dimensional sphere by drawing $n$ i.i.d. uniform random points for the vertices, and edges $u {\sim} v$ whenever the geodesic distance between $u$ and $v$…

Combinatorics · Mathematics 2022-07-29 Francisco Martinez-Figueroa
‹ Prev 1 3 4 5 6 7 10 Next ›