نتایج جستجو برای: lamplighter random walk

تعداد نتایج: 303163  

2007
Tomomichi Nakamura Michael Small

We describe a method for identifying random walks. This method is based on the previously proposed small shuffle surrogate method. Hence, our method does not depend on the specific data distribution, although previously proposed methods depend on properties of the data distribution. The method is demonstrated for numerical data generated by known systems, and applied to several actual time seri...

2009
Ilya Safro Paul D. Hovland Jaewook Shin Michelle Mills Strout

Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented to exploit data locality for improving the cache performance. In this research, we demonstrate how different one-dimensional data reordering functionals can be used as a preprocessing step for speeding the random walk ...

2007
E. Bacry J. F. Muzy

We introduce a class of multifractal processes, referred to as Multifractal Random Walks (MRWs). To our knowledge, it is the first multifractal processes with continuous dilation invariance properties and stationary increments. MRWs are very attractive alternative processes to classical cascade-like multifractal models since they do not involve any particular scale ratio. The MRWs are indexed b...

Journal: :Combinatorics, Probability & Computing 2014
Tal Orenshtein Igor Shinkar

We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not been crossed yet by the walker. At each step, the walker being at some vertex, picks an adjacent edge among the edges that have not traversed thus far accor...

2009
Jonathan M. Borwein Dirk Nuyens Armin Straub James Wan

We study the expected distance of a two-dimensional walk in the plane with unit steps in random directions. A series evaluation and recursions are obtained making it possible to explicitly formulate this distance for small number of steps. Closed form expressions for all the moments of a 2-step and a 3-step walk are given, and a formula is conjectured for the 4-step walk. Heavy use is made of t...

2004
Gregory F. Lawler José A. Trujillo Ferreras

The Brownian loop soup introduced in [3] is a Poissonian realization from a σ-finite measure on unrooted loops. This measure satisfies both conformal invariance and a restriction property. In this paper, we define a random walk loop soup and show that it converges to the Brownian loop soup. In fact, we give a strong approximation result making use of the strong approximation result of Komlós, M...

in this paper we focus on the tracking performance of incremental adaptive LMS algorithm in an adaptive network. For this reason we consider the unknown weight vector to be a time varying sequence. First we analyze the performance of network in tracking a time varying weight vector and then we explain the estimation of Rayleigh fading channel through a random walk model. Closed form relations a...

Impairments in cell migration processes may cause various diseases, among which cancer cell metastasis, tumor angiogenesis, and the disability of immune cells to infiltrate into tumors are prominent ones. Mathematical modeling has been widely used to analyze the cell migration process. Cell migration is a complicated process and requires statistical methods such as random walk for proper analys...

2009
SONGZI DU Songzi Du

In this paper I work out the rate of convergence of a non-symmetric random walk on the dicyclic group (Dicn) and that of its symmetric analogue on the same group. The analysis is via group representation techniques from Diaconis (1988) and closely follows the analysis of random walk on cyclic group in Chapter 3C of Diaconis. I find that while the mixing times (the time for the random walk to ge...

2004
MURRAY ELDER JENNIFER TABACK

We study languages of geodesics in lamplighter groups and Thompson’s group F . We show that the lamplighter groups Ln have infinitely many cone types, have no regular geodesic languages, and have 1-counter, context-free and counter geodesic languages with respect to certain generating sets. We show that the full language of geodesics with respect to one generating set for the lamplighter group ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید