Glossary of Terms Used for Network Analysis
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Geodesic Distance Descriptors
Geodesic Distance Descriptors Gil Shamai and Ron Kimmel Technion - Israel Institute of Technologies [email protected] [email protected] Abstract efficiency of state of the art shape matching procedures. The Gromov-Hausdorff (GH) distance is traditionally used for measuring distances between metric spaces. It 1. Introduction was adapted for non-rigid shape comparison and match- One line of thought in shape analysis considers an ob- ing of isometric surfaces, and is defined as the minimal ject as a metric space, and object matching, classification, distortion of embedding one surface into the other, while and comparison as the operation of measuring the discrep- the optimal correspondence can be described as the map ancies and similarities between such metric spaces, see, for that minimizes this distortion. Solving such a minimiza- example, [13, 33, 27, 23, 8, 3, 24]. tion is a hard combinatorial problem that requires pre- Although theoretically appealing, the computation of computation and storing of all pairwise geodesic distances distances between metric spaces poses complexity chal- for the matched surfaces. A popular way for compact repre- lenges as far as direct computation and memory require- sentation of functions on surfaces is by projecting them into ments are involved. As a remedy, alternative representa- the leading eigenfunctions of the Laplace-Beltrami Opera- tion spaces were proposed [26, 22, 15, 10, 31, 30, 19, 20]. tor (LBO). When truncated, the basis of the LBO is known The question of which representation to use in order to best to be the optimal for representing functions with bounded represent the metric space that define each form we deal gradient in a min-max sense. -
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 -
Latent Distance Estimation for Random Geometric Graphs ∗
Latent Distance Estimation for Random Geometric Graphs ∗ Ernesto Araya Valdivia Laboratoire de Math´ematiquesd'Orsay (LMO) Universit´eParis-Sud 91405 Orsay Cedex France Yohann De Castro Ecole des Ponts ParisTech-CERMICS 6 et 8 avenue Blaise Pascal, Cit´eDescartes Champs sur Marne, 77455 Marne la Vall´ee,Cedex 2 France Abstract: Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of n points X1;X2; ··· ;Xn on d−1 the Euclidean sphere S which represents the latent positions of nodes of the network. The connection probabilities between the nodes are determined by an unknown function (referred to as the \link" function) evaluated at the distance between the latent points. We introduce a spectral estimator of the pairwise distance between latent points and we prove that its rate of convergence is the same as the nonparametric estimation of a d−1 function on S , up to a logarithmic factor. In addition, we provide an efficient spectral algorithm to compute this estimator without any knowledge on the nonparametric link function. As a byproduct, our method can also consistently estimate the dimension d of the latent space. MSC 2010 subject classifications: Primary 68Q32; secondary 60F99, 68T01. Keywords and phrases: Graphon model, Random Geometric Graph, Latent distances estimation, Latent position graph, Spectral methods. 1. Introduction Random geometric graph (RGG) models have received attention lately as alternative to some simpler yet unrealistic models as the ubiquitous Erd¨os-R´enyi model [11]. They are generative latent point models for graphs, where it is assumed that each node has associated a latent d point in a metric space (usually the Euclidean unit sphere or the unit cube in R ) and the connection probability between two nodes depends on the position of their associated latent points. -
Average D-Distance Between Vertices of a Graph
italian journal of pure and applied mathematics { n. 33¡2014 (293¡298) 293 AVERAGE D-DISTANCE BETWEEN VERTICES OF A GRAPH D. Reddy Babu Department of Mathematics Koneru Lakshmaiah Education Foundation (K.L. University) Vaddeswaram Guntur 522 502 India e-mail: [email protected], [email protected] P.L.N. Varma Department of Science & Humanities V.F.S.T.R. University Vadlamudi Guntur 522 237 India e-mail: varma [email protected] Abstract. The D-distance between vertices of a graph G is obtained by considering the path lengths and as well as the degrees of vertices present on the path. The average D-distance between the vertices of a connected graph is the average of the D-distances between all pairs of vertices of the graph. In this article we study the average D-distance between the vertices of a graph. Keywords: D-distance, average D-distance, diameter. 2000 Mathematics Subject Classi¯cation: 05C12. 1. Introduction The concept of distance is one of the important concepts in study of graphs. It is used in isomorphism testing, graph operations, hamiltonicity problems, extremal problems on connectivity and diameter, convexity in graphs etc. Distance is the basis of many concepts of symmetry in graphs. In addition to the usual distance, d(u; v) between two vertices u; v 2 V (G) we have detour distance (introduced by Chartrand et al, see [2]), superior distance (introduced by Kathiresan and Marimuthu, see [6]), signal distance (introduced by Kathiresan and Sumathi, see [7]), degree distance etc. 294 d. reddy babu, p.l.n. varma In an earlier article [9], the authors introduced the concept of D-distance be- tween vertices of a graph G by considering not only path length between vertices, but also the degrees of all vertices present in a path while de¯ning the D-distance. -
"Distance Measures for Graph Theory"
Distance measures for graph theory : Comparisons and analyzes of different methods Dissertation presented by Maxime DUYCK for obtaining the Master’s degree in Mathematical Engineering Supervisor(s) Marco SAERENS Reader(s) Guillaume GUEX, Bertrand LEBICHOT Academic year 2016-2017 Acknowledgments First, I would like to thank my supervisor Pr. Marco Saerens for his presence, his advice and his precious help throughout the realization of this thesis. Second, I would also like to thank Bertrand Lebichot and Guillaume Guex for agreeing to read this work. Next, I would like to thank my parents, all my family and my friends to have accompanied and encouraged me during all my studies. Finally, I would thank Malian De Ron for creating this template [65] and making it available to me. This helped me a lot during “le jour et la nuit”. Contents 1. Introduction 1 1.1. Context presentation .................................. 1 1.2. Contents .......................................... 2 2. Theoretical part 3 2.1. Preliminaries ....................................... 4 2.1.1. Networks and graphs .............................. 4 2.1.2. Useful matrices and tools ........................... 4 2.2. Distances and kernels on a graph ........................... 7 2.2.1. Notion of (dis)similarity measures ...................... 7 2.2.2. Kernel on a graph ................................ 8 2.2.3. The shortest-path distance .......................... 9 2.3. Kernels from distances ................................. 9 2.3.1. Multidimensional scaling ............................ 9 2.3.2. Gaussian mapping ............................... 9 2.4. Similarity measures between nodes .......................... 9 2.4.1. Katz index and its Leicht’s extension .................... 10 2.4.2. Commute-time distance and Euclidean commute-time distance .... 10 2.4.3. SimRank similarity measure ......................... -
Percolation Theory Are Well-Suited To
Models of Disordered Media and Predictions of Associated Hydraulic Conductivity A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science By L AARON BLANK B.S., Wright State University, 2004 2006 Wright State University WRIGHT STATE UNIVERSITY SCHOOL OF GRADUATE STUDIES Novermber 6, 2006 I HEREBY RECOMMEND THAT THE THESIS PREPARED UNDER MY SUPERVISION BY L Blank ENTITLED Models of Disordered Media and Predictions of Associated Hydraulic Conductivity BE ACCEPTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Master of Science. _______________________ Allen Hunt, Ph.D. Thesis Advisor _______________________ Lok Lew Yan Voon, Ph.D. Department Chair _______________________ Joseph F. Thomas, Jr., Ph.D. Dean of the School of Graduate Studies Committee on Final Examination ____________________ Allen Hunt, Ph.D. ____________________ Brent D. Foy, Ph.D. ____________________ Gust Bambakidis, Ph.D. ____________________ Thomas Skinner, Ph.D. Abstract In the late 20th century there was a spill of Technetium in eastern Washington State at the US Department of Energy Hanford site. Resulting contamination of water supplies would raise serious health issues for local residents. Therefore, the ability to predict how these contaminants move through the soil is of great interest. The main contribution to contaminant transport arises from being carried along by flowing water. An important control on the movement of the water through the medium is the hydraulic conductivity, K, which defines the ease of water flow for a given pressure difference (analogous to the electrical conductivity). The overall goal of research in this area is to develop a technique which accurately predicts the hydraulic conductivity as well as its distribution, both in the horizontal and the vertical directions, for media representative of the Hanford subsurface. -
Sex, Race, Religion, Age, and Education Homophily Among Confidants, 1985 to 2004 Jeffrey A
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Sociology Department, Faculty Publications Sociology, Department of 4-2014 Social Distance in the United States: Sex, Race, Religion, Age, and Education Homophily among Confidants, 1985 to 2004 Jeffrey A. Smith University of Nebraska-Lincoln, [email protected] Miller McPherson Duke University, [email protected] Lynn Smith-Lovin Duke University, [email protected] Follow this and additional works at: http://digitalcommons.unl.edu/sociologyfacpub Part of the Demography, Population, and Ecology Commons, Race and Ethnicity Commons, Social Psychology and Interaction Commons, and the Social Statistics Commons Smith, Jeffrey A.; McPherson, Miller; and Smith-Lovin, Lynn, "Social Distance in the United States: Sex, Race, Religion, Age, and Education Homophily among Confidants, 1985 to 2004" (2014). Sociology Department, Faculty Publications. 246. http://digitalcommons.unl.edu/sociologyfacpub/246 This Article is brought to you for free and open access by the Sociology, Department of at DigitalCommons@University of Nebraska - Lincoln. It has been accepted for inclusion in Sociology Department, Faculty Publications by an authorized administrator of DigitalCommons@University of Nebraska - Lincoln. Published in American Sociological Review 79:3 (2014), pp. 432-456. doi: 10.1177/0003122414531776 Copyright © 2014 American Sociological Review. Used by permission. digitalcommons.unl.edu Published online April 24, 2014. Social Distance in the United States: Sex, Race, Religion, Age, and Education Homophily among Confidants, 1985 to 2004 Jeffrey A. Smith,1 Miller McPherson,2 and Lynn Smith-Lovin2 1. University of Nebraska-Lincoln 2. Duke University Corresponding author – Jeffrey A. Smith, Department of Sociology, University of Nebraska-Lincoln, 711 Oldfather Hall, Lincoln, NE 68588-0324, email [email protected] Abstract Homophily, the tendency for similar actors to be connected at a higher rate than dissimi- lar actors, is a pervasive social fact. -
Assortativity Measures for Weighted and Directed Networks
Assortativity measures for weighted and directed networks Yelie Yuan1, Jun Yan1, and Panpan Zhang2,∗ 1Department of Statistics, University of Connecticut, Storrs, CT 06269 2Department of Biostatistics, Epidemiology and Informatics, University of Pennsylvania, Philadelphia, PA 19104 ∗Corresponding author: [email protected] January 15, 2021 arXiv:2101.05389v1 [stat.AP] 13 Jan 2021 Abstract Assortativity measures the tendency of a vertex in a network being connected by other ver- texes with respect to some vertex-specific features. Classical assortativity coefficients are defined for unweighted and undirected networks with respect to vertex degree. We propose a class of assortativity coefficients that capture the assortative characteristics and structure of weighted and directed networks more precisely. The vertex-to-vertex strength correlation is used as an example, but the proposed measure can be applied to any pair of vertex-specific features. The effectiveness of the proposed measure is assessed through extensive simula- tions based on prevalent random network models in comparison with existing assortativity measures. In application World Input-Ouput Networks, the new measures reveal interesting insights that would not be obtained by using existing ones. An implementation is publicly available in a R package wdnet. 1 Introduction In traditional network analysis, assortativity or assortative mixing (Newman, 2002) is a mea- sure assessing the preference of a vertex being connected (by edges) with other vertexes in a network. The measure reflects the principle of homophily (McPherson et al., 2001)|the tendency of the entities to be associated with similar partners in a social network. The prim- itive assortativity measure proposed by Newman(2002) was defined to study the tendency of connections between nodes based on their degrees, which is why it is also called degree-degree correlation (van der Hofstad and Litvak, 2014). -
A Note on a Conjecture for the Distance Laplacian Matrix 61 Studied ([2, 4, 6]) And, in [4], M
Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 31, pp. 60-68, February 2016 ELA http:/repository.uwyo.edu/ela A NOTE ON A CONJECTURE FOR THE DISTANCE LAPLACIAN MATRIX∗ CELSO M. DA SILVA JR.†, MARIA AGUIEIRAS A. DE FREITAS‡, AND RENATA R. DEL-VECCHIO§ Abstract. In this note, the graphs of order n having the largest distance Laplacian eigenvalue of multiplicity n − 2 are characterized. In particular, it is shown that if the largest eigenvalue of the ∼ distance Laplacian matrix of a connected graph G of order n has multiplicity n − 2, then G = Sn ∼ or G = Kp,p, where n = 2p. This resolves a conjecture proposed by M. Aouchiche and P. Hansen in [M. Aouchiche and P. Hansen. A Laplacian for the distance matrix of a graph. Czechoslovak Mathematical Journal, 64(3):751–761, 2014.]. Moreover, it is proved that if G has P5 as an induced subgraph then the multiplicity of the largest eigenvalue of the distance Laplacian matrix of G is less than n − 3. Key words. Distance Laplacian matrix, Laplacian matrix, Largest eigenvalue, Multiplicity of eigenvalues. AMS subject classifications. 05C12, 05C50, 15A18. 1. Introduction. Let G = (V, E) be a connected graph and the distance (the length of a shortest path) between vertices vi and vj of G be denoted by di,j . The distance matrix of G, denoted by D(G), is the n × n matrix whose (i, j)-entry is equal to di,j , i,j = 1, 2,...,n. The transmission Tr(vi) of a vertex vi is defined as the sum of the distances from vi to all other vertices in G. -
Distance Between Graphs Preston Boorsma Advisor: Dr
Distance Between Graphs Preston Boorsma Advisor: Dr. Aparna Higgins Introduction Theorem Rotation Distance Graphs Two graphs ! and " are said to be isomorphic if there Let ! and " be graphs of order 4 and size 5, and let 6 Every complete graph DE is a rotation distance graph. exists a bijection # from the vertex set of ! to the be a greatest common subgraph of ! and " with size 7. For example, the graph DF is a rotation distance graph vertex set of " such that $% is an edge in ! if and only Then /(!, ") ≤ 2(5 − 7). of graphs !G, !H, !F below for 4 = 3. Similar graphs if #($)#(%) is an edge in ". Isomorphic graphs can be can be constructed for any 4. relabeled and redrawn to look identical. Why? If ! and " are not isomorphic, then there exists an edge $% in " but not in ! and an edge 9: in ! but ; not in ". We can construct a graph " = ! − 9: + !G $% so that /(!, "′) ≤ 2, and " and "′ have 7 + 1 edges in common. Repeating this process 5 − 7 times, Two isomorphic graphs we get /(!, ") ≤ 2(5 − 7). !H ------------------------------------------------------------------ 9 : 9 : 9 : GF !G !H $ % $ % $ % ! ( ) * F ! "= "′ DF Non-isomorphic graphs of same order and size Example case in proof of theorem ------------------------------------------------------------ ------------------------------------------------------------------ ------------------------------------------------------------------- Existence of Distances How “far” are graphs (, ), and * from being The bound >(? − @) is sharp. Consider graphs ( and For each positive integer K, there exist two graphs ! isomorphic to each other? * to the left. The graph A (see below) is a greatest and " such that / !, " = K. For any given K, common subgraph of ( and * with size 5. Our theorem construct " as shown below, and let ! = L . -
Topology Analysis of China's Port Shipping Network
JOURNAL OF SOFTWARE, VOL. 8, NO. 10, OCTOBER 2013 2581 Topology Analysis of China's Port Shipping Network Beibei Hu 1Department of management science and engineering, Beijing University of Technology, Beijing100124, P.R. China. Email: [email protected] Gang Zong 2Department of management science and engineering, Beijing University of Technology, Beijing100124, P.R. China. Email:[email protected] Abstract—Based on China's port shipping statistical data social networks, such as social network, information from 2006 to 2010, the paper constructs China's port network, technology network and biological network [3], shipping network structure chart, and analyzes the degree are neither regular network nor random network, but the distribution, average path length, network density and network with some or all of the these properties like network clustering coefficient of the network. The results self-organizing, self-similarity, attractor, small-world show that China's port shipping network has scale-free phenomena and scale-free phenomena. As a powerful tool characteristic with short average path length, high network density, and its degree distribution follows a power law. used to analyze complex system’s topological structure Through the computer simulation, the higher correlation and dynamic evolvement, complex network [4-7] is coefficient also shows that data fitting is satisfactory, which gradually becoming a hot area of research. In recent years, further validates that China’s port shipping network is a based on the small-world network theory and scale-free scale-free network. network theory, domestic and foreign scholars have already analyzed aviation network, and gained some Index Terms—Complex network; shipping network; degree achievements [8-9]. -
Tuning the Average Path Length of Complex Networks and Its Influence to the Emergent Dynamics of the Majority-Rule Model
Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model Andreas I. Reppas *, Konstantinos Spiliotis, Constantinos I. Siettos † School of Applied Mathematics and Physical Sciences, National Technical University of Athens, Greece, GR 157 80 Preprint version of the paper published in Mathematics and Computers in Simulation, 109 , March 2015, Pages 186–196. Abstract. We show how appropriate rewiring with the aid of Metropolis Monte Carlo computational experiments can be exploited to create network topologies possessing prescribed values of the average path length (APL) while keeping the same connectivity degree and clustering coefficient distributions. Using the proposed rewiring rules, we illustrate how the emergent dynamics of the celebrated majority-rule model are shaped by the distinct impact of the APL attesting the need for developing efficient algorithms for tuning such network characteristics. Keywords : Complex Networks; Average Path Length; Clustering Coefficient; Prescribed Network Characteristics; Monte Carlo Simulations; Nonlinear Dynamics; Majority-Rule Model 1. Introduction. The strong interplay between the emergent complex dynamics of many real-world systems and the underlying topology of the networks that pertain to their structure has been illustrated by many studies: the dynamics of electrical power transmission systems including cascade failures leading to blackouts [54], the evolution of the world wide web, various social phenomena such as mimesis and herding [55], brain cognitive, neurological disorders and motor functions [8, 11, 54] are typical paradigms of such cases. Thus, the modelling and the systematic investigation of the topological properties of complex networks are of great importance. Towards this aim, various algorithms for generating networks aspiring to approximate the actual ones have been proposed [2, 46, 57].