869 research outputs found

    Meissner response of a bulk superconductor with an embedded sheet of reduced penetration depth

    Full text link
    We calculate the change in susceptibility resulting from a thin sheet with reduced penetration depth embedded perpendicular to the surface of an isotropic superconductor, in a geometry applicable to scanning Superconducting QUantum Interference Device (SQUID) microscopy, by numerically solving Maxwell's and London's equations using the finite element method. The predicted stripes in susceptibility agree well in shape with the observations of Kalisky et al. of enhanced susceptibility above twin planes in the underdoped pnictide superconductor Ba(Fe1-xCox)2As2 (Ba-122). By comparing the predicted stripe amplitudes with experiment and using the London relation between penetration depth and superfluid density, we estimate the enhanced Cooper pair density on the twin planes, and the barrier force for a vortex to cross a twin plane. Fits to the observed temperature dependence of the stripe amplitude suggest that the twin planes have a higher critical temperature than the bulk, although stripes are not observed above the bulk critical temperature.Comment: 16 pages, 9 figure

    Localization transition on complex networks via spectral statistics

    Full text link
    The spectral statistics of complex networks are numerically studied. The features of the Anderson metal-insulator transition are found to be similar for a wide range of different networks. A metal-insulator transition as a function of the disorder can be observed for different classes of complex networks for which the average connectivity is small. The critical index of the transition corresponds to the mean field expectation. When the connectivity is higher, the amount of disorder needed to reach a certain degree of localization is proportional to the average connectivity, though a precise transition cannot be identified. The absence of a clear transition at high connectivity is probably due to the very compact structure of the highly connected networks, resulting in a small diameter even for a large number of sites.Comment: 6 pages, expanded introduction and referencess (to appear in PRE

    On the Tomography of Networks and Multicast Trees

    Full text link
    In this paper we model the tomography of scale free networks by studying the structure of layers around an arbitrary network node. We find, both analytically and empirically, that the distance distribution of all nodes from a specific network node consists of two regimes. The first is characterized by rapid growth, and the second decays exponentially. We also show that the nodes degree distribution at each layer is a power law with an exponential cut-off. We obtain similar results for the layers surrounding the root of multicast trees cut from such networks, as well as the Internet. All of our results were obtained both analytically and on empirical Interenet data

    Width of percolation transition in complex networks

    Full text link
    It is known that the critical probability for the percolation transition is not a sharp threshold, actually it is a region of non-zero width Δpc\Delta p_c for systems of finite size. Here we present evidence that for complex networks Δpcpcl\Delta p_c \sim \frac{p_c}{l}, where lNνoptl \sim N^{\nu_{opt}} is the average length of the percolation cluster, and NN is the number of nodes in the network. For Erd\H{o}s-R\'enyi (ER) graphs νopt=1/3\nu_{opt} = 1/3, while for scale-free (SF) networks with a degree distribution P(k)kλP(k) \sim k^{-\lambda} and 3<λ<43<\lambda<4, νopt=(λ3)/(λ1)\nu_{opt} = (\lambda-3)/(\lambda-1). We show analytically and numerically that the \textit{survivability} S(p,l)S(p,l), which is the probability of a cluster to survive ll chemical shells at probability pp, behaves near criticality as S(p,l)=S(pc,l)exp[(ppc)l/pc]S(p,l) = S(p_c,l) \cdot exp[(p-p_c)l/p_c]. Thus for probabilities inside the region ppc<pc/l|p-p_c| < p_c/l the behavior of the system is indistinguishable from that of the critical point

    Dynamic Exploration of Networks: from general principles to the traceroute process

    Full text link
    Dynamical processes taking place on real networks define on them evolving subnetworks whose topology is not necessarily the same of the underlying one. We investigate the problem of determining the emerging degree distribution, focusing on a class of tree-like processes, such as those used to explore the Internet's topology. A general theory based on mean-field arguments is proposed, both for single-source and multiple-source cases, and applied to the specific example of the traceroute exploration of networks. Our results provide a qualitative improvement in the understanding of dynamical sampling and of the interplay between dynamics and topology in large networks like the Internet.Comment: 13 pages, 6 figure

    Appropriateness of correlated first order auto-regressive processes for modeling daily temperature records

    Full text link
    The present study investigates linear and volatile (nonlinear) correlations of first-order autoregressive process with uncorrelated AR (1) and long-range correlated CAR (1) Gaussian innovations as a function of the process parameter (θ\theta). In the light of recent findings \cite{jano}, we discuss the choice of CAR (1) in modeling daily temperature records. We demonstrate that while CAR (1) is able to capture linear correlations it is unable to capture nonlinear (volatile) correlations in daily temperature records.Comment: Accepted for publication in Physica

    Volatility of Linear and Nonlinear Time Series

    Full text link
    Previous studies indicate that nonlinear properties of Gaussian time series with long-range correlations, uiu_i, can be detected and quantified by studying the correlations in the magnitude series ui|u_i|, i.e., the ``volatility''. However, the origin for this empirical observation still remains unclear, and the exact relation between the correlations in uiu_i and the correlations in ui|u_i| is still unknown. Here we find analytical relations between the scaling exponent of linear series uiu_i and its magnitude series ui|u_i|. Moreover, we find that nonlinear time series exhibit stronger (or the same) correlations in the magnitude time series compared to linear time series with the same two-point correlations. Based on these results we propose a simple model that generates multifractal time series by explicitly inserting long range correlations in the magnitude series; the nonlinear multifractal time series is generated by multiplying a long-range correlated time series (that represents the magnitude series) with uncorrelated time series [that represents the sign series sgn(ui)sgn(u_i)]. Our results of magnitude series correlations may help to identify linear and nonlinear processes in experimental records.Comment: 7 pages, 5 figure

    Effect of Disorder Strength on Optimal Paths in Complex Networks

    Full text link
    We study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path opt\ell_{\rm opt} in a disordered Erd\H{o}s-R\'enyi (ER) random network and scale-free (SF) network. Each link ii is associated with a weight τiexp(ari)\tau_i\equiv\exp(a r_i), where rir_i is a random number taken from a uniform distribution between 0 and 1 and the parameter aa controls the strength of the disorder. We find that for any finite aa, there is a crossover network size N(a)N^*(a) at which the transition occurs. For NN(a)N \ll N^*(a) the scaling behavior of opt\ell_{\rm opt} is in the strong disorder regime, with optN1/3\ell_{\rm opt} \sim N^{1/3} for ER networks and for SF networks with λ4\lambda \ge 4, and optN(λ3)/(λ1)\ell_{\rm opt} \sim N^{(\lambda-3)/(\lambda-1)} for SF networks with 3<λ<43 < \lambda < 4. For NN(a)N \gg N^*(a) the scaling behavior is in the weak disorder regime, with optlnN\ell_{\rm opt}\sim\ln N for ER networks and SF networks with λ>3\lambda > 3. In order to study the transition we propose a measure which indicates how close or far the disordered network is from the limit of strong disorder. We propose a scaling ansatz for this measure and demonstrate its validity. We proceed to derive the scaling relation between N(a)N^*(a) and aa. We find that N(a)a3N^*(a)\sim a^3 for ER networks and for SF networks with λ4\lambda\ge 4, and N(a)a(λ1)/(λ3)N^*(a)\sim a^{(\lambda-1)/(\lambda-3)} for SF networks with 3<λ<43 < \lambda < 4.Comment: 6 pages, 6 figures. submitted to Phys. Rev.
    corecore