图上的分数扩散:拉普拉斯半群的叠加与记忆
Fractional Diffusion on Graphs: Superposition of Laplacian Semigroups and Memory
AI总结:
本文提出图上亚扩散的分数扩散模型,通过拉普拉斯半群叠加揭示记忆驱动机制,展示多尺度扩散特性及传输偏置。
摘要:
图上的亚扩散通常通过时间分数扩散方程建模,但其结构和动力学后果仍不清楚。我们证明,图上的亚扩散运输是一种由随机时间变换生成的记忆驱动过程,该变换压缩操作时间,产生长尾等待时间,并打破马尔可夫性,同时保持线性和质量守恒。我们证明,Mittag-Leffler图动力学可以精确地用经典热半群的叠加表示,这些半群在重新缩放的时间上进行评估,揭示分数扩散作为在多个内在时间尺度上作用的普通扩散。该框架揭示了异质、顶点依赖的记忆效应,并诱导了在经典扩散中不存在的传输偏置,包括代数松弛、度数依赖的等待时间和源与邻居之间早期时间的不对称性。这些特征定义了图上的亚扩散几何,使粒子能够在局部发现全局最短路径的同时,倾向于高度区域。最后,我们证明时间分数扩散是多速率扩散的奇点极限。
英文摘要:
Subdiffusion on graphs is often modeled by time-fractional diffusion equations, yet its structural and dynamical consequences remain unclear. We show that subdiffusive transport on graphs is a memory-driven process generated by a random time change that compresses operational time, produces long-tailed waiting times, and breaks Markovianity while preserving linearity and mass conservation. We prove that Mittag-Leffler graph dynamics admit an exact convex, mass-preserving representation as a superposition of classical heat semigroups evaluated at rescaled times, revealing fractional diffusion as ordinary diffusion acting across multiple intrinsic time scales. This framework uncovers heterogeneous, vertex-dependent memory effects and induces transport biases absent in classical diffusion, including algebraic relaxation, degree-dependent waiting times, and early-time asymmetries between sources and neighbors. These features define a subdiffusive geometry on graphs enabling particles to locally discover global shortest paths while favoring high-degree regions. Finally, we show that time-fractional diffusion arises as a singular limit of multi-rate diffusion.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。