搜索资源列表
Clustering_Coefficient
- 复杂网络聚类系数计算的matlab源代码-Complex network clustering coefficients of the matlab source code
ER
- 复杂网络ER随机网络的C++代码,可求其邻接矩阵和聚类系数-ER random networks of complex networks C++ code, rectifiable its adjacency matrix and clustering coefficient
Clustering_Coefficient
- 此源程序是复杂网络中参数聚类系数的计算机程序,很有用的-This source is a complex network parameter clustering coefficient computer program, very useful
scalefree_clustering
- 构造了一个无尺度的复杂网络,并计算出了其聚类系数的值-Construct a complex scale-free networks, and calculate the value of its clustering coefficient
some-basic-model-in-complex-network
- 该压缩包中包含:BA无标度网络、随机图、WS小世界网络、NW小世界网络、最近邻耦合网络、平均路径长度、度分布、聚类系数的matlab源代码。-The compressed packages that include: BA scale-free network, random map, WS small world network, network, the small world NW neighbour coupling network, average path length, clust
BA_net_z
- BA无标度网络的仿真,包括平均路径长度、聚类系数和平均度等。-BA scale-free network simulation, including the average path length, clustering coefficient and average degree.
complex-networks
- 用matlab求复杂网络的节点的度、聚类系数、路径长度等,是关于有向网络的。-Complex networks using matlab and node degree, clustering coefficient, path length, to the network.
complex-net
- 复杂网络中有如随机图,WS小世界网络,NW小世界网络及BA无标度网络等一些常见的基本模型,,本程序从这些网络的产生机理,生成了这些复杂网络模型,并且分析了其基本性质如平均路径长度,聚类系数及度分布等。-Complex networks like the random graph, WS small world network, NW small-world network and BA scale-free network and some common basic model of the p
ClusteringCoefficient
- 此程序用于求网络(交通网,电网,水网等)的聚类系数-This procedure is used to find the clustering coefficient of the network (transportation networks, power grids, water networks, etc.)
clustering_coef_bd
- 得到一个人二值矩阵后,计算一个二值矩阵的聚类系数,来表示矩阵的特征-when you have a 0-1 matrix ,you can calculate its clusterig through my program
sw1
- 小世界网络的生成以及相关参数的计算,包括最短路径、有效性和聚类系数等。-This program generates SW and gives the shortest route,coefficiency and so on.
clustering_coefficients
- 关于复杂网络的聚类系数算法,用matlab计算,矩阵为稀疏矩阵。-clustering_coefficients(A) returns the clustering coefficients for all vertices in A. The clustering coefficient is the ratio of the number of edges between a vertex s neighbors to the total possible number of edges
network
- 用于计算网络的熵、聚类系数、最短路径、度序列分布-Network used to calculate the entropy, clustering coefficient, shortest path degree sequence distribution
clustering_coefficients
- 复杂网络分析工具,主要用于计算复杂网络中的聚类系数-Complex network analysis tools, used to calculate the clustering coefficient of the complex network
complex-networks-matlab-pro
- 本程序用于模拟复杂网络,并计算复杂网络平均路径长度、聚类系数、度分布,及其他特性分析,可为模拟探究复杂网络提供参考。-This procedure is used to simulate complex network, complex network and calculate the average path length, clustering coefficient, degree distribution, analysis, and other features, can provi
BA_net
- 复杂网络中的BA网络matlab源代码,可以有聚类系数,平均度等的统计-BA complex network of networks matlab source code, you can have clustering coefficient, the average degree of statistical
Graph
- malab图论工具包 聚类系数 度 度分布 网络直径 小世界网络构造-malab clustering coefficient graph theory Kit degree degree distribution network diameter small world network structure
small-world-networks
- 1998年, Watts和Strogatz 提出了小世界网络这一概念,并建立了WS模型。 实证结果表明,大多数的真实网络都具有小世界特性(较小的最短路径) 和聚类特性(较大的聚类系数) 。 WS小世界模型构造算法 1、从规则图开始:考虑一个含有N个点的最近邻耦合网络,它们围成一个环,其中每个节点都与它左右相邻的各K/2节点相连,K是偶数。 2、随机化重连:以概率p随机地从新连接网络中的每个边,即将边的一个端点保持不变,而另一个端点取为网络中随机选择的一个节点。其中规定,任意两个不同的
SmallWorld
- 通过公式SW=(C/Crand)/(L/Lrand)求取复杂网络的小世界性系数。 注:其中聚类系数和平均距离都是直接调用工具包中的函数。-By the formula SW = (C/Crand)/(L/Lrand) to strike a small complex networks worldwide coefficients. Note: where clustering coefficient and average distance are called directly tool
Untitled1
- 复杂网络建模分析,聚类系数,平均距离,平均度数,corene-complex network analysis