Related papers: Dimensional Interpolation for Random Walk

Our paper gives bounds for the rate of convergence for a class of random walks on the d-dimensional torus generated by a set of n vectors in R^d/Z^d. We give bounds on the discrepancy distance from Haar measure; our lower bound holds for…

Geometric metrology includes one or two-dimensional (1D or 2D) distance or plane measurements, as well as the three-dimensional (3D) scanning. The 1D or 2D measuring system is unable to obtain advanced 3D feature, while the 3D scanning…

We discuss random interpolation in weighted Dirichlet spaces $\mathcal{D}_\alpha$, $0\leq \alpha\leq 1$. While conditions for deterministic interpolation in these spaces depend on capacities which are very hard to estimate in general, we…

We compute the average shape of trajectories of some one--dimensional stochastic processes x(t) in the (t,x) plane during an excursion, i.e. between two successive returns to a reference value, finding that it obeys a scaling form. For…

We show that the scaling limit exists and is invariant to dilations and rotations. We give some tools that might be useful to show universality.

Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…

Random walks over directed graphs are used to model activities in many domains, such as social networks, influence propagation, and Bayesian graphical models. They are often used to compute the importance or centrality of individual nodes…

The asymptotic probability distribution for a Brownian particle wandering in a 2D plane with random traps to enclose the algebraic area A by time t is calculated using the instanton technique.

We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…

We adapt Schaback's error doubling trick [R. Schaback. Improved error bounds for scattered data interpolation by radial basis functions. Math. Comp., 68(225):201--216, 1999.] to give error estimates for radial interpolation of functions…

We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…

Let S_1(n),...,S_p(n) be independent symmetric random walks in Z^d. We establish moderate deviations and law of the iterated logarithm for the intersection of the ranges #{S_1[0,n]\cap... \cap S_p[0,n]} in the case d=2, p\ge 2 and the case…

We consider a d-dimensional random walk in random scenery X(n), where the scenery consists of i.i.d. with exponential moments but a tail decay of the form exp(-c t^a) with a<d/2. We study the probability, when averaged over both randomness,…

In this paper we consider the simple random walk on $\mathbb{Z}^d$, $d \geq 3$, conditioned to stay in a large domain $D_N$ of typical diameter $N$. Considering the range up to time $t_N \geq N^{2+\delta}$ for some $\delta > 0$, we…

We consider defining the embedding of a triangle mesh into $R^3$, up to translation, rotation, and scale, by its vector of dihedral angles. Theoretically, we show that locally, almost everywhere, the map from realizable vectors of dihedrals…

The transition probability for a one-dimensional discrete symmetric random walk under a reflecting barrier was once given by the method of images. [S. Chandrasekhar, Rev. Mod. Phys. 15, 1 (1943).] However, several inconsistencies have been…

We develop techniques to obtain rigorous bounds on the behaviour of random walks on combs. Using these bounds we calculate exactly the spectral dimension of random combs with infinite teeth at random positions or teeth with random but…

We present precise anisotropic interpolation error estimates for smooth functions using a new geometric parameter and derive inverse inequalities on anisotropic meshes. In our theory, the interpolation error is bounded in terms of the…

We consider a continuous-time random walk which is defined as an interpolation of a random walk on a point process on the real line. The distances between neighboring points of the point process are i.i.d. random variables in the normal…

We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…