分层网络中的干扰
Jamming in Hierarchical Networks
摘要:
我们研究了一些层次网络上的晶格玻璃的Biroli-Mezard模型。这些网络结合了某些格子状的功能与递归结构,使它们适合于精确的重整化群的研究,并提供了一种替代的平均场方法。在我们的数值模拟中,我们首先用Wang-Landau算法探索它们的平衡性质。然后,我们研究了它们的动力学行为,使用一个巨正则退火算法。我们发现,动力学很容易落在平衡和堵塞在我们的许多网络与一定的约束的邻居占用的Biroli-Mezard模型,即使在情况下,确切的结果表明,不存在理想的玻璃化转变。但是,虽然我们发现,时间尺度的堵塞分歧,我们的模拟不能确定这样的分歧明显高于随机紧密包装的包装分数。在我们的动态模拟中允许跳跃的情况下,这些网络上的堵塞通常会消失。
英文摘要:
We study the Biroli-Mezard model for lattice glasses on a number of hierarchical networks. These networks combine certain lattice-like features with a recursive structure that makes them suitable for exact renormalization group studies and provide an alternative to the mean-field approach. In our numerical simulations here, we first explore their equilibrium properties with the Wang-Landau algorithm. Then, we investigate their dynamical behavior using a grand-canonical annealing algorithm. We find that the dynamics readily falls out of equilibrium and jams in many of our networks with certain constraints on the neighborhood occupation imposed by the Biroli-Mezard model, even in cases where exact results indicate that no ideal glass transition exists. But while we find that time-scales for the jams diverge, our simulations cannot ascertain such a divergence for a packing fraction distinctly above random close packing. In cases where we allow hopping in our dynamical simulations, the jams on these networks generally disappear.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。