...
【24h】

Gradient networks

机译:渐变网络

获取原文
获取原文并翻译 | 示例
           

摘要

Gradient networks are defined (Toroczkai and Bassler 2004 Nature 428 716) as directed graphs formed by local gradients of a scalar field distributed on the nodes of a substrate network G. We present the derivation for some of the general properties of gradient graphs and give an exact expression for the in-degree distribution R( l) of the gradient network when the substrate is a binomial (Erdos-Renyi) random graph, G(N), p, and the scalars are independent identically distributed (i.i.d.) random variables. We show that in the limit N -> infinity, p -> 0, z = pN = const similar to 1, R( l). l- 1 for l < lc = z, i. e., gradient networks become scale- free graphs up to a cut- off degree. This paper presents the detailed derivation of the results announced in Toroczkai and Bassler ( 2004 Nature 428 716).
机译:梯度网络(Toroczkai和Bassler 2004 Nature 428 716)定义为由分布在衬底网络G节点上的标量场的局部梯度形成的有向图。我们介绍了一些梯度图的一般性质,并给出了当底物是二项式(Erdos-Renyi)随机图,G(N),p和标量是独立的均匀分布(iid)随机变量时,梯度网络的度内分布R(l)的精确表达式。我们证明在极限N->无穷大,p-> 0,z = pN = const类似于1,R(l)。当l

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号