Clustering in complex networks. II. Percolation properties

The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows us to find the critical threshold and the size of the giant component. Numerical simulations confirm the accuracy of our results. In more general terms, we show that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance. This is a direct consequence of the differences in the k-core structure of the networks, which are found to be totally different depending on the level of clustering. An empirical analysis of a real social network confirms our predictions.

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.

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.

Metastable liquid-liquid phase transition in a single-component system with only one crystal phase and no density anomaly

We investigate the phase behavior of a single-component system in three dimensions with spherically-symmetric, pairwise-additive, soft-core interactions with an attractive well at a long distance, a repulsive soft-core shoulder at an intermediate distance, and a hard-core repulsion at a short distance, similar to potentials used to describe liquid systems such as colloids, protein solutions, or liquid metals. We showed [Nature (London) 409, 692 (2001)] that, even with no evidence of the density anomaly, the phase diagram has two first-order fluid-fluid phase transitions, one ending in a gas¿low-density-liquid (LDL) critical point, and the other in a gas¿high-density-liquid (HDL) critical point, with a LDL-HDL phase transition at low temperatures. Here we use integral equation calculations to explore the three-parameter space of the soft-core potential and perform molecular dynamics simulations in the interesting region of parameters. For the equilibrium phase diagram, we analyze the structure of the crystal phase and find that, within the considered range of densities, the structure is independent of the density. Then, we analyze in detail the fluid metastable phases and, by explicit thermodynamic calculation in the supercooled phase, we show the absence of the density anomaly. We suggest that this absence is related to the presence of only one stable crystal structure.

Stochastic resonance in a suspension of magnetic dipoles under shear flow

We show that a magnetic dipole in a shear flow under the action of an oscillating magnetic field displays stochastic resonance in the linear response regime. To this end, we compute the classical quantifiers of stochastic resonance, i.e., the signal to noise ratio, the escape time distribution, and the mean first passage time. We also discuss the limitations and role of the linear response theory in its applications to the theory of stochastic resonance.

Noise and periodic modulations in neural excitable medium

We have analyzed the interplay between noise and periodic modulations in a mean field model of a neural excitable medium. For this purpose, we have considered two types of modulations, namely, variations of the resistance and oscillations of the threshold. In both cases, stochastic resonance is present, irrespective of whether the system is monostable or bistable.

Test of the fluctuation theorem for stochastic entropy production in a nonequilibrium steady state

We derive a simple closed analytical expression for the total entropy production along a single stochastic trajectory of a Brownian particle diffusing on a periodic potential under an external constant force. By numerical simulations we compute the probability distribution functions of the entropy and satisfactorily test many of the predictions based on Seiferts integral fluctuation theorem. The results presented for this simple model clearly illustrate the practical features and implications derived from such a result of nonequilibrium statistical mechanics.

Invaded cluster dynamics for frustrated models

The invaded cluster (IC) dynamics introduced by Machta et al. [Phys. Rev. Lett. 75, 2792 (1995)] is extended to the fully frustrated Ising model on a square lattice. The properties of the dynamics that exhibits numerical evidence of self-organized criticality are studied. The fluctuations in the IC dynamics are shown to be intrinsic of the algorithm and the fluctuation-dissipation theorem is no longer valid. The relaxation time is found to be very short and does not present a critical size dependence.

Difussion in a titled periodic potential: Enhancement, universality, and scaling

An exact analytical expression for the effective diffusion coefficient of an overdamped Brownian particle in a tilted periodic potential is derived for arbitrary potentials and arbitrary strengths of the thermal noise. Near the critical tilt (threshold of deterministic running solutions) a scaling behavior for weak thermal noise is revealed and various universality classes are identified. In comparison with the bare (potential-free) thermal diffusion, the effective diffusion coefficient in a critically tilted periodic potential may be, in principle, arbitrarily enhanced. For a realistic experimental setup, an enhancement by 14 orders of magnitude is predicted so that thermal diffusion should be observable on a macroscopic scale at room temperature.

Generation of uncorrelated random scale-free networks

Uncorrelated random scale-free networks are useful null models to check the accuracy and the analytical solutions of dynamical processes defined on complex networks. We propose and analyze a model capable of generating random uncorrelated scale-free networks with no multiple and self-connections. The model is based on the classical configuration model, with an additional restriction on the maximum possible degree of the vertices. We check numerically that the proposed model indeed generates scale-free networks with no two- and three-vertex correlations, as measured by the average degree of the nearest neighbors and the clustering coefficient of the vertices of degree k, respectively.