UK Train FaresDaniyar Mukhanov, Hein Min Htike

Ideas

Silk road

Flights from Myanmar to Kazakhstan

Family tree tradition of Kazakhstan

Twitter analytics of hashtag #StormImogen

Connection of Marvel heroes

Silk Road

Lack of data

Flights

Too simple graph

Family tree

Tree is also graph, but...

Storm Imogen

Problem with retrieving data

Tools

- NodeXL for Microsoft Excel

- Scraper Wiki

- Next Analytics

Marvel

Too complicated

Quick look

Train fares among UK

Ticket splitting

Aim

●Create a network of train stations in UK cities using ticket price as attribute for the edges.

●Analyse the graph; find cheapest way to travel

●To explore Gephi and apply graph theory

Gephi bugs

- Importing CSV tables

- Finding shortest path

- other minor bugs

Dataset

●Created manually○ 3pm, 9th Feb

●Nodes are stations

●Edges - connections between stations○ Weight - ticket fares

Dataset

Excerpts from data lab

Layout

●Fruchterman Reingold○ Node size ∝ Degree

○ Edge size ∝ Weight

Statistics of the Graph

●Nodes - 26

●Edges - 68

●Undirected Graph (same fare in both direction)

●Average degree - 5.231 (Avg. num of connected stations)

●Network diameter - 3 (maximum connections to reach from one station to another in the graph)

Filter - Degree Range

Degree range: 10 - 13

Stations with at least 10 neigbours.

Filter - Edge Weight

Edge weight range: £5.5 - £15

Train fares less than £15

Filter - Ego NetworkEgo Network of Cardiff

(Depth 1)Shows directedly connected stations.

(Depth 2)Connection with one intermediate station inbetween.

Analysis - Shortest Path● Main aim of this graph analysis.● Gephi provides a button to obtain

shortest path between two nodes. (Using Dijkstra’s algorithm)

● Eg: Cheapest ticket between Edinburghand Cardiff

○ Edinburgh > London > Bristol Parkway > Cardiff

■ £72.5○ Edinburgh > London > Cardiff

■ £100○ Edinburgh > Cardiff

■ £87

Analysis - Heatmap

●Visualise the cost of travel fromEdinburgh to all other stations.

○ Lighter color -> More expensive.

●Gephi provides a button called heatmap to obtain this data.

●This function also givesMax distance = 167.1

○ max possible cost to travel to anystation on the network is £167.1

Conclusion

●What We Did○ Created our own graph

○ Analysed it in Gephi

○ Explored functionalites provided by Gephi & Graph Theory

●What to improve○ small dataset (time limitation)

○ a lot of principles from graph theory do not have real-world meaning in our graph due to the size of its dataset and underlying simplicity.

○ explore other tools (Gephi is extremely buggy).