Stable Coexistence in Ecologies and Games
研究通过扩展Lotka-Volterra模型解决生态系统中物种稳定共存问题,并探讨了高阶互动对实现稳定均衡的作用。
研究通过扩展Lotka-Volterra模型解决生态系统中物种稳定共存问题,并探讨了高阶互动对实现稳定均衡的作用。
本文提出了一种无网格数值求解器,用于解决具有自组织表面几何的可变形界面与周围流体耦合的问题,通过隐式跟踪表面并求解应力平衡。
本文提出了一种基于点云的无网格数值求解器,用于解决曲面上不可压缩Navier-Stokes方程问题,通过局部施加近似可压缩性条件来避免全局矩阵求逆。
Existing discrete Ricci curvature methods struggle to handle networks with directionality and complex-valued weights, limiting their applicability in domains such as social, biological, and quantum systems. This work presents the first extension of Ollivier–Ricci curvature to complex-weighted graphs—encompassing directed graphs as a special case—and establishes a theoretical connection between this curvature and the magnetic Laplacian. By leveraging local neighborhood cycle structures, we derive rigorous upper and lower bounds for the curvature. Integrating optimal transport theory, combinatorial graph theory, and numerical optimization, we introduce the first well-defined Ollivier curvature for complex-weighted graphs, thereby unifying the treatment of directed edges and complex weights. The proposed curvature estimation algorithm demonstrates strong empirical performance and practical utility in community detection tasks on directed networks.
本文提出了一种超富集俱乐部分析方法,通过超边编码高阶交互作用来检测复杂网络中的结构,适用于广义有向超图。
研究通过扩展Lotka-Volterra模型解决生态系统中物种稳定共存问题,并探讨了高阶互动对实现稳定均衡的作用。
本文提出了一种无网格数值求解器,用于解决具有自组织表面几何的可变形界面与周围流体耦合的问题,通过隐式跟踪表面并求解应力平衡。
本文提出了一种基于点云的无网格数值求解器,用于解决曲面上不可压缩Navier-Stokes方程问题,通过局部施加近似可压缩性条件来避免全局矩阵求逆。
Existing discrete Ricci curvature methods struggle to handle networks with directionality and complex-valued weights, limiting their applicability in domains such as social, biological, and quantum systems. This work presents the first extension of Ollivier–Ricci curvature to complex-weighted graphs—encompassing directed graphs as a special case—and establishes a theoretical connection between this curvature and the magnetic Laplacian. By leveraging local neighborhood cycle structures, we derive rigorous upper and lower bounds for the curvature. Integrating optimal transport theory, combinatorial graph theory, and numerical optimization, we introduce the first well-defined Ollivier curvature for complex-weighted graphs, thereby unifying the treatment of directed edges and complex weights. The proposed curvature estimation algorithm demonstrates strong empirical performance and practical utility in community detection tasks on directed networks.
本文提出了一种超富集俱乐部分析方法,通过超边编码高阶交互作用来检测复杂网络中的结构,适用于广义有向超图。