Robertas Navakas, Algis Džiugys, Edgaras Misiulis, Gediminas Skarbalius
{"title":"Construction of velocity similarity graph for velocity field analysis in granular intruder motion","authors":"Robertas Navakas, Algis Džiugys, Edgaras Misiulis, Gediminas Skarbalius","doi":"10.1007/s10035-024-01451-1","DOIUrl":null,"url":null,"abstract":"<p>We present a method based on graph community detection algorithms to analyse velocity fields induced by an intruder particle impinging upon a stationary bed of particles. Based on velocity relations between the pairs of adjacent particles, the “velocity similarity” graphs are built where the graph vertices represent the particles and the edge weights are calculated according to the velocities of the respective particle pairs. A few different expressions for the edge weights are tested. Based on the graph, a Louvain community detection algorithm with the “geographic” null model is used to identify the groups of particles moving in a coordinated manner, represented in the graph as a community of vertices, for which the community detection algorithms developed for graph analysis can be applied. Selection of the expression of the graph edge weights based on the velocities of the respective particles influences the resulting graph structure and thereby has an influence on the community detection results.</p>","PeriodicalId":49323,"journal":{"name":"Granular Matter","volume":"26 4","pages":""},"PeriodicalIF":2.4000,"publicationDate":"2024-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Granular Matter","FirstCategoryId":"5","ListUrlMain":"https://link.springer.com/article/10.1007/s10035-024-01451-1","RegionNum":3,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We present a method based on graph community detection algorithms to analyse velocity fields induced by an intruder particle impinging upon a stationary bed of particles. Based on velocity relations between the pairs of adjacent particles, the “velocity similarity” graphs are built where the graph vertices represent the particles and the edge weights are calculated according to the velocities of the respective particle pairs. A few different expressions for the edge weights are tested. Based on the graph, a Louvain community detection algorithm with the “geographic” null model is used to identify the groups of particles moving in a coordinated manner, represented in the graph as a community of vertices, for which the community detection algorithms developed for graph analysis can be applied. Selection of the expression of the graph edge weights based on the velocities of the respective particles influences the resulting graph structure and thereby has an influence on the community detection results.
期刊介绍：
Although many phenomena observed in granular materials are still not yet fully understood, important contributions have been made to further our understanding using modern tools from statistical mechanics, micro-mechanics, and computational science.
These modern tools apply to disordered systems, phase transitions, instabilities or intermittent behavior and the performance of discrete particle simulations.
>> Until now, however, many of these results were only to be found scattered throughout the literature. Physicists are often unaware of the theories and results published by engineers or other fields - and vice versa.
The journal Granular Matter thus serves as an interdisciplinary platform of communication among researchers of various disciplines who are involved in the basic research on granular media. It helps to establish a common language and gather articles under one single roof that up to now have been spread over many journals in a variety of fields. Notwithstanding, highly applied or technical work is beyond the scope of this journal.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
