0% found this document useful (0 votes)
17 views26 pages

Leema Nivethini

Uploaded by

Angel D
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
17 views26 pages

Leema Nivethini

Uploaded by

Angel D
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 26

Proposed Title of the Research : CONGESTION

ANALYSIS IN TRANSPORTATION NETWORKS


USING CENTRALITY MEASURES
Presented by
R. LEEMA NIVETHINI
Research Scholar
Ref. No. S/Ph.D/20251/064

Under the guidance of


Dr. D. ANGEL
Assistant Professor
Department of Mathematics,
Sathyabama Institute of Science & Technology.
Chennai.
Introduction to Centrality
Measures
Centrality measures are algorithms that use graph theory to evaluate the importance of nodes
in a network.
They are used to identify nodes that are critical to a network and to understand how
information flows through the network.
Centrality measures are used in many fields, including sociology, where they can help analyze
social structures and identify individuals with significant influence. For example, on online
platforms like Twitter, PageRank is used to recommend other accounts for users to follow.
Types of Centrality Measures
Degree Centrality
Betweenness Centrality
Closeness Centrality
Eigenvector Centrality
Degree Centrality
The number of links each node holds determines the important score that is assigned by
degree centrality.
How many direct, ‘one hop’ connections each node has to other nodes in the network.
For locating people who are well-connected, well-liked, likely to hold the most knowledge, or
who can easily connect with the larger network.
The simplest way to determine node connection is through degree centrality. When examining
transactional data or account activity, for instance, it can be helpful to compare in-degree
(number of inbound links) and out-degree (number of outward links) as separate metrics.
Closeness Centrality
Each node is given a score based on how “close” they are to all other nodes in the network.
The shortest pathways connecting each node are determined using this metric, and each node
is then given a score based on the sum of its shortest paths.
For identifying the people most suited to quickly affect the entire network.
Although closeness centrality might be useful for identifying effective “broadcasters,” you will
frequently discover that all nodes in a highly connected network have a similar score. Finding
influencers in a single cluster using Closeness may be more beneficial.
Betweenness Centrality
Betweenness centrality measures the number of times a node lies on the shortest path
between other nodes.
This measure identifies the network nodes that act as “bridges” between other nodes. It
accomplishes this by counting how many times each node is on each of the shortest paths after
first identifying them.
For identifying the people who have an impact the flow around a system.
Betweenness is helpful for examining the dynamics of communication. A person may have
power over different clusters in a network if they have a high betweenness count, or they may
simply be on the fringes of both clusters.
Eigenvector Centrality
Based on how many linkages a node has to other nodes in the network, Eigen Centrality
calculates that node’s influence. Then, Eigen Centrality takes things a step further by accounting
for a node’s degree of connectivity, the number of links in its connections, and so on throughout
the network.
Eigen Centrality can discover nodes that have influence over the entire network, not just those
that are immediately connected to it, by computing a node’s extended connections.
A useful “all-around” SNA score is Eigen Centrality, which is useful for comprehending both
human social networks and other networks, such as those involved in the spread of malware.
Applications of Centrality
Measures
Methodology
PROBLEM DEFINITION

LITERATURE REVIEW

Analyzing Different
Centrality Measures

Optimization of Different
Centrality Measures

Adopting Different
Centrality Measures to
the Transportation
Network

Apply and Preparation


of report in Real world
scenario
Literature Survey
1) Mussone et al. (2022) introduced two novel indices to underground transportation networks, since
these networks represent an infrastructural backbone for the transportation system of most big
cities over the world.
2) Sandip Chakrabarti et al. (2022) tested the relationships of three alternative centrality indices
(closeness, betweenness, and eigenvector) capturing different dimensions of network-wide
connectedness with housing price, independently and in combination.
3) BB Gupta et al. (2022) provided a technique for resolving authentication and security issues in
Intelligent Transport Systems (ITS) using lightweight cryptography and graph-based machine
learning. This solution uses the concepts of identity based authentication technique and graph-
based machine learning in order to provide authentication and security to the smart vehicle in ITS.
4) C Wallmann et al. (2021) analyzed transport data on the worldwide distribution network for 1.2
million vehicles manufactured and distributed. To identify central nodes in this network, they
calculated various centrality measures from social network analysis.
5) Suchat Tachaudomdach et al. (2021) undertook a study with an aim to quantitatively measure
transportation infrastructure robustness, a proactive dimension of resilience capacities and capabilities to
withstand disasters like floods
6) Lordan, O., & Sallan, J. M. (2020) used the shortest paths in a transportation systems to define dynamic
network, node and edge measures and to analyse the topology of transportation networks, comparable
with measures obtained from static representations. They found remarkable differences between
measures of static and dynamic representations, demonstrating the limitations of the static representation
to obtain accurate information of transportation networks.
7) Yujing Wang et al. (2020) proposed a methodological framework for geospatial network analysis that
combines spatial and network analysis to analyse the spatial configuration of Urban Bus Networks. Their
study provides meaningful insights for policy makers and planners seeking to optimize traffic infrastructure
planning.
8) Closeness centrality has been analytically reformulated incorporating travel time delay and commuter flow
volume to study disruption in subway networks by Cheng, Y.Y. et al. (2015). It is considered as a measure
worthy of further investigation in transportation networks.
9) Goremyko, M.V. et al.(2018) applied the betweenness centrality to reveal the main transport
routes in a network which is a backbone of a country by considering the demographic data of a
country.
10) Wang, Y. et al. (2016) applied the betweenness centrality to determine port significance in
maritime container transportation.
11) Gao, S. et al. (2013) applied the betweenness centrality to predict taxi traffic flow in a country for
Understanding urban traffic-flow characteristics.
12) The eigenvector centrality measure proposed by Bonacich, P. et al. (1987) responded to the
restriction of degree centrality, where the importance of a node is defined only by the number of
connections it has with other nodes. Degree centrality does not take into account the importance
of the nodes with which a given node is connected and considers equally important two nodes
with, for example, four connections to other nodes. Conversely, eigenvector centrality takes into
account the importance of these four nodes by examining the degree centrality of those nodes.
13) Puzis, R. et al. (2013) applied the betweenness centrality in order to analyze the traffic flow
in a urban city to augment the environmentally aware traffic monitoring system.
14) Liu, W. et al. (2019) used the betweenness centrality for approximation to identify key nodes
in a weighted urban complex transportation network.
15) Aydin, N.Y. et al. (2019) applied the betweenness centrality to identify changes in critical
locations for transportation networks.
16) Flow betweenness centrality was introduced by Freeman, L.C. Et al. (1991) which measures
the flow that passes through a node which is on a path between two others.
Centrality Measures in
Transportation
Centrality measures can be used to identify the
relative importance of nodes in transportation
networks, which can help with transportation
planning and management.
Nodes with high betweenness centrality can
represent crucial intersections or hubs in
transportation networks. Disruption or congestion
at these nodes could lead to significant delays or
disruptions throughout the network.
Betweenness Centrality
Measures
Measures a node's importance based on shortest paths through it.
Identifies critical connectors in the network.
One of several measures of node importance.
Used in social, transportation, and biological networks.
Scope of the Research
The research will involve constructing models of both synthetic and real-world transportation
networks, utilizing data on traffic flow and infrastructure.
A key part of the study will be the comparative analysis of different centrality measures to
evaluate their accuracy and relevance in representing congestion hotspots.
Insights derived from this research are expected to support the development of data-driven
strategies for traffic management, aiding city planners and engineers in reducing congestion and
improving mobility within urban areas.
References
1) Mussone, L., Viseh, H., & Notari, R. (2022). Novel centrality measures and applications to underground
networks. Physica A: Statistical Mechanics and its Applications, 589, 126595.
2) Chakrabarti, S., Kushari, T., & Mazumder, T. (2022). Does transportation network centrality determine housing
price?. Journal of Transport Geography, 103, 103397.
3) Gupta, B. B., Gaurav, A., Marín, E. C., & Alhalabi, W. (2022). Novel graph-based machine learning technique to secure
smart vehicles in intelligent transportation systems. IEEE transactions on intelligent transportation systems, 24(8), 8483-
8491.
4) Wandelt, S., Xu, Y., & Sun, X. (2023). Measuring node importance in air transportation systems: On the quality
of complex network estimations. Reliability Engineering & System Safety, 240, 109596.
5) Aparicio, J. T., Arsenio, E., & Henriques, R. (2022). Assessing robustness in multimodal transportation
systems: a case study in Lisbon. European transport research review, 14(1), 28.
6) Bhatia, U., Sela, L., & Ganguly, A. R. (2020). Hybrid method of recovery: combining topology and optimization
for transportation systems. Journal of Infrastructure Systems, 26(3), 04020024.
7) Wallmann, C., & Gerschberger, M. (2021). The association between network centrality measures and supply
chain performance: The case of distribution networks. Procedia Computer Science, 180, 172-179.
8) Mazzarisi, P., Zaoli, S., Lillo, F., Delgado, L., & Gurtner, G. (2020). New centrality and causality
metrics assessing air traffic network interactions. Journal of Air Transport Management, 85,
101801.
9) Tachaudomdach, S., Upayokin, A., Kronprasert, N., & Arunotayanun, K. (2021). Quantifying road-
network robustness toward flood-resilient transportation systems. Sustainability, 13(6), 3172.
10) Lordan, O., & Sallan, J. M. (2020). Dynamic measures for transportation networks. PloS
one, 15(12), e0242875.
11) E. Nasiri, K. Berahmand, Z. Samei, and Y. Li, “Impact of centrality measures on the common neighbors in link
prediction for multiplex networks,” Big Data, vol. 10, no. 2, pp. 138–150, 2022.
12) [33] K. Berahmand, N. Samadi, and S. M. Sheikholeslami, “Effect of richclub on diffusion in complex
networks,” International Journal of Modern Physics B, vol. 32, no. 12, p. 1850142, 2018.
13) [34] K. Berahmand, A. Bouyer, and M. Vasighi, “Community detection in complex networks by detecting and
expanding core nodes through extended local similarity of nodes,” IEEE Transactions on Computational
Social Systems, vol. 5, no. 4, pp. 1021–1033, 2018.
14) “A python implementation of transport centrality calculation using networkx,” 2023,
https://github.com/ProfMahendraPiraveenan/Transport-Cetrality. [Online]. Available:
https://github.com/ProfMahendraPiraveenan/Transport-Cetrality
15) Wang, Y.; Deng, Y.; Ren, F.; Zhu, R.; Wang, P.; Du, T.; Du, Q. Analysing the spatial configuration
of urban bus networks based on the geospatial network analysis method. Cities 2020, 96,
102406.
16) Armour, C.; Fried, E.I.; Deserno, M.K.; Tsai, J.; Pietrzak, R.H. A network analysis of DSM-5
posttraumatic stress disorder symptoms and correlates in US military veterans. J. Anxiety
Disord. 2017, 45, 49–59.
17) Wu, X.; Dong, H.; Tse, C.K.; Ho, I.W.; Lau, F.C. Analysis of metro network performance from a
complex network perspective. Physica A 2018, 492, 553–563.
18) Cheng, Y.Y.; Lee, R.K.W.; Lim, E.P.; Zhu, F. Measuring centralities for transportation networks
beyond structures. In Applications of Social Media and Social Network Analysis; Springer:
Cham, Switzerland, 2015; pp. 23–39.
19) Goremyko, M.V.; Makarov, V.V.; Hramov, A.E.; Kirsanov, D.V.; Maksimenko, V.A.; Ivanov, A.V.;
Yashkov, I.A.; Boccaletti, S. Betweenness centrality in urban networks: Revealing the
transportation backbone of the country from the demographic data. In IOP Conference
Series: Earth and Environmental Science; IOP Publishing: Bristol, UK, 2018; Volume 177, p.
012017.
20) Wang, Y.; Cullinane, K. Determinants of port centrality in maritime container transportation.
Transp. Res. Part E Logist. Transp. Rev. 2016, 95, 326–340. [CrossRef]
21) Gao, S.;Wang, Y.; Gao, Y.; Liu, Y. Understanding urban traffic-flow characteristics: A rethinking
of betweenness centrality. Environ. Plan. B Plan. Des. 2013, 40, 135–153.
22) Puzis, R.; Altshuler, Y.; Elovici, Y.; Bekhor, S.; Shiftan, Y.; Pentland, A. Augmented betweenness
centrality for environmentally aware traffic monitoring in transportation networks. J. Intell.
Transp. Syst. 2013, 17, 91–105. [CrossRef]
23) Liu, W.; Li, X.; Liu, T.; Liu, B. Approximating betweenness centrality to identify key nodes in a
weighted urban complex transportation network. J. Adv. Transp. 2019, 2019, 9024745.
[CrossRef]
24) Aydin, N.Y.; Casali, Y.; Sebnem Duzgun, H.; Heinimann, H.R. Identifying changes in critical
locations for transportation networks using centrality. Comput. Urban Plan. Manag. Smart
Cities 2019, 16, 405–423.
25) Freeman, L.C.; Borgatti, S.P.; White, D.R. Centrality in valued graphs: A measure of
betweenness based on network flow. Soc. Netw. 1991, 13, 141–154.
26) Bonacich, P. Power and centrality: A family of measures. Am. J. Sociol. 1987, 92, 1170–1182.
THANK
YOU

You might also like