First-passage-time statistics for diffusion processes with an external random force

We present exact equations and expressions for the first-passage-time statistics of dynamical systems that are a combination of a diffusion process and a random external force modeled as dichotomous Markov noise. We prove that the mean first passage time for this system does not show any resonantlike behavior.

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.

Reply to "Comment on 'Solutions of the telegrapher's equation in the presence of traps'"

This reply adds a number of details to remarks by Foong and Kanno [preceding Comment, Phys. Rev. A 46, 5296 (1992)] on our paper [Phys. Rev. A 45, 2222 (1992)] regarding the discontinuities observed in the curves generated in that paper.

Exact solution to the exit-time problem for an undamped free particle driven by Gaussian white noise

In a recent paper [Phys. Rev. Lett. 75, 189 (1995)] we have presented the exact analytical expression for the mean exit time, T(x,v), of a free inertial process driven by Gaussian white noise out of a region (0,L) in space. In this paper we give a detailed account of the method employed and present results on asymptotic properties and averages of T(x,v).

Bistability driven by dichotomous noise: A comment

Two recently reported treatments [J. M. Porrà et al., Phys. Rev. A 44, 4866 (1991) and I. L¿Heureux and R. Kapral, J. Chem. Phys. 88, 7468 (1988)] of the problem of bistability driven by dichotomous colored noise with a small correlation time are brought into agreement with each other and with the exact numerical results of L¿Heureux and Kapral [J. Chem. Phys. 90, 2453 (1989)].

Statistics of depth probed by cw measurement of photons in a turbid medium

Photon migration in a turbid medium has been modeled in many different ways. The motivation for such modeling is based on technology that can be used to probe potentially diagnostic optical properties of biological tissue. Surprisingly, one of the more effective models is also one of the simplest. It is based on statistical properties of a nearest-neighbor lattice random walk. Here we develop a theory allowing one to calculate the number of visits by a photon to a given depth, if it is eventually detected at an absorbing surface. This mimics cw measurements made on biological tissue and is directed towards characterizing the depth reached by photons injected at the surface. Our development of the theory uses formalism based on the theory of a continuous-time random walk (CTRW). Formally exact results are given in the Fourier-Laplace domain, which, in turn, are used to generate approximations for parameters of physical interest.

Mean first-passage time for system driven by the coin-toss square wave

We study the mean-first-passage-time problem for systems driven by the coin-toss square-wave signal. Exact analytic solutions are obtained for the driftless case. We also obtain approximate solutions for the potential case. The mean-first-passage time exhibits discontinuities and a remarkable nonsmooth oscillatory behavior which, to our knowledge, has not been observed for other kinds of driving noise.

Generalized Langevin equations: Anomalous diffusion and probability distributions

We study the motion of a particle governed by a generalized Langevin equation. We show that, when no fluctuation-dissipation relation holds, the long-time behavior of the particle may be from stationary to superdiffusive, along with subdiffusive and diffusive. When the random force is Gaussian, we derive the exact equations for the joint and marginal probability density functions for the position and velocity of the particle and find their solutions.

When telegrapher's equation furnishes a better approximation to transport equation than the difussion approximation

It has been suggested that a solution to the transport equation which includes anisotropic scattering can be approximated by the solution to a telegrapher's equation [A.J. Ishimaru, Appl. Opt. 28, 2210 (1989)]. We show that in one dimension the telegrapher's equation furnishes an exact solution to the transport equation. In two dimensions, we show that, since the solution can become negative, the telegrapher's equation will not furnish a usable approximation. A comparison between simulated data in three dimensions indicates that the solution to the telegrapher's equation is a good approximation to that of the full transport equation at the times at which the diffusion equation furnishes an equally good approximation.

Generalization of the persistent random walk to dimensions greater than 1

We propose a generalization of the persistent random walk for dimensions greater than 1. Based on a cubic lattice, the model is suitable for an arbitrary dimension d. We study the continuum limit and obtain the equation satisfied by the probability density function for the position of the random walker. An exact solution is obtained for the projected motion along an axis. This solution, which is written in terms of the free-space solution of the one-dimensional telegraphers equation, may open a new way to address the problem of light propagation through thin slabs.

Regular population monotonic allocation schemes and the core

A subclass of games with population monotonic allocation schemes is studied, namelygames with regular population monotonic allocation schemes (rpmas). We focus on theproperties of these games and we prove the coincidence between the core and both theDavis-Maschler bargaining set and the Mas-Colell bargaining set

Sequential decisions in allocation problems

[eng] In the context of cooperative TU-games, and given an order of players, we consider the problem of distributing the worth of the grand coalition as a sequentia decision problem. In each step of process, upper and lower bounds for the payoff of the players are required related to successive reduced games. Sequentially compatible payoffs are defined as those allocation vectors that meet these recursive bounds. The core of the game is reinterpreted as a set of sequentally compatible payoffs when the Davis-Maschler reduced game is considered (Th.1). Independently of the reduction, the core turns out to be the intersections of the family of the sets of sequentially compatible payoffs corresponding to the different possible orderings (Th.2), so it is in some sense order-independent. Finally, we analyze advantagenous properties for the first player