Related papers: Sylvester's problem for random walks and bridges

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

Random walk is an explainable approach for modeling natural processes at the molecular level. The Random Permutation Set Theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Dempster-Shafer Theory.…

This paper treats of a kind of a gambler's ruin problem, which seeks the probability that a random walker first hits the origin at a certain time. In addition to a usual random walk which hops either rightwards or leftwards, the present…

We study the asymptotic tail probability of the first-passage time over a moving boundary for a random walk conditioned to return to zero, where the increments of the random walk have finite variance. Typically, the asymptotic tail behavior…

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, 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…

We define a new ensemble for self-avoiding walks in the upper half-plane, the fixed irredicible bridge ensemble, by considering self-avoiding walks in the upper half-plane up to their $n$-th bridge height, $Y_n$, and scaling the walk by…

We are studying the motion of a random walker in two and three dimensional continuum with uniformly distributed jump-length. This is different from conventional Lavy flight. In 2D and 3D continuum, a random walker can move in any direction,…

We identify a fundamental phenomenon of heterogeneous one dimensional random walks: the escape (traversal) time is maximized when the heterogeneity in transition probabilities forms a pyramid-like potential barrier. This barrier corresponds…

We consider the probability that a two-dimensional random walk starting from the origin never returns to the half-line $ (- \infty,0] \times {0}$ before time $n$. Let $X^{(1)}=(X_{1},X_{2})$ be the increment of the two-dimensional random…

In this paper, we investigate the distribution of $k$-free numbers in a class of $\alpha$-random walks on the integer lattice $\mathbb{Z}$. In these walks, the walker starts from a non-negative integer $r$ and moves to the right by $a$…

To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various…

As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…

We study the asymptotic behaviour of the probability that a weighted sum of centered i.i.d. random variables X_k does not exceed a constant barrier. For regular random walks, the results follow easily from classical fluctuation theory,…

We initiate the study of property testing in arbitrary planar graphs. We prove that bipartiteness can be tested in constant time, improving on the previous bound of $\tilde{O}(\sqrt{n})$ for graphs on $n$ vertices. The constant-time…

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the…

It is known that the stationary distribution of the random walk process is dependent on the structure of the network. This could provide us a solution of the network reconstruction. However, the stationary distribution of the random walk…

We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…

Random transvections generate a walk on the space of symplectic forms on $\mathbf{F}_q^{2n}$. The main result is establishing cutoff for this Markov chain. After $n+c$ steps, the walk is close to uniform while before $n-c$, it is far from…