Geometrical universality in vibrational dynamics

A good generalization of the Euclidean dimension to disordered systems and non crystalline structures is commonly required to be related to large scale geometry and it is expected to be independent of local geometrical modifications. The spectral dimension, defined according to the low frequency density of vibrational states, appears to be the best candidate as far as dynamical and thermodynamical properties are concerned. In this letter we give the rigorous analytical proof of its independence of finite scale geometry. We show that the spectral dimension is invariant under local rescaling of couplings and under addition of finite range couplings, or infinite range couplings decaying faster then a characteristic power law. We also prove that it is left unchanged by coarse graining transformations, which are the generalization to graphs and networks of the usual decimation on regular structures. A quite important consequence of all these properties is the possibility of dealing with simplified geometrical models with nearest-neighbors interactions to study the critical behavior of systems with geometrical disorder.Comment: Latex file, 1 figure (ps file) include

Generalization of the Peierls-Griffiths Theorem for the Ising Model on Graphs

We present a sufficient condition for the presence of spontaneous magnetization for the Ising model on a general graph, related to its long-range topology. Applying this condition we are able to prove the existence of a phase transition at temperature T > 0 on a wide class of general networks. The possibility of further extensions of our results is discussed.Comment: 15 pages, two figure

Slow Encounters of Particle Pairs in Branched Structures

On infinite homogeneous structures, two random walkers meet with certainty if and only if the structure is recurrent, i.e., a single random walker returns to its starting point with probability 1. However, on general inhomogeneous structures this property does not hold and, although a single random walker will certainly return to its starting point, two moving particles may never meet. This striking property has been shown to hold, for instance, on infinite combs. Due to the huge variety of natural phenomena which can be modeled in terms of encounters between two (or more) particles diffusing in comb-like structures, it is fundamental to investigate if and, if so, to what extent similar effects may take place in finite structures. By means of numerical simulations we evidence that, indeed, even on finite structures, the topological inhomogeneity can qualitatively affect the two-particle problem. In particular, the mean encounter time can be polynomially larger than the time expected from the related one particle problem.Comment: 8 pages, 12 figures; accepted for publication in Physical Review

An energy window study of light transmission-disorder relationship in 1D photonic structures

While the light transmission of photonic crystals is characterized by the photonic band gap, the one of disordered photonic structures is typified by a multiplicity of transmission depths. The total transmission over a range of wavelengths is related to the width of such range, but also to the type of disorder. Less homogeneous disordered structures transmit more light than the ordered counterpart regardless of the wavelengths range width. More homogeneous disordered structures transmit more light than the ordered counterpart only above a certain value of the width. We studied this behaviour with a statistical analysis over 5000 permutations of structures for each wavelength width and for each homogeneity degree (Shannon-Wiener index).Comment: 8 pages, 4 figure

Efficiency of attack strategies on complex model and real-world networks

We investigated the efficiency of attack strategies to network nodes when targeting several complex model and real-world networks. We tested 5 attack strategies, 3 of which were introduced in this work for the first time, to attack 3 model (Erdos and Renyi, Barabasi and Albert preferential attachment network, and scale-free network configuration models) and 3 real networks (Gnutella peer-to-peer network, email network of the University of Rovira i Virgili, and immunoglobulin interaction network). Nodes were removed sequentially according to the importance criterion defined by the attack strategy. We used the size of the largest connected component (LCC) as a measure of network damage. We found that the efficiency of attack strategies (fraction of nodes to be deleted for a given reduction of LCC size) depends on the topology of the network, although attacks based on the number of connections of a node and betweenness centrality were often the most efficient strategies. Sequential deletion of nodes in decreasing order of betweenness centrality was the most efficient attack strategy when targeting real-world networks. In particular for networks with power-law degree distribution, we observed that most efficient strategy change during the sequential removal of nodes.Comment: 18 pages, 4 figure

New Betweenness Centrality Node Attack Strategies for Real-World Complex Weighted Networks

In this work, we introduce a new node attack strategy removing nodes with the highest conditional weighted betweenness centrality (CondWBet), which combines the weighted structure of the network and the node's conditional betweenness. We compare its efficacy with well-known attack strategies from literature over five real-world complex weighted networks. We use the network weighted efficiency (WEFF) like a measure encompassing the weighted structure of the network, in addition to the commonly used binary-topological measure, i.e., the largest connected cluster (LCC). We find that if the measure is WEFF, the CondWBet strategy is the best to decrease WEFF in 3 out of 5 cases. Further, CondWBet is the most effective strategy to reduce WEFF at the beginning of the removal process, whereas the Strength that removes nodes with the highest sum of the link weights first shows the highest efficacy in the final phase of the removal process when the network is broken into many small clusters. These last outcomes would suggest that a better attacking in weighted networks strategy could be a combination of the CondWBet and Strength strategies