Multidimensional Walks with Random Tendency
نویسندگان
چکیده
منابع مشابه
Multidimensional Random Walks in Random Environments with Subclassical Limiting Behavior
In this paper we wilt describe and analyze a class of multidimensional random walks in random environments which contain the one dimensional nearest neighbor situation as a special case and have the pleasant feature that quite a lot can be said about them. Our results make rigorous a heuristic argument of Marinari et al. (1983), and show that in any d < cc we can have (a)X, is recurrent and (b ...
متن کاملConvex Hulls of Multidimensional Random Walks
Let Sk be a random walk in R such that its distribution of increments does not assign mass to hyperplanes. We study the probability pn that the convex hull conv(S1, . . . , Sn) of the first n steps of the walk does not include the origin. By providing an explicit formula, we show that for planar symmetrically distributed random walks, pn does not depend on the distribution of increments. This e...
متن کاملPersonalizing Forum Search using Multidimensional Random Walks
Online forums are a vital resource for users to ask questions and to participate in discussions. Yet, the search functionality on such forum sites is very primitive; posts containing the searched keywords are retrieved in the order of their creation date. In these interactive and social web forum sites, users frequently make connections with other users due to shared interests, same information...
متن کاملOn multidimensional branching random walks in random environment
We study branching random walks in random i.i.d. environment in Zd, d ≥ 1. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience, depending only on the support of the environmental law. We give sufficient conditions for recurrence and for transience. In the recurrent case, we study the asymptotic...
متن کاملRandom Walks with Random Projections
Random projections have been widely used for dimensionality reduction of high dimensional problems. In this paper we show how to compute some popular random walk based proximity measures (hitting and commute times, personalized pagerank) using random projections in undirected graphs. A number of important graph-based real world applications such as image segmentation, collaborative filtering in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2020
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-020-02621-0