After the banquet ended, Zhang Yuan hurriedly returned to his own room and opened his personal tablet computer. On it was an idea left to him by his dad—"A New Algorithm for Community Detection."
The ideas left by his dad were all highly innovative.
After pondering for half an hour, Zhang Yuan was surprised to find that this community detection algorithm could be very fittingly applied to the turbulence problem!
"Is it possible to use it?"
A burning flame of enthusiasm rose from within his heart!
Community detection is a very classic problem in graph theory, especially the detection of community structure in complex networks, which is a major research focus in information science.
The nodes in a network can be divided into groups, with relatively dense connections between nodes within a group, and these dense groups of nodes are referred to as a community structure.
According to Zhang Yuan's intuitive idea, a turbulent flow could be seen as a complete community structure.