On the Tomography of Networks and Multicast Trees

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

MEDUSA - New Model of Internet Topology Using k-shell Decomposition

The k-shell decomposition of a random graph provides a different and more insightful separation of the roles of the different nodes in such a graph than does the usual analysis in terms of node degrees. We develop this approach in order to analyze the Internet's structure at a coarse level, that of the "Autonomous Systems" or ASes, the subnetworks out of which the Internet is assembled. We employ new data from DIMES (see http://www.netdimes.org), a distributed agent-based mapping effort which at present has attracted over 3800 volunteers running more than 7300 DIMES clients in over 85 countries. We combine this data with the AS graph information available from the RouteViews project at Univ. Oregon, and have obtained an Internet map with far more detail than any previous effort. The data suggests a new picture of the AS-graph structure, which distinguishes a relatively large, redundantly connected core of nearly 100 ASes and two components that flow data in and out from this core. One component is fractally interconnected through peer links; the second makes direct connections to the core only. The model which results has superficial similarities with and important differences from the "Jellyfish" structure proposed by Tauro et al., so we call it a "Medusa." We plan to use this picture as a framework for measuring and extrapolating changes in the Internet's physical structure. Our k-shell analysis may also be relevant for estimating the function of nodes in the "scale-free" graphs extracted from other naturally-occurring processes.Comment: 24 pages, 17 figure

In-Medium Similarity Renormalization Group with Chiral Two- Plus Three-Nucleon Interactions

We use the recently proposed In-Medium Similarity Renormalization Group (IM-SRG) to carry out a systematic study of closed-shell nuclei up to \nuc{Ni}{56}, based on chiral two- plus three-nucleon interactions. We analyze the capabilities of the IM-SRG by comparing our results for the ground-state energy to Coupled Cluster calculations, as well as to quasi-exact results from the Importance-Truncated No-Core Shell Model. Using chiral two- plus three-nucleon Hamiltonians whose resolution scales are lowered by free-space SRG evolution, we obtain good agreement with experimental binding energies in \nuc{He}{4} and the closed-shell oxygen isotopes, while the calcium and nickel isotopes are somewhat overbound.Comment: 11 pages, 7 figures, submitted to Phys. Rev.

Benchmarking the Variational Reduced Density Matrix Theory in the Doubly Occupied Configuration Interaction Space with Integrable Pairing Models

The variational reduced density matrix theory has been recently applied with great success to models within the truncated doubly occupied configuration interaction space, which corresponds to the seniority zero subspace. Conservation of the seniority quantum number restricts the Hamiltonians to be based on the SU(2) algebra. Among them there is a whole family of exactly solvable Richardson-Gaudin pairing Hamiltonians. We benchmark the variational theory against two different exactly solvable models, the Richardson-Gaudin-Kitaev and the reduced BCS Hamiltonians. We obtain exact numerical results for the so-called PQGT N-representability conditions in both cases for systems that go from 10 to 100 particles. However, when random single-particle energies as appropriate for small superconducting grains are considered, the exactness is lost but still a high accuracy is obtained.Fil: Rubio García, A.. Instituto de Estructura de la Materia; España. Consejo Superior de Investigaciones Científicas; EspañaFil: Alcoba, Diego Ricardo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Física de Buenos Aires. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Física de Buenos Aires; ArgentinaFil: Capuzzi, Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Física de Buenos Aires. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Física de Buenos Aires; ArgentinaFil: Dukelsky, J.. Consejo Superior de Investigaciones Científicas; España. Instituto de Estructura de la Materia; Españ

Sustaining the Internet with Hyperbolic Mapping

The Internet infrastructure is severely stressed. Rapidly growing overheads associated with the primary function of the Internet---routing information packets between any two computers in the world---cause concerns among Internet experts that the existing Internet routing architecture may not sustain even another decade. Here we present a method to map the Internet to a hyperbolic space. Guided with the constructed map, which we release with this paper, Internet routing exhibits scaling properties close to theoretically best possible, thus resolving serious scaling limitations that the Internet faces today. Besides this immediate practical viability, our network mapping method can provide a different perspective on the community structure in complex networks

Method For Making 2-Electron Response Reduced Density Matrices Approximately N-representable

In methods like geminal-based approaches or coupled cluster that are solved using the projected Schr\"odinger equation, direct computation of the 2-electron reduced density matrix (2-RDM) is impractical and one falls back to a 2-RDM based on response theory. However, the 2-RDMs from response theory are not $N$-representable. That is, the response 2-RDM does not correspond to an actual physical $N$-electron wave function. We present a new algorithm for making these non-$N$-representable 2-RDMs approximately $N$-representable, i.e. it has the right symmetry and normalization and it fulfills the $P$-, $Q$- and $G$-conditions. Next to an algorithm which can be applied to any 2-RDM, we have also developed a 2-RDM optimization procedure specifically for seniority-zero 2-RDMs. We aim to find the 2-RDM with the right properties that is the closest (in the sense of the Frobenius norm) to the non-N-representable 2-RDM by minimizing the square norm of the difference between the initial 2-RDM and the targeted 2-RDM under the constraint that the trace is normalized and the 2-RDM, $Q$- and $G$-matrices are positive semidefinite, i.e. their eigenvalues are non-negative. Our method is suitable for fixing non-N-respresentable 2-RDMs which are close to being N-representable. Through the N-representability optimization algorithm we add a small correction to the initial 2-RDM such that it fulfills the most important N-representability conditions.Comment: 13 pages, 8 figure

Molecular Model of Dynamic Social Network Based on E-mail communication

In this work we consider an application of physically inspired sociodynamical model to the modelling of the evolution of email-based social network. Contrary to the standard approach of sociodynamics, which assumes expressing of system dynamics with heuristically defined simple rules, we postulate the inference of these rules from the real data and their application within a dynamic molecular model. We present how to embed the n-dimensional social space in Euclidean one. Then, inspired by the Lennard-Jones potential, we define a data-driven social potential function and apply the resultant force to a real e-mail communication network in a course of a molecular simulation, with network nodes taking on the role of interacting particles. We discuss all steps of the modelling process, from data preparation, through embedding and the molecular simulation itself, to transformation from the embedding space back to a graph structure. The conclusions, drawn from examining the resultant networks in stable, minimum-energy states, emphasize the role of the embedding process projecting the non–metric social graph into the Euclidean space, the significance of the unavoidable loss of information connected with this procedure and the resultant preservation of global rather than local properties of the initial network. We also argue applicability of our method to some classes of problems, while also signalling the areas which require further research in order to expand this applicability domain

Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries

We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering, distributed computation of trust and reputation, monitoring and other tasks, where the computing nodes is expected to preserve the privacy of their inputs while performing a joint computation of a certain function. Although there is a rich literature in the field of distributed systems security concerning secure multi-party computation, in practice it is hard to deploy those methods in very large scale Peer-to-Peer networks. In this work, we try to bridge the gap between theoretical algorithms in the security domain, and a practical Peer-to-Peer deployment. We consider two security models. The first is the semi-honest model where peers correctly follow the protocol, but try to reveal private information. We provide three possible schemes for secure multi-party numerical computation for this model and identify a single light-weight scheme which outperforms the others. Using extensive simulation results over real Internet topologies, we demonstrate that our scheme is scalable to very large networks, with up to millions of nodes. The second model we consider is the malicious peers model, where peers can behave arbitrarily, deliberately trying to affect the results of the computation as well as compromising the privacy of other peers. For this model we provide a fourth scheme to defend the execution of the computation against the malicious peers. The proposed scheme has a higher complexity relative to the semi-honest model. Overall, we provide the Peer-to-Peer network designer a set of tools to choose from, based on the desired level of security.Comment: Submitted to Peer-to-Peer Networking and Applications Journal (PPNA) 200

Diagonalization of multicomponent wave equations with a Born-Oppenheimer example

A general method to decouple multicomponent linear wave equations is presented. First, the Weyl calculus is used to transform operator relations into relations between c-number valued matrices. Then it is shown that the symbol representing the wave operator can be diagonalized systematically up to arbitrary order in an appropriate expansion parameter. After transforming the symbols back to operators, the original problem is reduced to solving a set of linear uncoupled scalar wave equations. The procedure is exemplified for a particle with a Born-Oppenheimer-type Hamiltonian valid through second order in h. The resulting effective scalar Hamiltonians are seen to contain an additional velocity-dependent potential. This contribution has not been reported in recent studies investigating the adiabatic motion of a neutral particle moving in an inhomogeneous magnetic field. Finally, the relation of the general method to standard quantum-mechanical perturbation theory is discussed

Variational Hilbert space truncation approach to quantum Heisenberg antiferromagnets on frustrated clusters

We study the spin-$\frac{1}{2}$ Heisenberg antiferromagnet on a series of finite-size clusters with features inspired by the fullerenes. Frustration due to the presence of pentagonal rings makes such structures challenging in the context of quantum Monte-Carlo methods. We use an exact diagonalization approach combined with a truncation method in which only the most important basis states of the Hilbert space are retained. We describe an efficient variational method for finding an optimal truncation of a given size which minimizes the error in the ground state energy. Ground state energies and spin-spin correlations are obtained for clusters with up to thirty-two sites without the need to restrict the symmetry of the structures. The results are compared to full-space calculations and to unfrustrated structures based on the honeycomb lattice.Comment: 22 pages and 12 Postscript figure