Small-World Human Brain Networks Perspectives and Challenges
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Network Science
This is a preprint of Katy Börner, Soma Sanyal and Alessandro Vespignani (2007) Network Science. In Blaise Cronin (Ed) Annual Review of Information Science & Technology, Volume 41. Medford, NJ: Information Today, Inc./American Society for Information Science and Technology, chapter 12, pp. 537-607. Network Science Katy Börner School of Library and Information Science, Indiana University, Bloomington, IN 47405, USA [email protected] Soma Sanyal School of Library and Information Science, Indiana University, Bloomington, IN 47405, USA [email protected] Alessandro Vespignani School of Informatics, Indiana University, Bloomington, IN 47406, USA [email protected] 1. Introduction.............................................................................................................................................2 2. Notions and Notations.............................................................................................................................4 2.1 Graphs and Subgraphs .........................................................................................................................5 2.2 Graph Connectivity..............................................................................................................................7 3. Network Sampling ..................................................................................................................................9 4. Network Measurements........................................................................................................................11 -
Network Science the Barabási-Albert Model
5 ALBERT-LÁSZLÓ BARABÁSI NETWORK SCIENCE THE BARABÁSI-ALBERT MODEL ACKNOWLEDGEMENTS MÁRTON PÓSFAI SARAH MORRISON GABRIELE MUSELLA AMAL HUSSEINI MAURO MARTINO PHILIPP HOEVEL ROBERTA SINATRA INDEX Introduction Growth and Preferential Attachment 1 The Barabási-Albert Model 2 Degree Dynamics 3 Degree Distribution 4 The Absence of Growth or Preferential Attachment 5 Measuring Preferential Attachment 6 Non-linear Preferential Attachment 7 The Origins of Preferential Attachment 8 Diameter and Clustering Coefficient 9 Homework 10 Figure 5.0 (cover image) Scale-free Sonata Summary 11 Composed by Michael Edward Edgerton in 2003, 1 sonata for piano incorporates growth and pref- ADVANCED TOPICS 5.A erential attachment to mimic the emergence of Deriving the Degree Distribution 12 a scale-free network. The image shows the begin- ning of what Edgerton calls Hub #5. The relation- ship between the music and networks is explained ADVANCED TOPICS 5.B by the composer: Nonlinear Preferential Attachment 13 “6 hubs of different length and procedure were distributed over the 2nd and 3rd movements. Mu- ADVANCED TOPICS 5.C sically, the notion of an airport was utilized by The Clustering Coefficient 14 diverting all traffic into a limited landing space, while the density of procedure and duration were varied considerably between the 6 differing occur- Bibliography 15 rences.“ This book is licensed under a Creative Commons: CC BY-NC-SA 2.0. PDF V48 19.09.2014 SECTION 5.1 INTRODUCTION Hubs represent the most striking difference between a random and a scale-free network. On the World Wide Web, they are websites with an exceptional number of links, like google.com or facebook.com; in the metabolic network they are molecules like ATP or ADP, energy carriers in- volved in an exceptional number of chemical reactions. -
Barabási-Albert Model, a Scale-Free Network with Degree Exponent 3
Network Science Class 5: BA model Albert-László Barabási With Emma K. Towlson, Sebastian Ruf, Michael Danziger and Louis Shekhtman www.BarabasiLab.com Section 7 Measuring preferential attachment Section 7 Measuring preferential attachment ¶k k i µ (k ) ~ i ¶t i t Plot the change in the degree Δk during a fixed time Δt for nodes with degree k. To reduce noise, plot the integral of Π(k) over k: ( k ) å ( K ) K <k No pref. attach: κ~k Linear pref. attach: κ~k2 (Jeong, Neda, A.-L. B, Europhys Letter 2003; cond-mat/0104131) Network Science: Evolving Network Models Section 7 Measuring preferential attachment citation Plots shows the integral of network Internet Π(k) over k: ( k ) å ( K ) K <k No pref. attach: κ~k neurosci actor collab. collab Linear pref. attach: κ~k2 (k) A + k , 1 Network Science: Evolving Network Models Section 8 Nonlinear preferential attachment Section 8 Nonlinear preferential attachment α=0: Reduces to Model A discussed in Section 5.4. The degree distribution follows the simple exponential function. α=1: Barabási-Albert model, a scale-free network with degree exponent 3. 0<α<1: Sublinear preferential attachment. New nodes favor the more connected nodes over the less connected nodes. Yet, for the bias is not sufficient to generate a scale-free degree distribution. Instead, in this regime the degrees follow the stretched exponential distribution: Section 8 Nonlinear preferential attachment α=0: Reduces to Model A discussed in Section 5.4. The degree distribution follows the simple exponential function. α=1: Barabási-Albert model, a scale-free network with degree exponent 3. -
Scale-Free and Small-World Networks in Geographical Research: a Critical Examination Laurent Beauguitte, César Ducruet
Scale-free and small-world networks in geographical research: A critical examination Laurent Beauguitte, César Ducruet To cite this version: Laurent Beauguitte, César Ducruet. Scale-free and small-world networks in geographical research: A critical examination. 17th European Colloquium on Theoretical and Quantitative Geography, Sep 2011, Athènes, Greece. pp.663-671. halshs-00623927 HAL Id: halshs-00623927 https://halshs.archives-ouvertes.fr/halshs-00623927 Submitted on 15 Sep 2011 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. SCALE-FREE AND SMALL-WORLD NETWORKS IN GEOGRAPHICAL RESEARCH: A CRITICAL EXAMINATION1 Laurent BEAUGUITTE*1 and César DUCRUET2 (groupe fmr – flux, matrices, réseaux) 1Ph.D student, CNRS, UMR Géographie-cités, University Paris 7, [email protected] 2Research Fellow, CNRS, UMR Géographie-cités (France), [email protected] ABSTRACT A rapid surge of interest for networks in the late 1990s throughout natural and social sciences has witnessed the emergence and the diffusion of new concepts and measures. In this paper, we wish to examine how two recent models of networks (i.e. scale-free and small-world) have been integrated in the works of geographers, what have been the benefits, and whether such concepts are likely to increase their influence in further works on networks. -
Complex Networks: Small-World, Scale-Free and Beyond
Feature Complex Networks: Small-World, Scale-Free and Beyond Xiao Fan Wang and Guanrong Chen Abstract In the past few years, the discovery of small-world and scale-free properties of many natural and artificial complex networks has stimulated a great deal of interest in studying the underlying organizing principles of various com- plex networks, which has led to dra- matic advances in this emerging and active field of research. The present article reviews some basic concepts, important progress, and significant results in the current studies of vari- ous complex networks, with emphasis on the relationship between the topology and the dynamics of such complex networks. Some fundamental properties and typical complex net- work models are described; and, as an example, epidemic dynamics are ana- lyzed and discussed in some detail. Finally, the important issue of robust- ness versus fragility of dynamical synchronization in complex networks is introduced and discussed. Index terms—complex network, small- world network, scale-free network, DIGITAL VISION, LTD. © synchronization, robustness 6 IEEE CIRCUITS AND SYSTEMS MAGAZINE 1531-636X/03/$17.00©2003 IEEE FIRST QUARTER 2003 Introduction a breakthrough in the classical mathematical graph theo- omplex networks are currently being studied across ry. They described a network with complex topology by a many fields of science [1-3]. Undoubtedly, many random graph [4]. Their work had laid a foundation of the Csystems in nature can be described by models of random network theory, followed by intensive studies in complex networks, which are structures consisting of the next 40 years and even today. Although intuition nodes or vertices connected by links or edges. -
Theoretical Network Models
Theoretical Network Models Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University, Jackson, MS E-mail: [email protected] Theoretical Network Models • In this module, we will see the theoretical models using which one could generate complex networks resembling those of real-world networks. • The theoretical models we will see are as follows – Random Networks • Erdos Renyi Model (ER Model) – Scale-Free Networks • Barabasi Albert Model (BA Model) • Bianconi-Barabasi (BB Model) – Small-World Networks • Watts-Strogatz Model (WS Model) • We will see the generation of the networks based on the above models and analyze their characteristics. Random Networks • A random network is the one in which there is a certain probability for a link between any two nodes in the network. • Erdos-Renyi Model (ER) Model – The probability for a link between any two nodes is the same. – Called the G(N, p) model where N is the number of nodes and ‘p’ is the probability for a link between any two nodes – Highly theoretical model and it is primarily used to determine whether the links in a real-world network are formed due to random interactions of nodes or due to the preference of nodes to communicate or attach to certain nodes. ER Model • Step 1: Start with N isolated nodes L = 8 L = 10 L = 7 • Step 2: For a particular node pair (u, v), generate a random number r. If r ≤ p, then, add the link (u, v) to the network. • Repeat Step 2 for each of the N(N-1)/2 node pairs.