Random walk through fractal environments

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

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Random walk through fractal environments.

We analyze random walk through fractal environments, embedded in three-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight increments (i.e., of the displacements between two consecutive hittings) is analytically derived from a common, practical definition of fractal dimension, an...

متن کامل

Reflecting Random Walk in Fractal Domains

In this paper, we show that reflecting Brownian motion in any bounded domain D can be approximated, as k → ∞, by simple random walks on “maximal connected” subsets of (2−kZd) ∩D whose filled-in interiors are inside D.

متن کامل

Random walk in random and non-random environments

Reading is a hobby to open the knowledge windows. Besides, it can provide the inspiration and spirit to face this life. By this way, concomitant with the technology development, many companies serve the e-book or book in soft file. The system of this book of course will be much easier. No worry to forget bringing the random walk in random and non random environments book. You can open the devic...

متن کامل

A Random Walk through Eigenspace

It has been over a decade since the “Eigenfaces” approach to automatic face recognition, and other appearancebased methods, made an impression on the computer vision research community and helped spur interest in vision systems being used to support biometrics and human-computer interface. In this paper I give a personal view of the original motivation for the work, some of the strengths and li...

متن کامل

Balanced Allocation Through Random Walk

We consider the allocation problem in which $m \leq (1-\ve) dn $ items are to be allocated to $n$ bins with capacity $d$. The items $x_1,x_2,\ldots,x_m$ arrive sequentially and when item $x_i$ arrives it is given two possible bin locations $p_i=h_1(x_i),q_i=h_2(x_i)$ via hash functions $h_1,h_2$. We consider a random walk procedure for inserting items and show that the expected time insertion t...

متن کامل

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


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

ژورنال

عنوان ژورنال: Physical Review E

سال: 2003

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.67.026413