Journal of International Logistics and Trade
Jungseok Research Institute of International Logistics and Trade

Maritime Transport Network Analysis: A Critical Review of Analytical Methods and Applications

Maneerat Kanrak*, Hong Oanh Nguyen, Yuquan Du
National Centre for Ports and Shipping, Department of Maritime and Logistics Management, Australian Maritime College, University of Tasmania, Tasmania, Australia
*Corresponding author: National Centre for Ports and Shipping, Department of Maritime and Logistics Management, Australian Maritime College, University of Tasmania, Newnham Dr, Newnham TAS 7248, Australia; Email:

© Copyright 2019 Jungseok Research Institute of International Logistics and Trade. This is an Open-Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License ( which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.

Received: Nov 06, 2019; Accepted: Dec 30, 2019

Published Online: Dec 31, 2019


This paper presents a critical review of the economic network analysis methods and their applications to maritime transport. A network can be presented in terms of its structure, topology, characteristics as well as the connectivity with different measures such as density, degree distribution, centrality (degree, betweenness, closeness, eigenvector and strength), clustering coefficient, average shortest path length and assortative. Various models such as the random graph model, block model, and ERGM can be used to analyse and explore the formation of a network and interaction between nodes. The review of the existing theories and models has found that, while these models are rather computationally intensive, they are based on some rather restrictive assumption on network formation and relationship between ports in the network at the local and global levels that require further investigation. Based on the review, a conceptual framework for maritime transport network research is developed, and the applications for future research are also discussed.

Keywords: Transportation networks; Shipping network; Statistical properties; Network analysis; Models and applications

1. Introduction

Transportation networks including those for rail, air, road and maritime transport play a critical role for the economy in terms of production, consumption and international trade. The maritime sector helps to move more than 90% of world trade by volume. Network research is an emerging area applied to various disciplines including maritime transport. In general, network comprises of two basic components including nodes and edges. A node is a set of basic elements, entities or fundamental units. An edge is the set of node pair which presents the relationship or connection between nodes. The connectivity between nodes of a network depends on the nature of the network. In transport networks, nodes are transport ports or terminals connected by transport service. In a maritime transport network, nodes or vertex can be seaports, dry ports, terminals and depots, and links or edges refer to transport service such as shipping, road, rail and air transport services.

In the last decade, various aspects of maritime networks have been studied including network flows (Ducruet, 2016), worldwide production network (Jacobs et al., 2010), liner cooperation or port resilience networks (Justice et al., 2016; Wilmsmeier, 2016) and intermodal transport networks (Lee et al., 2014). Many studies have focused on network configurations and organizations, e.g. the hierarchies and statuses of port networks (Ducruet et al., 2010a; Ducruet et al., 2010b), competition and cooperation (Jacobs, 2007), the containerization, globalization, and regionalization of ports (Notteboom and Rodrigue, 2005; Rodrigue and Notteboom, 2013), network competition and topology analysis (Nguyen, 2014; Tsiotas and Polyzos, 2015), operations research of networks (Christiansen et al., 2013; Meng et al., 2013).

Recently, social network analysis (SNA) has been emerging as a new approach to study networks and applied to various disciplines such as sociology, biology, economics, information, management and economics. The main focus of SNA is on the formation and connectivity of a network as a whole, while allowing for the random nature of connectivity and its effect on network formation. It also covers new aspects of a network, such as centrality measures, network density and diameter, and clusters in a network that have not been considered from the perspectives of operations research and other approaches. This study’s objective is to review the SNA applications to maritime transport. This paper is divided into four sections. The next section provides the related measure and statistical properties used to analyse the network. Section 3 explains the network models and their applications to maritime transport research. Section 4 is the discussion of the implications for future research and conclusion.

2. Network related measures and statistics

Network measures are descriptive statistics of a network providing essential information about its properties. This section presents the properties of a network in terms of its key measures and statistics, which are then used in network models to be reviewed in this paper. A network, often presented a graph is denoted as G(N,L) comprising of a set of nodes N ={n1,n2,…,nN} and a set of edges L ={l1,l2,…,lL} that connect the nodes. The graph G of a binary network, in which a link can be either zero or one, yes or no, can be represented using an adjacency matric Y with dimension N×N, where yij = 1 if an edge exists from nodes i to j, yij = 0 if otherwise. Alternatively, a binary network can also be expressed using its edge list E which has two column matrices with edge l given by lth row of E, el1 denotes the origin node of edge l and el2 is the destination node of the edge. In a weighted network, in which a link can take any positive value as opposed to zero and one, a graph G will be described in terms of non-negative integer values for the entities in Y.

2.1 Density

One important measure of a network is its density, which indicates the level of its connectivity between its nodes. The density of a network is defined as the proportion of the total number of edges m(G) and the maximum possible number of edges mmax(G) (Oliveira and Gama, 2012):

ρ ( G ) = m ( G ) m max ( G ) , 0 < ρ < 1

where mmax(G) is n(n−1)/2 for the undirected network, n(n−1) for the directed network. A high value of density indicates that the nodes are closely connected (Yang et al., 2018). The density can also be used to identify a complete network, namely if the network has ρ = 1 which implies that a network is complete, i.e. with all nodes connected. Conversely, if a network has ρ < 1 which means the network is sparse or incomplete.

For a maritime transport network, the density measure can be used to indicate the level of service coverage. Hu and Zong (2013) used the network density concept to describe the tightness of the port-shipping network in China. Ducruet and Notteboom (2012) used the network density measure to examine the characteristics of the global container shipping network, while Tsiotas and Polyzos (2015) analysed the density of the maritime transport system in Greece.

2.2 Degree distribution

Degree distribution indicates the connectivity of nodes in a network and is one of the most important network statistics (Hu and Zong, 2013). It measures the probability distribution (pk) which comes from the fraction of nodes which have degree k(nk) and the total numbers of nodes (N) in a network:

p ( k ) = n k N

The degree distribution reflects the overall or global connectivity of the network system (Liu et al., 2012). For example, in a Binomial random graph model (presented below), where p denotes the probability that a node is connected by an edge, then the degree distribution is (Jackson, 2011):

p ( k ) = ( n 1 k ) p k ( 1 p ) n 1 k

For a network with a large n and small p, the degree distribution is can be approximated by Poisson distribution:

p ( k ) = e ( n 1 ) p ( ( n 1 ) p ) k k !

When degree distribution follows the power law, a network is scale free. Namely, there are a small number of nodes that have high connectivity, and a large number of nodes that have low connectivity (Liu et al., 2018b).

Degree distribution has been used in many studies on maritime transport networks to examine the characteristics of shipping and port networks. For example, Tsiotas and Polyzos (2015) used degree distribution to investigate the characteristics of the maritime transport system in Greece. It is used to analyse topological property of the “Maritime Silk Road” shipping network and especially for container shipping (Jiang et al., 2019). It also is used to study the characteristic of the China, Japan and Korea shipping network (Guo et al., 2017). Existing studies have also used degree distribution to explore the characteristics of three types of network, i.e. regular, scale-free and random networks (Bagler, 2008; Jiang et al., 2019; Tsiotas et al., 2018).

2.3 Centrality

Centrality is used to explore a network at the local level, i.e. concerning a node, especially its importance or popularity through its connectivity with other nodes in the network. SNA uses various centrality measures. Degree centrality, the most basic measure of centrality, of a node is defined as the sum of a number of edges connected to it (Freeman, 1978):

C D ( i ) = j = 1 n a i j

where aij is one if nodes i and j are linked by an edge and is zero otherwise. Given the role of ports as logistics nodes providing access to other ports and the hinterland, the degree centrality is a useful indicator of how well the port is connected in the network; a high degree centrality indicates that it is important (Zhang et al., 2018), well connected in the network or region (Hadas et al., 2017), highly influential (Lu et al., 2018). It can also be used to indicate the importance of a hub and central port in the network (Jiang et al., 2019; Tran and Haasis, 2014).

For a weighted network, the degree centrality of a node can be calculated in terms of the strength centrality based on the weights of edges, not on the number of edges (Opsahl et al., 2010). So, the strength centrality is used to analyse the strength of a node in a weighted network by estimating the sum of weights of the edges which connect to it (Liu et al., 2018a):

C S ( i ) = j V a i j w i j

where V is the set of neighbours of node i, wij is the weight of an edge which connects between nodes i and j. The strength centrality is used to analyse the hierarchical and connectivity level of ports. Ports with a high strength centrality dominate the shipping network and hold leading positions. This measure is also used along with others measure to define the ego of a network to analyse the spatial heterogeneity of the network (Liu et al., 2018b).

While degree centrality can be used to show the importance of a node, it only concerns its immediate neighbours and does not consider the nodes in the network that are indirectly connected to it. Betweenness centrality overcomes this limitation of the degree centrality measure. It is a measure of the extent to which a node lies on paths between other nodes in a network (Newman, 2010). Thus, it considers the role of a node through its indirect links with other nodes in the entire network. Formally, betweenness centrality of a node is the sum of the fraction of the shortest paths (geodesic) that pass through it (Newman, 2005):

C B ( i ) = s i t σ s t ( i ) σ s t

where σst(i) is a number of geodesics from nodes s to t that pass through node i and σst is the number of geodesics from nodes s to t. Nodes with high betweenness may have much influence in a network through their control over information passing between other nodes (Newman, 2010). This measure can be used to identify the central role of a port in a region; ports with high betweenness centrality have more potential accessibility (Hadas et al., 2017). The measure can also be applied to find the ports which play the intermediary role or as a hub port in the network (Jeon et al., 2019). Hu and Zhu (2009) argued that the betweenness centrality can also be used with degree centrality to identify the potentially congested ports in a busy maritime network.

The fourth measure of centrality is closeness centrality, a measure based on the average shortest paths between nodes (Li et al., 2015). Thus, the closeness centrality of a node is defined as the inverse of average farness, which is the average length of the shortest paths from that node to all of the other nodes in the network (Jackson, 2010):

C C ( i ) = N 1 j ( i , j )

where l(i,j) is a number of edges in the geodesic between nodes i and j. Nodes have a higher closeness centrality are important more than other nodes (Zhao et al., 2014).

Because the average shortest path of a port indicates the average number of shipping routes passing through it in the network (Tsiotas and Polyzos, 2015), closeness centrality can be used to evaluate the central or hub ports in the network based on the shortest path concept (Kang and Woo, 2017). In other words, it can be used to assess the reachability of a port to the other ports in the studied region (Li et al., 2015). It is also a useful measure of a shipping lines’ service coverage or “shipping accessibility” of ports in the network (Zhao et al., 2014).

The betweenness and closeness measures of centrality mentioned above indicate the centrality of a node purely in terms of its connectivity with the other nodes in the network. One aspect of these measures is that they treat ‘the other nodes’ equally. For example, two nodes having the same value of degree centrality are regarded as equally important in the network. The above centrality measures overlook the importance of the other nodes that a node is connected to in the network; all else being the same, a port with a link to a central or hub port is considered as more important than one with a link to a regional or peripheral port.

Eigenvector centrality overcomes the limitation of the above centrality measures; it measures the centrality of a node in terms of the connectivity within the network as well as the importance of those that are connected to it. This means the calculation of the centrality of node requires the calculation of the centralities of the other nodes (j≠i) that are connected to node i. The use of eigenvector helps to solve this interdependence issue (Bonacich, 1972), where a node becomes important because it is connected to other important nodes (Jackson, 2010). Eigenvector centrality is proportional to the sum of neighbours’ centrality:

C e ( i ) = a j y i j c j

where a is the constant, yij is one if j is connected to i and zero otherwise, Cj is the centrality of node j (Jackson, 2010). Since yij are the elements of adjacent matrix Y, solving the system of equation (9-a) for all nodes is equivalent to solving for the eigenvector Ce of Ce(i) in the following equation:

C e = a Y C e

Because eigenvector centrality indicates the importance of ports in terms of its connectivity with important ports in the network (Lu et al., 2018), it can be used to evaluate the central role of ports (Shanmukhappa et al., 2018) and to measure the “development potential” of a port (Zhao et al., 2014).

2.4 Clusters in a network

A clustering coefficient is a measure of a network considering its clusters. It is based on the notion that nodes with similar characteristics or attributes tend to cluster into the same group (cluster) (Holland and Leinhardt, 1971; Watts and Strogatz, 1998). The clustering coefficient measures the network cohesion at the local and global level (Hu and Zhu, 2009). At the local level, consider the neighborhood of a node. The local clustering coefficient of a node (Ci) is the number of links between the nodes within its neighborhood (Ei) divided by the number of possible links between them (Watts and Strogatz, 1998):

C i = E i k i ( k i 1 ) / 2

where ki is a number of nodes in the neighborhood of node i.

At the global level, the global clustering coefficient of a network is the sum of clustering coefficients of all nodes divided by the number of nodes (n) in the network:

C = 1 n i = 1 n C i

Nodes with similar characteristics are classified into the same cluster leading to a network with a high density of edges. A node that has a high clustering coefficient is likely to be connected to other nodes with a short distance (Wang et al., 2011). This measure can be applied to study the characteristics of maritime networks, especially the level of shipping connection between the neighborhood of a port (Guo et al., 2017; Jiang et al., 2019). It can be used as an index showing the local shipping services around a port (Tsiotas and Polyzos, 2015). The hierarchical structure of a maritime transport network also can be analysed using the clustering coefficient (Liu et al., 2018a).

2.5 Average shortest path length

The average shortest path length of a network (L) is the sum of the shortest paths (geodesics) for all pairs of the nodes (dij) divided by the maximum possible number of edges:

L = 1 n ( n 1 ) i j d i j

L can be used to measure the efficiency of a network in terms of its connectivity; a small value means the network’s connectivity is highly efficient and vice versa. In maritime transport networks, the smaller, the value of the average distance between any two ports, the less transshipment and cargo transfer required to transport goods within the network (Hu and Zhu, 2009; Hu and Zong, 2013). The average shortest path length is also used to analyse the cooperative level within a network. A network with a small number of average shortest path length is considered as a tight network where ports are closely connected to each other (Caschili et al., 2014).

2.6 Assortativity

Assortativity is the measure of tendency in which nodes are mostly linked to nodes of similar attributes (Piraveenan et al., 2009). In other words, there is a tendency for a node to connect with other nodes similar to it in some ways.

Typically, the similarity is often measured in terms of nodes’ degrees. The literature has several measures of assortativity. For example, it can be calculated as the average nearest neighbor degrees of a node in the network (Hu and Zhu, 2009):

k n n , i = 1 k i i a i j k j

where knn,i is the average degree of the nearest neighbours of a node i with degree k, denoted as knn(k). Networks will be called ‘assortative’ if knn(k) is an increasing function of k. If knn(k) is a decreasing function of k, networks will be referred to as ‘disassortative’. In the case of weighted networks, the average degree of the nearest neighbours can be calculated by:

k n n , i w = 1 s i i a i j w i j k j

Assortativity can be used to probe the architecture or the hierarchy structure of a maritime network (Hu and Zhu, 2009). Tran and Haasis (2014) stated that shipping lines tend to connect ports which have similar degree characteristics. In addition, the assortativity used to be one of the other topological properties to analyse the network structure (Ducruet and Notteboom, 2012). It also used to analyse the connection of ports in the multilayer network (Ducruet, 2017). Table 1 provides a summary of all measures to give a better understanding of network statistical properties.

Table 1. Comparing network measures and its applications
Network measure Advantages Disadvantages Applications
Density - Provides the probability of an edge connects between nodes
- Identifies the sparse or complete networks
- Reflects only the global level of connectivity in the network - Indicates shipping service coverage and connectivity level
- Examines characteristics and tightness of shipping network
Degree distribution - Describes the probability distribution of connectivity at the global level
- Investigates network characteristics
- Does not reflect the local connectivity level and characteristics of nodes - Examines characteristics, connectivity and topological properties of the maritime transports network
Degree centrality - Analyses the connectivity level of each node
- Examines the importance, popularity, hub and centrality of nodes
- Considers only on nearest neighbour nodes
- Does not consider indirect connections
- All nodes are treated equally
- Focuses only on local analysis
- Indicates important, hub and central ports
- Examines the connectivity level of shipping ports
Strength centrality - Shows the importance or strength of nodes considering weights of edges in weighted networks - Concerns only on immediate neighbours
- Does not consider indirect links and a number of edges
- Analysis of the hierarchical ports and connectivity level of ports
- Identifies the leading position of ports
Betweenness centrality - Identifies the influence, central and controlling of nodes
- Considers the indirect connection between nodes
- Consider only a link between two nodes
- Treats all nodes equally
- Identifies potential accessibility, intermediate role and hub of ports
Closeness centrality - Reflects the global level analysis of nodes
- Presents the average shortest path of a node
- Considers indirect links
- Treats other nodes equally
- Does not concern the connection between two nodes
- Evaluates central and hub ports, shipping reachability and accessibility of ports
Eigenvector centrality - Looks at the importance of other nodes considering nodes’ centralities
- Identifies an important node
- Treats other nodes differently
- Considers only the connections between important nodes
- Identifies development potential and central role of ports
Clustering coefficient - Analysis of the local and global levels of network cohesion
- Classifies the network into subnetworks
- Does not consider the connections of nodes between clusters
- Considers only nodes have the same attributes
- Investigates the connection between the neighbourhoods of a port, and the hierarchical structure of the network
- Shows the local shipping service around a port
Average shortest path length - Measures the network efficiency in terms of geodesics between all pairs of nodes - Does not reflect the efficiency of the local level or nodes - Examines the network efficiency and tightness of maritime networks
- Analysis of the cooperative level within the network
Assortativity - Analysis of the tendency of a connection between nodes have similar characteristics - Does not reflect the connectivity of nodes have different attributes - Examines network structure and connectivity of ports have similar degree characteristics
Download Excel Table

3. Network models, their applications to maritime transport and implications for future research

3.1 Random graph model

This and next sections review the network models that have been applied to maritime economic research. Among this is the random graph model, also known as Erdős and Rényi (1959) model that integrates graph theory and probability theory (Frieze and Karoński, 2016). This model is often applied as a benchmark to study the topology and connectivity of a network (Karyotis and Khouzani, 2016). The assumption of the model is the random assignment of edges to nodes and lead to various properties of network structure (Newman, 2003). The model can be specified depending on the probability distribution resulting in specific random graphs.

A uniform random graph is often denoted as G(n,m) with n being the number of nodes and m being the number of links or edges where 0m(n2). A random graph model is based on the uniform probability distribution of links (Frieze and Karoński, 2016):

p ( G ) = ( ( n 2 ) m ) 1

A binomial random graph is often denoted as G(n,p), where n being a number of nodes and p being a probability that a link is assigned to a pair of nodes. The probability of a graph G(n,p) can be calculated as follows (Frieze and Karoński, 2016):

p ( G ) = p m ( 1 p ) ( n 2 ) m

The random graph model focuses only on topologies of networks with a probability distribution of edges. The model does not consider how edges and nodes are formed (Cai, 2017). In maritime transport networks, even there is no research has been done in network analysis using this model. A forthcoming paper uses the random graph model to analyse the formation of a cruise shipping network and its properties.

3.2 Block model

As an alternative to the random graph model, the block model aims to decompose a network into clusters by mapping nodes that have similar characteristics into clusters or groups (Salter-Townshend et al., 2012). The model provides an analysis of interactions between and within network clusters. Thus, the connection between nodes i and j is not formed randomly but instead depends on their characteristics. The probability of the link between i and j in the block model can be specified as (Jackson, 2010):

log p i j 1 p i j = β i X i + β j X j + β i j | X i + X j |

where Xi and Xj are the vectors of characteristics of i and j, while βi and βj are vector parameters of i and j respectively. The model can be used to check the homophily of a network (McPherson et al., 2001). Typically block modelling is used to analyse community detection (Oliveira and Gama, 2012). The model can be applied to identify clusters in a maritime network in terms of the stochastic block model (SBM) (Bouveyron et al., 2015). Thus, it can be applied to analyse port choice decisions; how various factors affect the decision to run shipping service between two ports.

3.3 Exponential random graph model

Although the random graph and block models presented above can be applied to understand many properties of a network, these models need to be extended to investigate the homophily and the effect of various factors on network formation (Newman, 2003). The exponential random graph model (ERGM) of G(n,p) model is deployed to fill this graph. ERGM is a statistical model of social networks that explains the formation of networks, network links and relationships. It is based on the assumption that the emergence of a relationship might be influenced by other relationships or individual characteristics, represented as (Robins, et al. 2007):

Pr ( Y = y ) = 1 k exp { A η A g A ( y ) }

where k is the normalizing constant to ensure that (18) is a proper probability distribution, ηA is the parameter vectors corresponding to the configuration of type A, and gA(y) is network statistic.

ERGM can be used to infer the formation of relationships in a network (Jiao et al., 2017) and to study the relationships between individuals and factors influential to the connection establishment (Cranmer and Desmarais, 2011). Because ERGM can be applied to simulate the random networks with a set of components, it makes use of essential information about the network structure such as degree distribution and the number of edges, triangles and connected components (Mukherjee, 2011). The model could be adopted to maritime transport networks and to investigate the homophily of ports and the influence of ports’ characteristics on the network.

Despite its potential application to transport network research, it is interesting to note that no study has been found applying ERGM, with a notable exception is Guo et al. (2017) that applied the Barabási-Albert scale-free random network model with a preferential attachment mechanism. The author found the degree distribution of the China-Japan-Korea shipping network follows the power-law distribution. Moreover, the maritime traffic flow exhibits a hierarchy where hub ports play a central role in network connectivity.

3.4 Implications for future research

Although network measures and models are applied to many disciplines of network research, limited research has been found applying network analysis, especially social network analysis, such as the block model, random graph model, and exponential random graph models. Thus, future research can focus more on SNA applications to investigate the formation, connectivity, centrality, relationship and cooperation between nodes in transport networks. For example, the cooperation of ports in a network can be analysed through the application of the game theory to networks combining game-theoretic and network analyses. The connectivity of the maritime network affected by ports’ attributes and so on.

As many networks are not ‘fixed’ in nature but instead constantly expanding and changing with new nodes and link being formed, while some current nodes and links vanished, network dynamics and its effects on the behaviour of nodes and links merit further investigation. Future research could, for example, examine how cruise ship voyages can be planned considering the available (presumably fixed) network’s nodes as well as available voyages. The paper does not show the relation of network analysis model which can be connected to other models, for example, optimization model. So, future work can also incorporate other network aspects and models into SNA.

To be more practical, the analysis can be extended to allow for dynamic networks with changing nodes and links (voyages). For simplicity, much research assumes homogenous nodes and undirected links, while they are not. Therefore, future research may relax such an assumption. Figure 1 presents a maritime network analysis (MNA) framework as an example of how SNA can be applied to maritime transport.

Figure 1. Maritime network analysis framework
Download Original Figure

4. Conclusion

This paper reviewed the applications of the network theory especially social network analysis models to maritime networks, where ports are nodes linked by shipping services. It has been found that various network measures are useful in helping to explore the properties of transport networks. For example, density can be used to measure the connectivity of the entire network, at the global level. Similarly, degree distribution can be used to explore the topology of maritime networks, i.e. whether the network is scale-free, depends on whether degree distribution follows the power law.

At the local level, the importance of an individual node in the network can be evaluated using various measures of centrality, including degree, betweenness, closeness and eigenvector centrality. While degree centrality indicates the connectivity of a node to other nodes in the network, it only takes into account the nearest neighbour nodes. One the other hand, betweenness and closeness centrality can be used to measure the role of an individual node in the entire network, given the number of shortest links passing through it and distance to all other nodes in the network, respectively. However, none of these measures takes into account the importance of the nodes that a node understudy is connected to. This is where eigenvector centrality can be applied, giving the indication of ‘not what you know but who you know’.

SNA can also be applied to study clusters or subnetworks within a network. The relationship between ports in the same group can be analysed using the clustering coefficient base on their characteristics or attributes. This measure is also used to analyse the topology of networks in terms of the small-world network (high clustering coefficient). While the assortativity is useful for analysis of the connectivity of ports with similar attributes. The average shortest path length is deployed to analyse the efficiency of a transport network.

The random graph model provides a basic framework for further analysis of a network’s formation. It assumes that nodes can be connected by edges with independent probability addressing the random nature and many important resulting properties of social, economic and transport networks. The model can be specified depending on specific probability distributions, including uniform, binomial and Poisson random graphs. Block model analyses the network formation considering the characteristics of nodes belonging to different groups with similar attributes. This model can be applied to analyse the interaction between members within the group and between groups. The exponential random graph model is an extension to the random graph model and can be applied to examine the homophily and the effect of the influential factors on network formation.

Despite metrics and models reflect the properties of maritime networks and ports, limited research applied the SNA to investigate maritime transport in many aspects, especially spatial metrics. Thus, the metrics should be adopted or used along with other models to present spatial properties and visualization of the networks.



Bagler, G., 2008. Analysis of the airport network of India as a complex weighted network. Physica A: Statistical Mechanics and its Applications 387, 2972-2980.


Bonacich, P., 1972. Factoring and weighting approaches to status scores and clique identification. Journal of Mathematical Sociology 2, 113-120.


Bouveyron, C., Latouche, P., Zreik, R., Ducruet, C., 2015. Cluster Identification in Maritime Flows with Stochastic Methods, In: Ducruet, C. (Eds), Maritime Networks: Spatial Structures and Time Dynamics. Routledge, Paris.


Cai, H., 2017. A note on jointly modeling edges and node attributes of a network. Statistics & Probability Letters 121, 54-60.


Caschili, S., Medda, F., Parola, F., Ferrari, C., 2014. An analysis of shipping agreements: The cooperative container network. Networks and Spatial Economics 14, 357-377.


Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D., 2013. Ship routing and scheduling in the new millennium. European Journal of Operational Research 228, 467-483.


Cranmer, S.J., Desmarais, B.A., 2011. Inferential network analysis with exponential random graph models. Political Analysis 19, 66-86.


Ducruet, C., 2017. Multilayer dynamics of complex spatial networks: The case of global maritime flows (1977-2008). Journal of Transport Geography 60, 47-58.


Ducruet, C., Notteboom, T., 2012. The worldwide maritime network of container shipping: Spatial structure and regional dynamics. Global Networks 12, 395-423.


Ducruet, C., 2016. The polarization of global container flows by interoceanic canals: Geographic coverage and network vulnerability. Maritime Policy & Management 43, 242-260.


Ducruet, C., Lee, S.W., Ng, A.K., 2010a. Centrality and vulnerability in liner shipping networks: Revisiting the Northeast Asian port hierarchy. Maritime Policy & Management 37, 17-36.


Ducruet, C., Rozenblat, C., Zaidi, F., 2010b. Ports in multi-level maritime networks: Evidence from the Atlantic (1996-2006). Journal of Transport Geography 18, 508-518.


Erdös, P. and Rényi, A.,1959. On random graphs, I. Publ. Math. Debrecen 6, 290-297.


Freeman, L.C., 1978. Centrality in social networks conceptual clarification. Social Networks 1, 215-239.


Frieze, A., Karoński, M., 2016. Introduction to Random Graphs. Cambridge University Press, Cambridge.


Guo, J., Wang, S., Wang, D., Liu, T., 2017. Spatial structural pattern and vulnerability of China-Japan-Korea shipping network. Chinese Geographical Science 27, 697-708.


Hadas, Y., Gnecco, G., Sanguineti, M., 2017. An approach to transportation network analysis via transferable utility games. Transportation Research Part B: Methodological 105, 120-143.


Holland, P.W., Leinhardt, S., 1971. Transitivity in structural models of small groups. Comparative Group Studies 2, 107-124.


Hu, B., Zong, G., 2013. Topology analysis of China’s port shipping network. Journal of Software 8, 2581-2586.


Hu, Y., Zhu, D., 2009. Empirical analysis of the worldwide maritime transportation network. Physica A: Statistical Mechanics and its Applications 388, 2061-2071.


Jackson, M.O., 2010. Social and Economic Networks. Princeton university press, Princeton.


Jackson, M.O., 2011. An overview of social networks and economic applications. Handbook of Social Economics 1, 511-585.


Jacobs, W., 2007. Port competition between Los Angeles and Long Beach: An institutional analysis. Tijdschrift voor economische en sociale geografie 98, 360-372.


Jacobs, W., Ducruet, C., De Langen, P., 2010. Integrating world cities into production networks: The case of port cities. Global Networks 10, 92-113.


Jeon, J.W., Duru, O., Yeo, G.T., 2019. Cruise port centrality and spatial patterns of cruise shipping in the Asian market. Maritime Policy & Management 46, 257-276.


Jiang, L., Jia, Y., Zhang, C., Wang, W., Feng, X., 2019. Analysis of topology and routing strategy of container shipping network on “Maritime Silk Road”. Sustainable Computing: Informatics and Systems 21, 72-79.


Jiao, C., Wang, T., Liu, J., Wu, H., Cui, F., Peng, X., 2017. Using exponential random graph models to analyze the character of peer relationship networks and their effects on the subjective well-being of adolescents. Frontiers in Psychology 8, 583.


Justice, V., Bhaskar, P., Pateman, H., Cain, P., Cahoon, S., 2016. US container port resilience in a complex and dynamic world. Maritime Policy & Management 43, 179-191.


Kang, D.J., Woo, S.H., 2017. Liner shipping networks, port characteristics and the impact on port performance. Maritime Economics & Logistics 19, 274-295.


Karyotis, V., Khouzani, M.H.R., 2016. Malware-propagative Markov Random Fields, In: Karyotis, V., Khouzani, M.H.R. (Eds), Malware Diffusion Models for Wireless Complex Networks. Morgan Kaufmann, Boston.


Lee, E., Oduor, P.G., Farahmand, K., Tolliver, D., 2014. A coupled linear programming model with geospatial dynamic trip assignment for global-scale intermodal transportation. Maritime Economics & Logistics 16, 33-54.


Li, Z., Xu, M., Shi, Y., 2015. Centrality in global shipping network basing on worldwide shipping areas. GeoJournal 80, 47-60.


Liu, C., Wang, J., Zhang, H., Yin, M., 2018a. Mapping the hierarchical structure of the global shipping network by weighted ego network analysis. International Journal of Shipping and Transport Logistics 10, 63-86.


Liu, C., Wang, J., Zhang, H., 2018b. Spatial heterogeneity of ports in the global maritime network detected by weighted ego network analysis. Maritime Policy & Management 45, 89-104.


Liu, R.Y., Yuan, Y.P., Tian, S.G., Li, X.J., 2012. Network characteristics analysis of the Xinjiang regional logistic based on complex networks. Key Engineering Materials 522, 804-809.


Lu, W., Park, S.H., Oh, J.G., Yeo, G.T., 2018. Network connection strategy for Small and Medium-sized Ports (SMPs). The Asian Journal of Shipping and Logistics 34, 19-26.


McPherson, M., Smith-Lovin, L., Cook, J.M., 2001. Birds of a feather: Homophily in social networks. Annual Review of Sociology 27, 415-444.


Meng, Q., Wang, S., Andersson, H., Thun, K., 2013. Containership routing and scheduling in liner shipping: Overview and future research directions. Transportation Science 48, 265-280.


Mukherjee, S., 2011. Exponential random graph models. Available at


Newman, M.E.J., 2010. Networks: An Introduction, Oxford University Press, New York.


Newman, M.E.J., 2003. Random graphs as models of networks. Handbook of Graphs and Networks 1, 35-68.


Newman, M.E.J., 2005. A measure of betweenness centrality based on random walks. Social Networks 27, 39-54.


Nguyen, H.O., 2014. Competition in maritime transport networks. Proceedings of the Australian Conference of Economists (ACE) and Econometric Society Australasian Meeting (ESAM) 2014, Tasmania, Australia.


Notteboom, T.E., Rodrigue, J.P., 2005. Port regionalization: Towards a new phase in port development. Maritime Policy & Management 32, 297-313.


Oliveira, M., Gama, J., 2012. An overview of social network analysis. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 2, 99-115.


Opsahl, T., Agneessens, F., Skvoretz, J., 2010. Node centrality in weighted networks: Generalizing degree and shortest paths. Social Networks 32, 245-251.


Piraveenan, M., Prokopenko, M., Zomaya, A.Y., 2009. Local assortativity and growth of internet. The European Physical Journal B 70, 275-285.


Robins, G., Snijders, T., Wang, P., Handcock, M., Pattison, P., 2007. Recent developments in exponential random graph (p*) models for social networks. Social Networks 29, 192-215.


Rodrigue, J.P., Notteboom, T.E., 2013. Containerization, Box Logistics and Global Supply Chains: The Integration of Ports and Liner Shipping Networks, In: Haralambides, H.E. (Eds), Port Management. Springer, London.


Salter-Townshend, M., White, A., Gollini, I., Murphy, T.B., 2012. Review of statistical network analysis: Models, algorithms, and software. Statistical Analysis and Data Mining: The ASA Data Science Journal 5, 243-264.


Shanmukhappa, T., Ho, I.W.H., Tse, C.K., 2018. Spatial analysis of bus transport networks using network theory. Physica A: Statistical Mechanics and its Applications 502, 295-314.


Tran, N.K., Haasis, H.D., 2014. Empirical analysis of the container liner shipping network on the East-West corridor (1995-2011). NETNOMICS: Economic Research and Electronic Networking 15, 121-153.


Tsiotas, D., Polyzos, S., 2015. Analyzing the maritime transportation system in Greece: A complex network approach. Networks and Spatial Economics 15, 981-1010.


Tsiotas, D., Niavis, S., Sdrolias, L., 2018. Operational and geographical dynamics of ports in the topology of cruise networks: The case of Mediterranean. Journal of Transport Geography 72, 23-35.


Wang, J., Mo, H., Wang, F., Jin, F., 2011. Exploring the network structure and nodal centrality of China’s air transport network: A complex network approach. Journal of Transport Geography 19, 712-721.


Watts, D.J., Strogatz, S.H., 1998. Collective dynamics of ‘small-world’ networks. Nature 393, 440-442.


Wilmsmeier, G., 2016. International Maritime Transport Costs: Market Structures and Network Configurations. Routledge, London.


Yang, Y., He, Z., Song, Z., Fu, X., Wang, J., 2018. Investigation on structural and spatial characteristics of taxi trip trajectory network in Xi’an, China. Physica A: Statistical Mechanics and its Applications 506, 755-766.


Zhang, W., Deng, W., Li, W., 2018. Statistical properties of links of network: A survey on the shipping lines of worldwide marine transport network. Physica A: Statistical Mechanics and its Applications 502, 218-227.


Zhao, Y.Z., Zhou, J.M., Kuang, H.B., 2014. Hierarchical structures of hub ports in the global container shipping network based on centralities analysis. Advances in Transportation Studies 3, 3-14.