3.1. Traffic Situation Complex Network in OWF Area
To describe the maritime traffic situation in the waters of OWFs, a dual-layer complex network approach is adopted to measure the relationship between ships and OWFs [
48]. In the first layer, ships serve as nodes, and connections between ships are established to reflect their interaction characteristics. In the second layer, both ships and OWFs act as nodes, and connections are formed based on indicators such as the proximity between ships and OWFs, highlighting the impact of ships on OWFs. By constructing and analyzing this dual-layer complex network, the importance distribution of ships in the OWF waters and their potential threats and impacts on the OWFs can be comprehensively revealed.
In the first layer, define the set of ships as , where each ship node is represented by its geographic coordinates . In the second layer, define the set of wind farms as , where each wind farm node is represented by its center point . The total set of nodes is .
An edge
is created between two nodes
if the approaching rate of nodes
is less than 0. The approaching rate is expressed by the projection of the relative speed of two nodes at relative distances.
where
are the relative distance and speed between
and
, respectively.
The set of ship-to-ship edges (
) and ship-to-wind farm edges (
) are as follows:
Figure 1 is a schematic diagram of the traffic situation complex network in the OWF area. In
Figure 1, ships
and
are in close proximity to each other, forming an edge
. Meanwhile, the ship
and OWF
also shows a tendency to approach each other, thus forming another edge
. Similarly, ship
shows a tendency to approach OWFs
and
, resulting in the generation of corresponding edges. Ship
and OWF
do not have any close proximity interactions with other ships or the OWFs, so no edges are generated between them and any other nodes. In this case,
and
can be ignored when evaluating the maritime traffic situation and identifying key ships.
In this research, we introduced the maritime traffic situation complexity model to establish a weighted complex network. The complexity between ships and the complexity between ships and OWFs are set as the edge weights. The specific calculation method can be referred to in our previous research [
20]. In the first layer, the weight calculation for ship-to-ship edges is as follows:
where
is the weight of the edge between the ship
and ship
at time
.
is the elliptical distance between the ship
and ship
at time
.
is the rate of change in positional proximity between the ship
and ship
at time
.
In the second layer, the weight calculation for ship-to-wind farm edges is as follows:
where
is the weight of the edge between
and
at time
.
is the changing rate as the ship
approaches the OWF
’s boundary at time
.
is the space proximity between the ship
and the OWF
’s boundary at time
.
is the distance between the ship
and the OWF
’s boundary at time
.
as the safety distance from the OWF
’s boundary.
3.2. Ship Importance Calculation Based on Fusion Gravity Model
Node importance evaluation based on the gravity model is a quantitative approach that combines node interactions and network structural features [
49]. It measures the relative importance of nodes in a network by considering their inherent properties, the properties of neighboring nodes, and the relationships between nodes. This approach is commonly applied in complex networks to identify central nodes, key influencers, or critical components. The core idea is that a node’s importance is determined not only by its own characteristics but also by the “attraction” exerted by other nodes in the network. This attraction is modeled using the gravity formula.
where
is the importance of the node
.
is the set of neighbors of node
.
and
are the “mass” of nodes
and
, representing their attributes (e.g., degree, vertex strength, centrality, etc.).
is the distance between nodes
and
(e.g., topological distance (physical distance).
In the complex network constructed in this study, ships and OWFs are regarded as nodes of the network. In such a network, the interactions between nodes and the overall network structure are crucial for evaluating the importance of nodes. Existing gravity model-based approaches typically consider only a single attribute of a node, such as degree or k-shell value, as the mass in the gravity model. Moreover, these methods do not fully account for the varying influence of each node in a real-world maritime traffic complex network. To address these two issues, this study first integrates multiple node attributes—including vertex strength, weighted clustering coefficient, degree centrality, betweenness centrality, and closeness centrality—as the mass of a node. A new fusion gravity model is then proposed to comprehensively evaluate the importance of nodes by incorporating their multi-attribute characteristics. The definition of the node importance indicators is as follows.
- (1)
Vertex strength
In complex network analysis, node attributes are crucial for evaluating a node’s role within the network. In weighted networks in particular, it is important to consider not only the number of connections a node has but also the strength of those connections. Therefore, vertex strength is introduced as a key metric to measure the total interaction intensity between a node and its neighboring nodes. This helps to more accurately reflect the node’s influence and activity within the network. Vertex strength is a measure in complex networks that represents the sum of the weights of edges connected to a given node, indicating the total intensity of its interactions with other nodes. For a node
in a weighted network, the vertex strength
is defined as the sum of the weights of all edges linked to it [
48].
where
is the vertex strength of node
.
is the weight of the edge between nodes
and
.
is the set of adjacent to node
.
- (2)
Weighted clustering coefficient
In complex networks, the clustering coefficient is an important metric used to measure the local connectivity of a node, reflecting the tendency of nodes to form tightly connected groups or “triadic relationships”. In weighted networks, it is not sufficient to consider only the presence of connections; the strength of those connections must also be taken into account to more accurately represent the real-world intensity of interactions between nodes [
50].
For a node
in a weighted undirected network, the weighted clustering coefficient
measures the average strength of connections among its neighbors, weighted by the importance of the links involving the node
. The calculation formula is as follows:
where
is the weighted clustering coefficient of the node
.
is the strength of node
, i.e., the sum of the weights of its connection edges.
is the degree of node
.
is the weight of the edge between node
and node
.
equals 1 if there is an edge between
and
, and 0 otherwise.
and
are neighboring nodes of
.
- (3)
Degree centrality
Degree centrality is a fundamental metric used to measure the importance of a node within a network [
51]. It is based on the number of connections a node has, with the assumption that nodes connected to more nodes are more important within the network. Nodes with high degree centrality typically have greater influence in information flow, resource distribution, and other aspects. Degree centrality is the number of connections a node has, and it is commonly used to reflect the relative importance of that node in the network. For a node
in an undirected network, its degree centrality
is defined as the number of nodes directly connected to it.
where
is the degree centrality of node
.
is the degree of node
.
is node number of the network.
- (4)
Betweenness centrality
Betweenness centrality is a metric in complex networks that measures the importance or intermediary role of a node in the transmission of information across the network [
51]. It reflects how often a node acts as a bridge or intermediary between other nodes, especially when information is transmitted from one node to another. The higher a node’s betweenness centrality, the more central its role in controlling the flow of information within the network. The betweenness centrality
of node
is defined as the proportion of the shortest paths between any two nodes that pass through node
. The calculation formula is as follow:
where
is the betweenness centrality of node
.
represents the number of shortest paths between node
and node
pass through node
.
represents the number of shortest paths between node
and node
.
- (5)
Closeness centrality
Closeness centrality is a measure in complex networks used to assess the average shortest path length from a node to all other nodes. Nodes with higher closeness centrality are often positioned at key points in the network, as they can quickly interact with other nodes [
52]. For a node
, closeness centrality is defined as the inverse of the average shortest path length from the node to all other nodes in the network. The calculation formula is as follows:
where
represents the closeness centrality of the node
.
represents the distance between the nodes
and node
.
After calculating the node importance indicators, the fusion value of the node is computed to integrate the node’s local information in order to evaluate its importance. Generally speaking, the influence of a node on the network is reflected in its own value. We believe that in a local network, the greater the node’s importance indicator value, the greater its influence. In this research, the fusion value of a node is defined as follows:
where
,
,
,
and
represent the maximum vertex strength, maximum weighted clustering coefficient, maximum degree centrality, maximum betweenness centrality, and maximum closeness centrality of the nodes in the network, respectively.
is the weight of the indicator. In this study, the entropy weight method is used to determine the weights of the indicators, and the calculation method is as follows:
- (1)
Data standardization. The max-min standardization method is adopted.
where
is the normalized value.
is the
th indicator value of node
. max(
) is the maximum value of the
lth indictor and min(
xl) is the minimum value of the lth indictor.
- (2)
Entropy of each indicator. The entropy of each indicator can be calculated as follows:
where
is the number of nodes,
can be calculated as follows:
- (3)
Weight calculation. According to the entropy el of each indicator, the weight wl of the indicator can be determined as follows:
where
m is the number of the indicator.
Inspired by the law of gravity, the interaction between two objects in the real world is directly proportional to their masses and inversely proportional to the square of the distance between them. Based on this principle, in the model, the fusion values
and
of nodes
i and
j are considered as the “masses” of the respective nodes, while the shortest path distance
between the nodes represents the relative distance between them. Therefore, the importance of a node
based on the fusion gravity model is defined as follows:
where
and
are the fusion values of the node
and node
, respectively,
is the shortest path distance between the node
and node
.