A property of random walks on a cycle graph

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collisions Among Random Walks on a Graph

17 There is one further consideration, which leads perhaps to the most intriguing conjecture of all. Let us put two tokens on a graph and let them take random walks, as before; but now suppose the schedule demon is clairvoyant|that is, he can see where each token will go, innnitely far into the future. The question is, with this advantage, can he now keep the tokens apart forever ? Of course we...

متن کامل

Restricted random walks on a graph

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the number of n-step walks with r reversal steps for walks on any graph. In the case of graphs of a uniform valence, we show that our result has a probabilistic mean...

متن کامل

Quantum walks of interacting fermions on a cycle graph

Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel bet...

متن کامل

Mixing of Random Walks and Other Diiusions on a Graph

We survey results on two diiusion processes on graphs: random walks and chip-ring (closely related to the \abelian sandpile" or \avalanche" model of self-organized criticality in statistical mechanics). Many tools in the study of these processes are common, and results on one can be used to obtain results on the other. We survey some classical tools in the study of mixing properties of random w...

متن کامل

Mixing of Random Walks and Other Diffusions on a Graph

We survey results on two diffusion processes on graphs: random walks and chip-firing (closely related to the “abelian sandpile” or “avalanche” model of self-organized criticality in statistical mechanics). Many tools in the study of these processes are common, and results on one can be used to obtain results on the other. We survey some classical tools in the study of mixing properties of rando...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics for Industry

سال: 2015

ISSN: 2198-4115

DOI: 10.1186/s40736-015-0015-3