First-passage times for non-Markovian processes

First-passage time statistics for non-Markovian processes have heretofore only been developed for processes driven by dichotomous fluctuations that are themselves Markov. Herein we develop a new method applicable to Markov and non-Markovian dichotomous fluctuations and calculate analytic mean first-passage times for particular examples.

First-passage times for non-Markovian processes: Correlated impacts on a free process

We develop a method to obtain first-passage-time statistics for non-Markovian processes driven by dichotomous fluctuations. The fluctuations themselves need not be Markovian. We calculate analytic first-passage-time distributions and mean first-passage times for exponential, rectangular, and long-tail temporal distributions of the fluctuations.

First-passage times for non-Markovian processes: Correlated impacts on bound processes

Our previously developed stochastic trajectory analysis technique has been applied to the calculation of first-passage time statistics of bound processes. Explicit results are obtained for linearly bound processes driven by dichotomous fluctuations having exponential and rectangular temporal distributions.

Bistability driven by Gaussian colored noise: First-passage times

Herein we present a calculation of the mean first-passage time for a bistable one-dimensional system driven by Gaussian colored noise of strength D and correlation time ¿c. We obtain quantitative agreement with experimental analog-computer simulations of this system. We disagree with some of the conclusions reached by previous investigators. In particular, we demonstrate that all available approximations that lead to a state-dependent diffusion coefficient lead to the same result for small D¿c.

First-passage times for non-Markovian processes: Shot noise

The stochastic-trajectory-analysis technique is applied to the calculation of the mean¿first-passage-time statistics for processes driven by external shot noise. Explicit analytical expressions are obtained for free and bound processes.

First-passage times for non-Markovian processes: Multivalued noise

A new method for the calculation of first-passage times for non-Markovian processes is presented. In addition to the general formalism, some familiar examples are worked out in detail.

Long-tailed trapping times and Lévy flights in a self-organized critical granular system

We present a continuous time random walk model for the scale-invariant transport found in a self-organized critical rice pile [K. Christensen et al., Phys. Rev. Lett. 77, 107 (1996)]. From our analytical results it is shown that the dynamics of the experiment can be explained in terms of Lvy flights for the grains and a long-tailed distribution of trapping times. Scaling relations for the exponents of these distributions are obtained. The predicted microscopic behavior is confirmed by means of a cellular automaton model.

Extreme times in financial markets.

We apply the theory of continuous time random walks (CTRWs) to study some aspects involving extreme events in financial time series. We focus our attention on the mean exit time (MET). We derive a general equation for this average and compare it with empirical results coming from high-frequency data of the U.S. dollar and Deutsche mark futures market. The empirical MET follows a quadratic law in the return length interval which is consistent with the CTRW formalism.

Mean first-passage times for systems driven by gamma and McFadden dichotomous noise

We consider mean first-passage times (MFPTs) for systems driven by non-Markov gamma and McFadden dichotomous noises. A simplified derivation is given of the underlying integral equations and the theory for ordinary renewal processes is extended to modified and equilibrium renewal processes. The exact results are compared with the MFPT for Markov dichotomous noise and with the results of Monte Carlo simulations.

Mean first-passage times for systems driven by equilibrium persistent-periodic dichotomous noise

In a recent paper, [J. M. Porrà, J. Masoliver, and K. Lindenberg, Phys. Rev. E 48, 951 (1993)], we derived the equations for the mean first-passage time for systems driven by the coin-toss square wave, a particular type of dichotomous noisy signal, to reach either one of two boundaries. The coin-toss square wave, which we here call periodic-persistent dichotomous noise, is a random signal that can only change its value at specified time points, where it changes its value with probability q or retains its previous value with probability p=1-q. These time points occur periodically at time intervals t. Here we consider the stationary version of this signal, that is, equilibrium periodic-persistent noise. We show that the mean first-passage time for systems driven by this stationary noise does not show either the discontinuities or the oscillations found in the case of nonstationary noise. We also discuss the existence of discontinuities in the mean first-passage time for random one-dimensional stochastic maps.

Extreme times for volatility processes

Extreme times techniques, generally applied to nonequilibrium statistical mechanical processes, are also useful for a better understanding of financial markets. We present a detailed study on the mean first-passage time for the volatility of return time series. The empirical results extracted from daily data of major indices seem to follow the same law regardless of the kind of index thus suggesting an universal pattern. The empirical mean first-passage time to a certain level L is fairly different from that of the Wiener process showing a dissimilar behavior depending on whether L is higher or lower than the average volatility. All of this indicates a more complex dynamics in which a reverting force drives volatility toward its mean value. We thus present the mean first-passage time expressions of the most common stochastic volatility models whose approach is comparable to the random diffusion description. We discuss asymptotic approximations of these models and confront them to empirical results with a good agreement with the exponential Ornstein-Uhlenbeck model.

Connections between signal processing and complex analysis

We describe one of the research lines of the Grup de Teoria de Funcions de la UAB UB, which deals with sampling and interpolation problems in signal analysis and their connections with complex function theory.

Time of ruin in a risk model with generalized Erlang (n) interclaim times and a constant dividend barrier

In this paper we analyze the time of ruin in a risk process with the interclaim times being Erlang(n) distributed and a constant dividend barrier. We obtain an integro-differential equation for the Laplace Transform of the time of ruin. Explicit solutions for the moments of the time of ruin are presented when the individual claim amounts have a distribution with rational Laplace transform. Finally, some numerical results and a compare son with the classical risk model, with interclaim times following an exponential distribution, are given.

A knowledge based signal processing approach to tonic identification in indian classical music

In this paper, we describe several techniques for detecting tonic pitch value in Indian classical music. In Indian music, the raga is the basic melodic framework and it is built on the tonic. Tonic detection is therefore fundamental for any melodic analysis in Indian classical music. This workexplores detection of tonic by processing the pitch histograms of Indian classic music. Processing of pitch histograms using group delay functions and its ability to amplify certain traits of Indian music in the pitch histogram, is discussed. Three different strategies to detect tonic, namely, the concert method, the template matching and segmented histogram method are proposed. The concert method exploits the fact that the tonic is constant over a piece/concert.templatematchingmethod and segmented histogrammethodsuse the properties: (i) the tonic is always present in the background, (ii) some notes are less inflected and dominant, to detect the tonic of individual pieces. All the three methods yield good results for Carnatic music (90−100% accuracy), while for Hindustanimusic, the templatemethod works best, provided the v¯adi samv¯adi notes for a given piece are known (85%).