GoMore Network Analysis Kate Lyndegaard GEOG 596A Mentor: Frank Hardisty.

Slides:



Advertisements
Similar presentations
Topology and Dynamics of Complex Networks FRES1010 Complex Adaptive Systems Eileen Kraemer Fall 2005.
Advertisements

Complex Networks: Complex Networks: Structures and Dynamics Changsong Zhou AGNLD, Institute für Physik Universität Potsdam.
Complex Network Theory
Complex Networks Advanced Computer Networks: Part1.
Network analysis Sushmita Roy BMI/CS 576
The Architecture of Complexity: Structure and Modularity in Cellular Networks Albert-László Barabási University of Notre Dame title.
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Analysis and Modeling of Social Networks Foudalis Ilias.
Modeling Malware Spreading Dynamics Michele Garetto (Politecnico di Torino – Italy) Weibo Gong (University of Massachusetts – Amherst – MA) Don Towsley.
School of Information University of Michigan Network resilience Lecture 20.
VL Netzwerke, WS 2007/08 Edda Klipp 1 Max Planck Institute Molecular Genetics Humboldt University Berlin Theoretical Biophysics Networks in Metabolism.
Information Networks Small World Networks Lecture 5.
CS 599: Social Media Analysis University of Southern California1 The Basics of Network Analysis Kristina Lerman University of Southern California.
Farnoush Banaei-Kashani and Cyrus Shahabi Criticality-based Analysis and Design of Unstructured P2P Networks as “ Complex Systems ” Mohammad Al-Rifai.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Emergence of Scaling in Random Networks Barabasi & Albert Science, 1999 Routing map of the internet
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
Scale-free networks Péter Kómár Statistical physics seminar 07/10/2008.
Small-World File-Sharing Communities Adriana Iamnitchi, Matei Ripeanu and Ian Foster,
Scale Free Networks Robin Coope April Abert-László Barabási, Linked (Perseus, Cambridge, 2002). Réka Albert and AL Barabási,Statistical Mechanics.
Networks FIAS Summer School 6th August 2008 Complex Networks 1.
1 Complex systems Made of many non-identical elements connected by diverse interactions. NETWORK New York Times Slides: thanks to A-L Barabasi.
Global topological properties of biological networks.
Small World Networks Somsubhra Sharangi Computing Science, Simon Fraser University.
SDSC, skitter (July 1998) A random graph model for massive graphs William Aiello Fan Chung Graham Lincoln Lu.
Analysis of Social Information Networks Thursday January 27 th, Lecture 3: Popularity-Power law 1.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 7 May 14, 2006
Network analysis and applications Sushmita Roy BMI/CS 576 Dec 2 nd, 2014.
Summary from Previous Lecture Real networks: –AS-level N= 12709, M=27384 (Jan 02 data) route-views.oregon-ix.net, hhtp://abroude.ripe.net/ris/rawdata –
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Oct 16th, 2012.
The United States air transportation network analysis Dorothy Cheung.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Models and Algorithms for Complex Networks Networks and Measurements Lecture 3.
Complex networks A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, Orsay, France) M. Barthélemy (CEA, France) L. Dall’Asta (LPT, Orsay,
Traceroute-like exploration of unknown networks: a statistical analysis A. Barrat, LPT, Université Paris-Sud, France I. Alvarez-Hamelin (LPT, France) L.
Section 8 – Ec1818 Jeremy Barofsky March 31 st and April 1 st, 2010.
Functional Analysis of Large Software Networks Natasa Przulj, Gordon Lee and Igor Jurisica IBM CAS, University of Toronto.
Clustering of protein networks: Graph theory and terminology Scale-free architecture Modularity Robustness Reading: Barabasi and Oltvai 2004, Milo et al.
Weighted networks: analysis, modeling A. Barrat, LPT, Université Paris-Sud, France M. Barthélemy (CEA, France) R. Pastor-Satorras (Barcelona, Spain) A.
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Social Network Analysis Prof. Dr. Daning Hu Department of Informatics University of Zurich Mar 5th, 2013.
Physics of Flow in Random Media Publications/Collaborators: 1) “Postbreakthrough behavior in flow through porous media” E. López, S. V. Buldyrev, N. V.
Complex Network Theory – An Introduction Niloy Ganguly.
Class 9: Barabasi-Albert Model-Part I
Complex Network Theory – An Introduction Niloy Ganguly.
Class 19: Degree Correlations PartII Assortativity and hierarchy
Social Networking: Large scale Networks
March 3, 2009 Network Analysis Valerie Cardenas Nicolson Assistant Adjunct Professor Department of Radiology and Biomedical Imaging.
Performance Evaluation Lecture 1: Complex Networks Giovanni Neglia INRIA – EPI Maestro 10 December 2012.
Class 4: It’s a Small World After All Network Science: Small World February 2012 Dr. Baruch Barzel.
Netlogo demo. Complexity and Networks Melanie Mitchell Portland State University and Santa Fe Institute.
Limit theorems for the number of multiple edges in the configuration graph Irina Cheplyukova Karelian Research Centre of Russian Academy of Sciences
Topics In Social Computing (67810) Module 1 Introduction & The Structure of Social Networks.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
Lecture II Introduction to complex networks Santo Fortunato.
Weighted Networks IST402 – Network Science Acknowledgement: Roberta Sinatra Laszlo Barabasi.
Cmpe 588- Modeling of Internet Emergence of Scale-Free Network with Chaotic Units Pulin Gong, Cees van Leeuwen by Oya Ünlü Instructor: Haluk Bingöl.
Lecture I Introduction to complex networks Santo Fortunato.
Structures of Networks
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Complex Networks
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
The Watts-Strogatz model
Classes will begin shortly
Department of Computer Science University of York
Topology and Dynamics of Complex Networks
Lecture 9: Network models CS 765: Complex Networks
Presentation transcript:

GoMore Network Analysis Kate Lyndegaard GEOG 596A Mentor: Frank Hardisty

Outline 1.Motivation and summary 2.What is network analysis? 3.The project objective 4.The GoMore network 5.The preliminary results 6.The next steps 7.Thanks

Motivation and Summary

-How can we begin to discuss integration of spatial analysis and social network analysis intersect? -Are there elements of geospatial/geostatistical theory which complement social network theoretic approaches to examining context and relationships in networks, and vice versa?

Motivation and Summary -How can we begin to discuss integration of spatial analysis and social network analysis intersect? -Are there elements of geospatial/geostatistical theory which complement social network theoretic approaches to examining context and relationships in networks, and vice versa?

What is network analysis?

Network Representation A network represents data as a series of ‘nodes’ and ‘edges’ Node Edge

Directed Networks A directed network represents the directionality of events represented by ‘edges’

Weighted Networks Not all networks are represented by edges sharing equal values. Weighted networks attribute additional data to every edge

Topological Properties: Degree Centrality measures such as ‘degree’ measure the relative importance of a node within a network. Degree = 5 Out degree = 3 In degree = 2 Out degree = 1 Source: Lotan, G.: Network X and Gephi, NYC PyData Conference 2012

Topological Properties: Path Length Path length measures the number of edges between two nodes. Shortest path length, and average path length (calculated over the entire graph), may also be measured Path Length = 2

The Project Objective.

Analyze the GoMore Network Analyze the network of Northern Europe’s leading, online ride-share provider: GoMore (

Analyze the GoMore Network 1.Examine a number of topological network properties in order to characterize the interconnectivity of GoMore travel 2.Examine weighted network properties in order to analyze the significance of the volume of travel 3.Determine whether or not there is a correlation between population density and the volume of travel between network nodes

The GoMore network.

Creating the Network Graph Technologies employed: PostgreSQL: Advanced SQL queries to structure data Gephi: Generate.GML (graph file), visualization, analyses igraph as R package: Implement network analysis algorithms R: Implement statistical methods, visualization ArcGIS for Desktop: Spatial analyses, visualization, feature attribution, processing of demographic data

Creating the Network Graph: PostgreSQL ‘nodes’ table

Creating the Network Graph: PostgreSQL ‘edges’ table

Creating the Network Graph: Gephi GoMore network graph: Circular Layout

Creating the Network Graph: ArcGIS

The Preliminary Results.

Topological Properties of the GoMore Network

Comparative Model: Erdős-Rényi random graph

Power Law Degree Distribution

Clustering Spectrum: Average Local Clustering Coefficient vs. degree Source: Barabási, A.L.: Network Science. Forthcoming, pp. 41

Average Nearest Neighbor vs. Degree

The Next Steps.

The GoMore Network and Population Data

Next Steps 1.Complete and refine weighted network analyses 2.Refine spatial analyses 3.Discuss correlations between network and spatial analyses 4.Complete journal article for peer-review (GIScience 2014, Vienna, Austria)

References Albert, R., Barabási, A. L.: Topology of evolving networks: local events and universality. Physical review letters 85.24, 5234 (2000). Barabási, A.L.: Network Science. Forthcoming. Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science , (1999)Emergence of Scaling in Random Networks Barthélemy, M., Barrat, A., Pastor-Satorras, R., Vespignani, A.: Characterization and modeling of weighted networks. Physica a: Statistical mechanics and its applications 346.1, (2005) Barrat, A., Barthelemy, M., Pastor-Satorras, R., Vespignani, A.: The architecture of complex weighted networks. PNAS , (2004) Clauset, A., Shalizi, C. R., Newman, M. E.: Power-law distributions in empirical data. SIAM Review 51.4, (2009)Power-law distributions in empirical data De Montis, A., Barthélemy, M., Chessa, A., Vespignani, A.: The structure of inter-urban traffic: A weighted network analysis. arXiv preprint physics/ (2005) De Montis, A., Caschili, S., Chessa, A.: Spatial Complex Network Analysis and Accessibility Indicators: the Case of Municipal Commuting in Sardinia, Italy. EJTIR 4.11, (2011) De Montis, A., Chessa, A., Campagna, M., Caschili, S., Deplano, G.: Modeling commuting systems through a complex network analysis: A study of the Italian islands of Sardinia and Sicily. Journal of Transport and Land Use 2.3, (2010) Easley, D., Kleinberg, J.: Networks, crowds, and markets. Cambridge, Cambridge University Press (2010) Erdős, P., Rényi, A.: On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl 5, (1960). Gallego, F. J.: A population density grid of the European Union. Population and Environment 31.6, (2010). Gastner, M. T., Newman, M. E.: The spatial structure of networks. Eur. Phys. J. B 49.2, (2006) Gorman, S. P., Kulkarni, R.: Spatial small worlds: new geographic patterns for an information economy. arXiv preprint cond- mat/ , (2003) Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. PNAS , (2005) Newman, M. E.: Analysis of weighted networks. Physical Review E 70.5, (2004). Onnela, J. P., Saramäki, J., Kertész, J., Kaski, K.: Intensity and coherence of motifs in weighted complex networks. Physical Review E 71.6, (2005) Patuelli, R., Reggiani, A., Gorman, S. P., Nijkamp, P., Bade, F. J.: Network analysis of commuting flows: A comparative static approach to German data. Networks and Spatial Economics 7.4, (2007) Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 4, (1969) Watts, D. J., Strogatz, S. H.: Collective dynamics of ‘small-world’networks. Nature , (1998) Yook, S. H., Jeong, H., Barabási, A. L.: Modeling the Internet's large-scale topology. PNAS 99.21, (2002).

Thanks I would like to thank Beth King and Frank Hardisty