The United States air transportation network analysis Dorothy Cheung.

Slides:



Advertisements
Similar presentations
Cartography of complex networks: From organizations to the metabolism Cartography of complex networks: From organizations to the metabolism Roger Guimerà.
Advertisements

Classes of complex networks defined by role-to-role connectivity profiles Authors : Roger Guimerà, Marta Sales-pardo, and Luís A. N. Amaral Department.
Mobile Communication Networks Vahid Mirjalili Department of Mechanical Engineering Department of Biochemistry & Molecular Biology.
Communications Research Centre (CRC) Defence R&D Canada – Ottawa 1 Properties of Mobile Tactical Radio Networks on VHF Bands Li Li & Phil Vigneron Communications.
The United States air transportation network analysis Dorothy Cheung.
‘Small World’ Networks (An Introduction) Presenter : Vishal Asthana
Emergence of Scaling in Random Networks Albert-Laszlo Barabsi & Reka Albert.
Power Laws By Cameron Megaw 3/11/2013. What is a Power Law?
Analysis and Modeling of Social Networks Foudalis Ilias.
Advanced Topics in Data Mining Special focus: Social Networks.
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.
Hierarchy in networks Peter Náther, Mária Markošová, Boris Rudolf Vyjde : Physica A, dec
Directional triadic closure and edge deletion mechanism induce asymmetry in directed edge properties.
Networks. Graphs (undirected, unweighted) has a set of vertices V has a set of undirected, unweighted edges E graph G = (V, E), where.
On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.
Advanced Topics in Data Mining Special focus: Social Networks.
Graphs and Topology Yao Zhao. Background of Graph A graph is a pair G =(V,E) –Undirected graph and directed graph –Weighted graph and unweighted graph.
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.
CS8803-NS Network Science Fall 2013
Peer-to-Peer and Social Networks Random Graphs. Random graphs E RDÖS -R ENYI MODEL One of several models … Presents a theory of how social webs are formed.
Models of Influence in Online Social Networks
Large-scale organization of metabolic networks Jeong et al. CS 466 Saurabh Sinha.
Optimization Based Modeling of Social Network Yong-Yeol Ahn, Hawoong Jeong.
Analysis and Modeling of the Open Source Software Community Yongqin Gao, Greg Madey Computer Science & Engineering University of Notre Dame Vincent Freeh.
Research Meeting Seungseok Kang Center for E-Business Technology Seoul National University Seoul, Korea.
Topic 13 Network Models Credits: C. Faloutsos and J. Leskovec Tutorial
Complex Network Analysis of the Washoe County Water Distribution System Presentation By: Eric Klukovich Date: 11/13/2014.
Biological Networks Lectures 6-7 : February 02, 2010 Graph Algorithms Review Global Network Properties Local Network Properties 1.
LANGUAGE NETWORKS THE SMALL WORLD OF HUMAN LANGUAGE Akilan Velmurugan Computer Networks – CS 790G.
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.
A Graph-based Friend Recommendation System Using Genetic Algorithm
Understanding Crowds’ Migration on the Web Yong Wang Komal Pal Aleksandar Kuzmanovic Northwestern University
Topology and Evolution of the Open Source Software Community Advisors: Dr. Vincent W. Freeh Dr. Kevin Bowyer Supported in part by the National Science.
Shi Zhou University College London Second-order mixing in networks Shi Zhou University College London.
Self-Similarity of Complex Networks Maksim Kitsak Advisor: H. Eugene Stanley Collaborators: Shlomo Havlin Gerald Paul Zhenhua Wu Yiping Chen Guanliang.
Emergence of Scaling and Assortative Mixing by Altruism Li Ping The Hong Kong PolyU
Algorithms for Biological Networks Prof. Tijana Milenković Computer Science and Engineering University of Notre Dame Fall 2010.
Whitespace Measurement and Virtual Backbone Construction for Cognitive Radio Networks: From the Social Perspective Shouling Ji and Raheem Beyah Georgia.
Neural Network of C. elegans is a Small-World Network Masroor Hossain Wednesday, February 29 th, 2012 Introduction to Complex Systems.
1. 2 CIShell Features A framework for easy integration of new and existing algorithms written in any programming language. CIShell Sci2 Tool NWB Tool.
Yongqin Gao, Greg Madey Computer Science & Engineering Department University of Notre Dame © Copyright 2002~2003 by Serendip Gao, all rights reserved.
Lecture 10: Network models CS 765: Complex Networks Slides are modified from Networks: Theory and Application by Lada Adamic.
Most of contents are provided by the website Network Models TJTSD66: Advanced Topics in Social Media (Social.
Informatics tools in network science
Response network emerging from simple perturbation Seung-Woo Son Complex System and Statistical Physics Lab., Dept. Physics, KAIST, Daejeon , Korea.
Algorithms and Computational Biology Lab, Department of Computer Science and & Information Engineering, National Taiwan University, Taiwan Network Biology.
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.
Hiroki Sayama NECSI Summer School 2008 Week 2: Complex Systems Modeling and Networks Network Models Hiroki Sayama
Lecture 1: Complex Networks
Biological networks CS 5263 Bioinformatics.
Comparison of Social Networks by Likhitha Ravi
Empirical analysis of Chinese airport network as a complex weighted network Methodology Section Presented by Di Li.
Introduction Secondary Users (SUs) Primary Users (PUs)
Normal Distributions.
Generative Model To Construct Blog and Post Networks In Blogosphere
Section 8.6 of Newman’s book: Clustering Coefficients
A Locality Model of the Evolution of Blog Networks
Models of Network Formation
Peer-to-Peer and Social Networks Fall 2017
Models of Network Formation
Department of Computer Science University of York
Network Science: A Short Introduction i3 Workshop
Clustering Coefficients
Peer-to-Peer and Social Networks
Power Law.
Lecture 9: Network models CS 765: Complex Networks
Advanced Topics in Data Mining Special focus: Social Networks
Presentation transcript:

The United States air transportation network analysis Dorothy Cheung

Introduction The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

Outline The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

The problem and its importance Problem – Analysis the air transportation network in the U.S. Network driven by profits and politics Better understand the network structure not maximize utility Importance – Economy: transport of good and services – Air traffic flow: convenience – Health studies: propagation of diseases

Outline The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

Challenges Large scale and dynamic Number of daily flights in the continental U.S. ~order of 100,000 [4]. Even back in 1991!!

Outline The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

Missing pieces Sufficient amount of researches on the network with focuses on utility optimization. Commercial enterprises: OAG and Innovata But … lack of research on analyzing the network features studied in class.

Outline The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

Previous studies No analysis on the network features related to this class. Related studies for reference and metrics to analyze.

Outline The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

Related works Air transportation networks analysis WAN – World-wide Airport Network ANI – Airport Network of India ANC – Airport Network of China

WAN Network – Nodes: cities – Edges: flight routes Data – OAG – November 1, 2000 to November 7, 2000 – Four years gap – Scheduled flights from all airlines

WAN Small world property – Comparison to a random WAN Shortest path length 4.4. Worst case is 15. High clustering coefficient 0.62 (WAN) vs Power law cumulative degree distribution – Tail of degree distribution monotonically decreases (preferential attachment) – Alpha 1.0. Size of network increases so does the degree of the nodes.

WAN Cumulative distribution of normalized betweeness plotted in log-log scale [1]. – Power law exponent 0.9+/ – Randomized power law exponent 1.5 +/- 0.1.

WAN Most connected versus must central (betweenness centrality) cities [1]. – Circle represents WAN – Dotted line represents a randomized WAN – Smaller degree nodes higher betweenness – Small degree nodes are more central: Anchorage in Alaska

WAN Identify most connected and most central cities. – (b) Top 25 most connected cities [1]. – (c) Top 25 most central cities (betweenness)[1].

WAN Identify communities to better understand why nodes with smaller degree have high centralities [1]. – Simulated annealing algorithm. – Communities in WAN. Each color represents a community. – India grouped with the counties in Northeastern Africa.

WAN Identify hubs in WAN [1]. (a)z >= 2.5 are hubs and z < 2.5 non hubs (RB) Majority of hubs are well connected within their communities. (c) Non hub (G), hub(Y) and connector hubs (Gy) Cities that are not hubs rarely have links to other communities.

ANI Network – Nodes: airports – Un-weighted edges: existence of flight routes – Weighted edges: amount of flight routes per week – 79 nodes with 6162 distinct paths Data – Timetable for air services in India. – Week of January 12, 2004.

ANI Small world property – Shortest path length 4. Worst case is 6. – Comparison to a random ANI. High clustering coefficient (ANI) vs (random). Shortest path distribution [2].

ANI Power law cumulative degree distribution – Tail of degree distribution monotonically decreases. – Alpha 2.2 +/ Size of network increases so does the degree of the node. Cumulative degree distribution in log-log scale [2].

ANI Skewed distribution on the right [2]. Average strength [2]. The larger the airport the more traffic it handles.

ANI Large airports provide air connectively to smaller airports. Large airports tend to be disconnected. Rich-club phenomena Average un-weighted c(k) and weighted C w (k) clustering coefficients [2].

ANI Larger the degree less correlated. – Dissociative mixing Large airports connect with smaller airports Average unweighted k nn (k) and weighted k nn w (k) degree of nearest neighbors of nodes with degree k [2].

ANC Network – Nodes: airports – Un-weighted edges: existence of flight routes – 128 airports (nodes), 1165 flights (edges) Data – Timetable for air services in China – A week of data (dates not specified)

ANC Small world property – Shortest path length – Comparison to a random ANC. High clustering coefficient (ANC) vs (random).

ANC Power law cumulative degree distribution – Weights accounts for frequency of flights. – Tail of degree distribution monotonically decreases. – Alpha Cumulative weight distributions of the entire week [3].

ANC Degree-degree correlations showing disasociative mixing [3].

ANC (A) diameter vs. density of undirected ANC [3]. (B) efficiency vs. density of undirected ANC [3].

Summary: Features of air transportation networks Small world network (compared with random graphs) – Small average shortest path – High average clustering coefficient – Degree mixing differs Scale free power law degree distribution WANANIANC Avg. shortest path Avg. Clustering Coef Degree mixingAssociativeDissociative WANANIANC Power law exponent /

Outline The problem and its importance Challenges Missing pieces Previous Studies Related works Key components of my research

Key components of my approach Data set from Research and Innovative Technology Administration (Bureau of Transportation Statistics – Flights scheduled – Passengers and Cargos – Published in 06/2011 – Several months

Key components of my approach Network – Nodes: airports – Un-weighted edges: flights Metrics – Degree distributions and correlations Top 10 most connected cities Top 10 most central cites – Shortest path length – Clustering coefficient – Cumulative degree distribution and the power law – Associativity – Does it exhibit the rich-club phenomena? – Compare between an un-weighted and weighted versions? Random graph?

Key components of my approach Expectations – Larger degree nodes are more central (betweenness). Consider LAX, SFO, HOU, JFK, etc. – Small world – Scale free power law distribution – Dissociate

Conclusion The United States air transportation network analysis The problem and its importance Challenges Missing pieces Previous Studies Related works – WAN, ANI, ANC

References for this presentation 1. R. Guimera, S. Mossa, A. Turtschi, and L.A.N. Amaral, “The world-wide air transportaion network: Anomalous centrality, community structure, and cities’ global roles”, July Ganesh Bagler, “Analysis of the Airport Network of India as a complex weighted network”, February W. Li and X. Cai, “Statistical Analysis of Airport Network of China”, September, Amedeo R. Odoni, “Issues in modeling a national network of airports”, Proceedings of the 1991 Winter Simulation Conference, Cambridge, Massachusetts, Jose J. Ramasco, Vittoria Colizza, and Pietro Panzarasa, “Using the weighted rich-club coefficient to explore traffic organization in mobility networks”, 1991.