PLoS ONE · 2019 · 13 citations · 80 references
Natural SciencesAerospace EngineeringPhysicsComputational Fluid DynamicsComputational PhysicsFluid DynamicsComputational AerodynamicsMatrix ComputationTurbulenceTurbulent FlowVortex DynamicsVorticity DynamicsComputational Complexity In DynamicsComputational Complexity Of AlgorithmsGraph-theoretic Network AnalysisTurbulence ModelingTurbulent Flow ModelingTurbulent Vortex DynamicsTwo-dimensional Flow ModelingVortical Flow
We demonstrate the effective use of randomized methods for linear algebra to perform network-based analysis of complex vortical flows. Network theoretic approaches can reveal the connectivity structures among a set of vortical elements and analyze their collective dynamics. These approaches have recently been generalized to analyze high-dimensional turbulent flows, for which network computations can become prohibitively expensive. In this work, we propose efficient methods to approximate network quantities, such as the leading eigendecomposition of the adjacency matrix, using randomized methods. Specifically, we use the Nyström method to approximate the leading eigenvalues and eigenvectors, achieving significant computational savings and reduced memory requirements. The effectiveness of the proposed technique is demonstrated on two high-dimensional flow fields: two-dimensional flow past an airfoil and two-dimensional turbulence. We find that quasi-uniform column sampling outperforms uniform column sampling, while both feature the same computational complexity.
80
The PageRank Citation Ranking : Bringing Order to the Web
Lawrence M. Page, Sergey Brin, Rajeev Motwani et al. · 1999 · 12.7K citations
Network Motifs: Simple Building Blocks of Complex Networks
Ron Milo, Shai S. Shen-Orr, Shalev Itzkovitz et al. · Science · 2002 · 7.5K citations
Finding community structure in very large networks
Aaron Clauset, M. E. J. Newman, Cristopher Moore · Physical Review E · 2004 · 7.5K citations · Full text