First-passage-time noninteger moments for some diffusion and dichotomous processes

We calculate noninteger moments ¿tq¿ of first passage time to trapping, at both ends of an interval (0,L), for some diffusion and dichotomous processes. We find the critical behavior of ¿tq¿, as a function of q, for free processes. We also show that the addition of a potential can destroy criticality.

Fractal dimension for Gaussian colored processes

The exact analytical expression for the Hausdorff dimension of free processes driven by Gaussian noise in n-dimensional space is obtained. The fractal dimension solely depends on the time behavior of the arbitrary correlation function of the noise, ranging from DX=1 for Orstein-Uhlenbeck input noise to any real number greater than 1 for fractional Brownian motions.

Generalized percolation in random directed networks

We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edgesthat is, edges pointing in both directions simultaneously. These two ingredients alter the previously known scenario and open new views and perspectives on percolation phenomena. Equations for the percolation threshold and the sizes of the giant components are derived in the most general case. We also present simulation results for a particular example of uncorrelated network with bidirectional edges confirming the theoretical predictions.

Continuous-time random-walk model for financial distributions

We apply the formalism of the continuous-time random walk to the study of financial data. The entire distribution of prices can be obtained once two auxiliary densities are known. These are the probability densities for the pausing time between successive jumps and the corresponding probability density for the magnitude of a jump. We have applied the formalism to data on the U.S. dollardeutsche mark future exchange, finding good agreement between theory and the observed data.

Tuning clustering in random networks with arbitrary degree distributions

We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and second the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.

Occupancy of a single site by many random walkers

We consider an infinite number of noninteracting lattice random walkers with the goal of determining statistical properties of the time, out of a total time T, that a single site has been occupied by n random walkers. Initially the random walkers are assumed uniformly distributed on the lattice except for the target site at the origin, which is unoccupied. The random-walk model is taken to be a continuous-time random walk and the pausing-time density at the target site is allowed to differ from the pausing-time density at other sites. We calculate the dependence of the mean time of occupancy by n random walkers as a function of n and the observation time T. We also find the variance for the cumulative time during which the site is unoccupied. The large-T behavior of the variance differs according as the random walk is transient or recurrent. It is shown that the variance is proportional to T at large T in three or more dimensions, it is proportional to T3/2 in one dimension and to TlnT in two dimensions.

Telegrapher's equation with variable propagation speeds

All derivations of the one-dimensional telegraphers equation, based on the persistent random walk model, assume a constant speed of signal propagation. We generalize here the model to allow for a variable propagation speed and study several limiting cases in detail. We also show the connections of this model with anomalous diffusion behavior and with inertial dichotomous processes.

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.

Random diffusion and leverage effect in financial markets

We prove that Brownian market models with random diffusion coefficients provide an exact measure of the leverage effect [J-P. Bouchaud et al., Phys. Rev. Lett. 87, 228701 (2001)]. This empirical fact asserts that past returns are anticorrelated with future diffusion coefficient. Several models with random diffusion have been suggested but without a quantitative study of the leverage effect. Our analysis lets us to fully estimate all parameters involved and allows a deeper study of correlated random diffusion models that may have practical implications for many aspects of financial markets.

Class of correlated random networks with hidden variables

We study a class of models of correlated random networks in which vertices are characterized by hidden variables controlling the establishment of edges between pairs of vertices. We find analytical expressions for the main topological properties of these models as a function of the distribution of hidden variables and the probability of connecting vertices. The expressions obtained are checked by means of numerical simulations in a particular example. The general model is extended to describe a practical algorithm to generate random networks with an a priori specified correlation structure. We also present an extension of the class, to map nonequilibrium growing networks to networks with hidden variables that represent the time at which each vertex was introduced in the system.

Exact long-time behavior of a network of oscillators under random fields

We present an exact solution for the order parameters that characterize the stationary behavior of a population of Kuramotos phase oscillators under random external fields [Y. Kuramoto, in International Symposium on Mathematical Problems in Theoretical Physics, Lecture Notes in Physics, Vol. 39 (Springer, Berlin, 1975), p. 420]. From these results it is possible to generate the phase diagram of models with an arbitrary distribution of random frequencies and random fields.

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.