22,085 research outputs found

    Clustering and preferential attachment in growing networks

    Get PDF
    We study empirically the time evolution of scientific collaboration networks in physics and biology. In these networks, two scientists are considered connected if they have coauthored one or more papers together. We show that the probability of scientists collaborating increases with the number of other collaborators they have in common, and that the probability of a particular scientist acquiring new collaborators increases with the number of his or her past collaborators. These results provide experimental evidence in favor of previously conjectured mechanisms for clustering and power-law degree distributions in networks.Comment: 13 pages, 2 figure

    Characterizing the structure of small-world networks

    Full text link
    We give exact relations which are valid for small-world networks (SWN's) with a general `degree distribution', i.e the distribution of nearest-neighbor connections. For the original SWN model, we illustrate how these exact relations can be used to obtain approximations for the corresponding basic probability distribution. In the limit of large system sizes and small disorder, we use numerical studies to obtain a functional fit for this distribution. Finally, we obtain the scaling properties for the mean-square displacement of a random walker, which are determined by the scaling behavior of the underlying SWN

    Canonical General Relativity on a Null Surface with Coordinate and Gauge Fixing

    Get PDF
    We use the canonical formalism developed together with David Robinson to st= udy the Einstein equations on a null surface. Coordinate and gauge conditions = are introduced to fix the triad and the coordinates on the null surface. Toget= her with the previously found constraints, these form a sufficient number of second class constraints so that the phase space is reduced to one pair of canonically conjugate variables: \Ac_2\and\Sc^2. The formalism is related to both the Bondi-Sachs and the Newman-Penrose methods of studying the gravitational field at null infinity. Asymptotic solutions in the vicinity of null infinity which exclude logarithmic behavior require the connection to fall off like 1/r31/r^3 after the Minkowski limit. This, of course, gives the previous results of Bondi-Sachs and Newman-Penrose. Introducing terms which fall off more slowly leads to logarithmic behavior which leaves null infinity intact, allows for meaningful gravitational radiation, but the peeling theorem does not extend to Ψ1\Psi_1 in the terminology of Newman-Penrose. The conclusions are in agreement with those of Chrusciel, MacCallum, and Singleton. This work was begun as a preliminary study of a reduced phase space for quantization of general relativity.Comment: magnification set; pagination improved; 20 pages, plain te

    CR Structures and Asymptotically Flat Space-Times

    Full text link
    We discuss the unique existence, arising by analogy to that in algebraically special space-times, of a CR structure realized on null infinity for any asymptotically flat Einstein or Einstein-Maxwell space-time.Comment: 6 page

    Numerical simulation study of the dynamical behavior of the Niedermayer algorithm

    Full text link
    We calculate the dynamic critical exponent for the Niedermayer algorithm applied to the two-dimensional Ising and XY models, for various values of the free parameter E0E_0. For E0=1E_0=-1 we regain the Metropolis algorithm and for E0=1E_0=1 we regain the Wolff algorithm. For 1<E0<1-1<E_0<1, we show that the mean size of the clusters of (possibly) turned spins initially grows with the linear size of the lattice, LL, but eventually saturates at a given lattice size L~\widetilde{L}, which depends on E0E_0. For L>L~L>\widetilde{L}, the Niedermayer algorithm is equivalent to the Metropolis one, i.e, they have the same dynamic exponent. For E0>1E_0>1, the autocorrelation time is always greater than for E0=1E_0=1 (Wolff) and, more important, it also grows faster than a power of LL. Therefore, we show that the best choice of cluster algorithm is the Wolff one, when compared to the Nierdermayer generalization. We also obtain the dynamic behavior of the Wolff algorithm: although not conclusive, we propose a scaling law for the dependence of the autocorrelation time on LL.Comment: Accepted for publication in Journal of Statistical Mechanics: Theory and Experimen

    Behaviour of spin-1/2 particle around a charged black hole

    Full text link
    Dirac equation is separable in curved space-time and its solution was found for both spherically and axially symmetric geometry. But most of the works were done without considering the charge of the black hole. Here we consider the spherically symmetric charged black hole background namely Reissner-Nordstrom black hole. Due to presence of the charge of black-hole charge-charge interaction will be important for the cases of incoming charged particle (e.g. electron, proton etc.). Therefore both gravitational and electromagnetic gauge fields should be introduced. Naturally behaviour of the particle will be changed from that in Schwarzschild geometry. We compare both the solutions. In the case of Reissner-Nordstrom black hole there is a possibility of super-radiance unlike Schwarzschild case. We also check this branch of the solution.Comment: 8 Latex pages and 4 Figures; RevTex.style; Accepted for Publication in Classical and Quantum Gravit

    Fast algorithm for detecting community structure in networks

    Full text link
    It has been found that many networks display community structure -- groups of vertices within which connections are dense but between which they are sparser -- and highly sensitive computer algorithms have in recent years been developed for detecting such structure. These algorithms however are computationally demanding, which limits their application to small networks. Here we describe a new algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster than previous algorithms. We give several example applications, including one to a collaboration network of more than 50000 physicists.Comment: 5 pages, 4 figure

    Thermodynamics of spin systems on small-world hypergraphs

    Full text link
    We study the thermodynamic properties of spin systems on small-world hypergraphs, obtained by superimposing sparse Poisson random graphs with p-spin interactions onto a one-dimensional Ising chain with nearest-neighbor interactions. We use replica-symmetric transfer-matrix techniques to derive a set of fixed-point equations describing the relevant order parameters and free energy, and solve them employing population dynamics. In the special case where the number of connections per site is of the order of the system size we are able to solve the model analytically. In the more general case where the number of connections is finite we determine the static and dynamic ferromagnetic-paramagnetic transitions using population dynamics. The results are tested against Monte-Carlo simulations.Comment: 14 pages, 7 figures; Added 2 figures. Extended result

    Magnetic properties and critical behavior of disordered Fe_{1-x}Ru_x alloys: a Monte Carlo approach

    Full text link
    We study the critical behavior of a quenched random-exchange Ising model with competing interactions on a bcc lattice. This model was introduced in the study of the magnetic behavior of Fe_{1-x}Ru_x alloys for ruthenium concentrations x=0%, x=4%, x=6%, and x=8%. Our study is carried out within a Monte Carlo approach, with the aid of a re-weighting multiple histogram technique. By means of a finite-size scaling analysis of several thermodynamic quantities, taking into account up to the leading irrelevant scaling field term, we find estimates of the critical exponents \alpha, \beta, \gamma, and \nu, and of the critical temperatures of the model. Our results for x=0% are in excellent agreement with those for the three-dimensional pure Ising model in the literature. We also show that our critical exponent estimates for the disordered cases are consistent with those reported for the transition line between paramagnetic and ferromagnetic phases of both randomly dilute and ±J\pm J Ising models. We compare the behavior of the magnetization as a function of temperature with that obtained by Paduani and Branco (2008), qualitatively confirming the mean-field result. However, the comparison of the critical temperatures obtained in this work with experimental measurements suggest that the model (initially obtained in a mean-field approach) needs to be modified
    corecore