نتایج جستجو برای: hitting function

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

1999
Peter Clote

In [20, 21], A. Šali, E. Shakhnovich and M. Karplus modeled protein folding using a 27-bead heteropolymer on a cubic lattice with normally distributed contact energies. Using a Monte-Carlo folding algorithm with a local move set between conformations, Šali et al. attempted to answer the Levinthal paradox [13] of how a protein can fold rapidly, i.e. within milliseconds to seconds, despite the ma...

2008
Frédéric Magniez Ashwin Nayak Peter C. Richter Miklos Santha

The hitting time of a classical random walk (Markov chain) is the time required to detect the presence of – or equivalently, to find – a marked state. The hitting time of a quantum walk is subtler to define; in particular, it is unknown whether the detection and finding problems have the same time complexity. In this paper we define new Monte Carlo type classical and quantum hitting times, and ...

Journal: :Youth & Society 2011

Journal: :American Journal of Clinical Pathology 2018

2011
Tamás Lengyel

We use only the classic basic ballot result and simple combinatorial arguments to derive the distributions of the first passage time and the number of visits in the usual random walk model. © 2011 Elsevier B.V. All rights reserved.

Journal: :SIAM J. Matrix Analysis Applications 2016
Rushabh Patel Andrea Carron Francesco Bullo

This work provides generalized notions and analysis methods for the hitting time of random walks on graphs. The hitting time, also known as the Kemeny constant or the mean first passage time, of a random walk is widely studied; however, only limited work is available for the multiple random walker scenario. In this work we provide a novel method for calculating the hitting time for a single ran...

2004
J.-R. Chazottes E. Ugalde Peter Kloeden E. UGALDE

Motivated by entropy estimation from chaotic time series, we provide a comprehensive analysis of hitting times of cylinder sets in the setting of Gibbsian sources. We prove two strong approximation results from which we easily deduce pointwise convergence to entropy, lognormal fluctuations, precise large deviation estimates and an explicit formula for the hitting-time multifractal spectrum. It ...

Journal: :Mathematics and Computers in Simulation 2017
Madalina Deaconu Samuel Herrmann Sylvain Maire

In this paper we introduce a new method for the simulation of the exit time and exit position of a δ-dimensional Brownian motion from a domain. The main interest of our method is that it avoids splitting time schemes as well as inversion of complicated series. The method, called walk on moving spheres algorithm, was first introduced for hitting times of Bessel processes. In this study this meth...

2004
Dogan Kesdogan Lexi Pimenidis

A passive attacker can compromise a generic anonymity protocol by applying the so called disclosure attack, i.e. a special traffic analysis attack. In this work we present a more efficient way to accomplish this goal, i.e. we need less observations by looking for unique minimal hitting sets. We call this the hitting set attack or just HS-attack. In general, solving the minimal hitting set probl...

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

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