IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i4p530-d341276.html
   My bibliography  Save this article

Turbulence as a Network of Fourier Modes

Author

Listed:
  • Özgür. D. Gürcan

    (Laboratoire de Physique des Plasmas, CNRS, Ecole Polytechnique, Sorbonne Université, Université Paris-Saclay, Observatoire de Paris, F-91120 Palaiseau, France)

  • Yang Li

    (Laboratoire de Physique des Plasmas, CNRS, Ecole Polytechnique, Sorbonne Université, Université Paris-Saclay, Observatoire de Paris, F-91120 Palaiseau, France
    Southwestern Institute of Physics, Chengdu 610041, China)

  • Pierre Morel

    (Laboratoire de Physique des Plasmas, CNRS, Ecole Polytechnique, Sorbonne Université, Université Paris-Saclay, Observatoire de Paris, F-91120 Palaiseau, France)

Abstract

Turbulence is the duality of chaotic dynamics and hierarchical organization of a field over a large range of scales due to advective nonlinearities. Quadratic nonlinearities (e.g., advection) in real space, translates into triadic interactions in Fourier space. Those interactions can be computed using fast Fourier transforms, or other methods of computing convolution integrals. However, more generally, they can be interpreted as a network of interacting nodes, where each interaction is between a node and a pair. In this formulation, each node interacts with a list of pairs that satisfy the triadic interaction condition with that node, and the convolution becomes a sum over this list. A regular wavenumber space mesh can be written in the form of such a network. Reducing the resolution of a regular mesh and combining the nearby nodes in order to obtain the reduced network corresponding to the low resolution mesh, we can deduce the reduction rules for such a network. This perspective allows us to develop network models as approximations of various types of turbulent dynamics. Various examples, such as shell models, nested polyhedra models, or predator–prey models, are briefly discussed. A prescription for setting up a small world variants of these models are given.

Suggested Citation

  • Özgür. D. Gürcan & Yang Li & Pierre Morel, 2020. "Turbulence as a Network of Fourier Modes," Mathematics, MDPI, vol. 8(4), pages 1-13, April.
    • Handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:530-:d:341276
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/4/530/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/8/4/530/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. M. E. J. Newman & D. J. Watts, 1999. "Scaling and Percolation in the Small-World Network Model," Working Papers 99-05-034, Santa Fe Institute.
    2. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    2. Gancio, Juan & Rubido, Nicolás, 2022. "Critical parameters of the synchronisation's stability for coupled maps in regular graphs," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    3. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    4. Supriya Tiwari & Pallavi Basu, 2024. "Quasi-randomization tests for network interference," Papers 2403.16673, arXiv.org, revised Oct 2024.
    5. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    6. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    7. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    8. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    9. Ferreira, D.S.R. & Ribeiro, J. & Oliveira, P.S.L. & Pimenta, A.R. & Freitas, R.P. & Dutra, R.S. & Papa, A.R.R. & Mendes, J.F.F., 2022. "Spatiotemporal analysis of earthquake occurrence in synthetic and worldwide data," Chaos, Solitons & Fractals, Elsevier, vol. 165(P2).
    10. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    11. Qinghu Liao & Wenwen Dong & Boxin Zhao, 2023. "A New Strategy to Solve “the Tragedy of the Commons” in Sustainable Grassland Ecological Compensation: Experience from Inner Mongolia, China," Sustainability, MDPI, vol. 15(12), pages 1-24, June.
    12. Lahtinen, Jani & Kertész, János & Kaski, Kimmo, 2005. "Sandpiles on Watts–Strogatz type small-worlds," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 349(3), pages 535-547.
    13. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    14. Xueguo Xu & Chen Xu & Wenxin Zhang, 2022. "Research on the Destruction Resistance of Giant Urban Rail Transit Network from the Perspective of Vulnerability," Sustainability, MDPI, vol. 14(12), pages 1-26, June.
    15. Jianhong Chen & Hongcai Ma & Shan Yang, 2023. "SEIOR Rumor Propagation Model Considering Hesitating Mechanism and Different Rumor-Refuting Ways in Complex Networks," Mathematics, MDPI, vol. 11(2), pages 1-22, January.
    16. Xiaokun Su & Chenrouyu Zheng & Yefei Yang & Yafei Yang & Wen Zhao & Yue Yu, 2022. "Spatial Structure and Development Patterns of Urban Traffic Flow Network in Less Developed Areas: A Sustainable Development Perspective," Sustainability, MDPI, vol. 14(13), pages 1-18, July.
    17. Manisha Sawant & Rupali Patil & Tanmay Shikhare & Shreyas Nagle & Sakshi Chavan & Shivang Negi & Neeraj Dhanraj Bokde, 2022. "A Selective Review on Recent Advancements in Long, Short and Ultra-Short-Term Wind Power Prediction," Energies, MDPI, vol. 15(21), pages 1-24, October.
    18. Vincenza Carchiolo & Marco Grassia & Michele Malgeri & Giuseppe Mangioni, 2022. "Co-Authorship Networks Analysis to Discover Collaboration Patterns among Italian Researchers," Future Internet, MDPI, vol. 14(6), pages 1-15, June.
    19. Gregory Gutin & Tomohiro Hirano & Sung-Ha Hwang & Philip R. Neary & Alexis Akira Toda, 2021. "The effect of social distancing on the reach of an epidemic in social networks," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 16(3), pages 629-647, July.
    20. Jie, Ke-Wei & Liu, San-Yang & Sun, Xiao-Jun & Xu, Yun-Cheng, 2023. "A dynamic ripple-spreading algorithm for solving mean–variance of shortest path model in uncertain random networks," Chaos, Solitons & Fractals, Elsevier, vol. 167(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:530-:d:341276. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.