复杂/2017年/文章/ALG 1

研究文章

Dengue Complex网络下的鲁棒性与随机攻击

算法1

学位 - 函数< - 函数(网络,alpha1 = 0.0,alpha2 = 1.0,step_size = 0.5,header =de
 library(tnet)
 num_iter <- /一步的大小
 a_vals <-C(alpha1)
 for ( 在1:num_iter)
  a_vals < - a_vals [一世] + step_size.
 result <- degree_ (网络,测量=Cα),alpha = a_vals [ ])
 for ( 在2:长度(a_vals))
  result <- merge(result, degree_ (网络,测量=Cα),alpha = a_vals [一世]),by =节点
  names(result) < -C(粘贴(标题,a_vals [一世],sep =)))
 names(result)[C )< -C(粘贴(标题,a_vals [ ],sep =)))
 return(result)
closeness_function < - 函数(网络,alpha1 = 0.0,alpha2 = 1.0,step_size = 0.5,header =Clo_
 library(tnet)
 num_iter <- /一步的大小
 a_vals <-C(alpha1)
 for (一世在1:num_iter)
  a_vals < - a_vals [一世] + step_size.
 result <- closeness_ (网络,alpha = a_vals [ ])
 for (一世在2:长度(a_vals))
  result <- merge(result, closeness_ (网络,alpha = a_vals [一世]),by =节点
  names(result < -C(粘贴(标题,a_vals [一世],sep =), 粘贴(ñ。,标题,a_vals [一世],sep =)))
 names(result) < -C(粘贴(标题,a_vals [ ],sep =), 粘贴(ñ。,标题,a_vals [ ],sep =)))
 return(result)
closeness_function2 <函数(网络,alpha1 = 0.0,alpha2 = 1.0,step_size = 0.5,header =Clo_
 library(tnet)
 num_iter <- /一步的大小
 a_vals <-C(alpha1)
 for (一世在1:num_iter)
 a_vals < - a_vals [一世] + step_size.
 result <- closeness_ (网络,alpha = a_vals [ ])
 result <- result[,1:ncol(result)-1]
 for (一世在2:长度(a_vals))
  result <- merge(result, closeness_ (网络,alpha = a_vals [一世]),by =节点
  result <- result[,1:ncol(result)-1]
  names(result) < -C(粘贴(标题,a_vals [一世],sep =)))
  #names(result) < -C(粘贴(标题,a_vals [一世],sep =), 粘贴(ñ。,标题,a_vals [一世],sep =)))
 names(result)[C )< -C(粘贴(标题,a_vals [ ],sep =)))
 retur (result)
之间的介入_Function< - 函数(网络,alpha1 = 0.0,alpha2 = 1.0,step_size = 0.5,标题=赌注_
 library(tnet)
 num_iter <- /一步的大小
 a_vals <-C(alpha1)
  for (一世在1:num_iter)
  a_vals < - a_vals [一世] + step_size.
  result <- betweenness_ (网络,alpha = a_vals [一世])
  for (一世在2:长度(a_vals))
  result <- merge(result, betweenness_ (网络,alpha = a_vals [一世]),by =节点
  names(result) < -C(粘贴(标题,a_vals [一世],sep =)))
  names(result)[C )< -C(粘贴(标题,a_vals [ ],sep =)))
  return(result)
#排序数据集N
ORDER_BY_Nth_col < - 函数(dataframe = null, ,top_rows = 10,升序= true)
 if (ascending)
  return(dataframe[with(dataframe, order(dataframe[[N]]),] [1:TOP_ROWS,])
 else
  return(dataframe[with(dataframe, order(-dataframe[[N]]),] [1:TOP_ROWS,])
学位_comparison < - 函数(tnet1,tnet2,alpha1 = 0.0,alpha2 = 1.0,step_size = 0.5,
 res1 <- degree_function(tnet1, alpha1, alpha2, step_size)
 res2 <- degree_function(tnet2, alpha1, alpha2, step_size)
 num_comparisons <- / step_size + 1
 result <-C()
 for (一世在1:num_comparisons)
  tmp1 <- order_by_Nth_col(Res1, ,top_rows =.R.F
  tmp2 <- order_by_Nth_col(Res2, ,top_rows =.R.F
  #print(tmp1[ ])
  #print(tmp2[ ])
  result < - alpha1 + 一步的大小
  #result < -R.- 长度(相交(TMP1 [,1:1],TMP2 [,1:1]))#非匹配记录
  result < - SUM(TMP1 [,1:1]!= TMP2 [,1:1])
  #result[一世] < -R.- 长度(相交(TMP1 [,1:1],TMP2 [,1:1]))#非匹配记录
R.< - 矩阵(结果,nrow = 2,Dimmines = list(Cα汉明距离),C()))
 return(R.
之间的inberness_comparison < - 函数(tnet1,tnet2,alpha1 = 0.0,alpha2 = 1.0,step_size = 0.5,
 res1<- betweenness_function(tnet1, alpha1, alpha2, step_size)
 res2<- betweenness_function(tnet2, alpha1, alpha2, step_size)
 num_comparisons <- / step_size + 1
 result <-C()
 for (一世在1:num_comparisons)
 tmp1 <- order_by_Nth_col(Res1, ,top_rows =.R.F
 tmp2 <- order_by_Nth_col(Res2, ,top_rows =.R.F
 result < - alpha1 +( 一步的大小
 result < - SUM(TMP1 [,1:1]!= TMP2 [,1:1])
 res <- matrix(result, nrow=2, dimnames=list(Cα汉明距离),C()))
 return(res)
sort_all < - 函数(dataframe = null)
 rows <- nrow(dataframe)
 cols <- ncol(dataframe)
 result <- data.frame( 1:62)
  for (一世在1:cols)
  result <- cbind(result[,1:i], order_by_Nth_col(dataframe,一世,行,F)[,1])
 #result <- result[,3:cols+1]
 return(result[,3 : 9])
Spearman_corr < - 函数(DF1,DF2)
 library(Hmisc)
X< - sort_all(df1)
y< - sort_all(df2)
 cols <- ncol(X
 for (一世在1:cols)
 print(names(df1)
 print(
 print(rcorr(X[,一世],y[,一世]))
 print(- ∖
 return()
#以TNET格式返回从指定网络中提取的随机样本。
get_edge_sample < - 函数(网络, ,加权= true,weight_threshold = 0)
 result <- network[sample(nrow(network), size=N),]
 return(result)

年度奖项:由我们的首席编辑所选的2020年突出的研究捐款。阅读获奖物品