跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 04:22 — 2026-11-16 04:22(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
新论文 · v1arXiv:2611.09534

Graph representations of dislocation networks

Gaurav Lathiya, Markus Stricker

原文摘要

The mechanical response of a crystal is governed by the evolving network of dislocations it contains, yet quantitatively linking the `state of that network' to its yield stress remains challenging. Here we represent the dislocation networks obtained from discrete dislocation dynamic simulation as graphs, using five distinct graph representations, characterize each network through a compact set of topological properties, and predict the yield stress from these graph properties and the applied strain rate using a standard random forest model evaluated with strain rate stratified cross-validation. The model predicts the yield stress with $R^2\approx0.86-0.90$ across all box sizes and $R^2\approx0.91-0.94$ for larger box sizes, and this accuracy is consistent across all five representations, indicating that the topology-stress relationship is a robust feature of the graph properties rather than an artefact of any single graph representation. We propose graph topology as a compact and robust route for connecting the microstructural state of a dislocation network to its mechanical response in addition to established variables.

cond-mat.mtrl-sci · cs.LG