نتایج جستجو برای: discrete random walk
تعداد نتایج: 451993 فیلتر نتایج به سال:
In this paper the numerical simulation of flow field in the new design dynamic cyclone separator is investigated. The effects of different geometrical parameters such as impeller diameter, number of vanes, length and the location of impeller is investigated. The Reynolds averaged Navier–Stokes equations with Reynolds stress turbulence model (RSM) were solved. The Eulerian-Lagrangian computation...
Since a limit distribution of a discrete-time quantum walk on the line was derived in 2002, a lot of limit theorems for quantum walks with a localized initial state have been reported. On the other hand, in quantum probability theory, there are four notions of independence (free, monotone, commuting, and boolean independence) and quantum central limit theorems associated to each independence ha...
The notion of a quantum random walk has emerged as an important element in the development of efficient quantum algorithms. In particular, it makes a dramatic appearance in the most efficient known algorithm for element distinctness [1]. The technique has also been applied to offer simple separations between quantum and classical query complexity [5]. The basic model has two natural variants, t...
The generalized excited random walk is a generalization of the excited random walk, introduced in 2003 by Benjamini and Wilson, which is a discrete-time stochastic process (Xn, n = 0, 1, 2, . . .) taking values on Z, d ≥ 2, described as follows: when the particle visits a site for the first time, it has a uniformly positive drift in a given direction l; when the particle is at a site which was ...
Lawler, Schramm and Werner showed that the scaling limit of the loop-erased random walk on Z2 is SLE2. We consider scaling limits of the loop-erasure of random walks on other planar graphs (graphs embedded into C so that edges do not cross one another). We show that if the scaling limit of the random walk is planar Brownian motion, then the scaling limit of its loop-erasure is SLE2. Our main co...
In the context of countable groups polynomial volume growth, we consider a large class random walks that are allowed to take long jumps along multiple subgroups according power law distributions. For such walk, study time behavior its probability return at n in terms key parameters describing driving measure and structure underlying group. We obtain assorted estimates including near-diagonal tw...
In this article, we deal with the local time of simple symmetric random walks which counts number times that walk goes between zero and one their excursions. First, by depicting typical sample paths time, give a visual proof discrete analogue Lévy’s theorem states relationship maximum walk. Second, excursions in case are introduced an example calculation some probability generating function usi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید