Random-walk approximation to vacuum cocycles
نویسندگان
چکیده
منابع مشابه
Random-walk approximation to vacuum cocycles
Quantum random walks are constructed on operator spaces using the concept of matrix-space lifting, a form of ampliation intermediate between those given by spacial and ultraweak tensor products. It is shown that these walks, after suitable scaling, converge in a strong sense to vacuum cocycles, certain vacuum-adapted processes which are Feller cocycles in the sense of Lindsay and Wills. This re...
متن کاملRandom Walk Approximation of Conndence Intervals
Construction of likelihood-based conndence intervals and regions is a computationally intensive task. In low dimensions (up to 2 or 3 parameters), an eeective method is to evaluate the likelihood over a dense grid. In higher dimensions proole-based methods (Bates and Watts, 1988) are eeective when it is practical to parametrize the model in terms of the quantities of interest, but it is diicult...
متن کاملA weighted random walk approximation to fractional Brownian motion
The purpose of this brief note is to describe a discrete approximation to fractional Brownian motion. The approximation works for all Hurst indices H , but take slightly different forms for H ≤ 1 2 and H > 1 2 . There are already several discrete approximations to fractional Brownian motion in the literature (see, e.g., [11], [1], [3], [10], [4], [2], [5], [8] for this and related topics), and ...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملTPA: Two Phase Approximation for Random Walk with Restart
Given a large graph, how can we determine similarity between nodes in a fast and accurate way? Random walk with restart (RWR) is a popular measure for this purpose and has been exploited in numerous data mining applications including ranking, anomaly detection, link prediction, and community detection. However, previous methods for computing exact RWR require prohibitive storage sizes and compu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2010
ISSN: 0024-6107
DOI: 10.1112/jlms/jdp075