Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[ΒΙΒΛΙΟ][B] Principles of animal communication
JW Bradbury, SL Vehrencamp - 1998 - learninglink.oup.com
Literature Cited to accompany Animal Communication, 2e Page 1 Principles of Animal
Communication, Second Edition Jack W. Bradbury and Sandra L. Vehrencamp Chapter 14 …
Communication, Second Edition Jack W. Bradbury and Sandra L. Vehrencamp Chapter 14 …
Box-covering algorithm for fractal dimension of weighted networks
Box-covering algorithm is a widely used method to measure the fractal dimension of
complex networks. Existing researches mainly deal with the fractal dimension of unweighted …
complex networks. Existing researches mainly deal with the fractal dimension of unweighted …
Self-similar scaling of density in complex real-world networks
Despite their diverse origin, networks of large real-world systems reveal a number of
common properties including small-world phenomena, scale-free degree distributions and …
common properties including small-world phenomena, scale-free degree distributions and …
A cluster-growing dimension of complex networks: From the view of node closeness centrality
B Wei, Y Deng - Physica A: Statistical Mechanics and its Applications, 2019 - Elsevier
The cluster-growing method has been widely used to measure the fractal dimension of
complex networks. In this method, a seed node is chosen at random and the number of …
complex networks. In this method, a seed node is chosen at random and the number of …
Multifractal analysis of weighted networks by a modified sandbox algorithm
YQ Song, JL Liu, ZG Yu, BG Li - Scientific reports, 2015 - nature.com
Complex networks have attracted growing attention in many fields. As a generalization of
fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the …
fractal analysis, multifractal analysis (MFA) is a useful way to systematically describe the …
Scaling of average shortest distance of two colored substitution networks
F Huang, M Dai, J Zhu, W Su - IEEE Transactions on Network …, 2020 - ieeexplore.ieee.org
In this paper, two colored substitution networks by substitution rules are introduced. In order
to calculate the sum of all shortest distances, we discuss the following both cases: two nodes …
to calculate the sum of all shortest distances, we discuss the following both cases: two nodes …
Scaling of average weighted receiving time on double-weighted Koch networks
M Dai, D Ye, J Hou, X Li - Fractals, 2015 - World Scientific
In this paper, we introduce a model of the double-weighted Koch networks based on actual
road networks depending on the two weight factors w, r∈(0, 1]. The double weights …
road networks depending on the two weight factors w, r∈(0, 1]. The double weights …
The average shortest distance of three colored substitution networks
Z Hu, B Wu - Chaos, Solitons & Fractals, 2023 - Elsevier
The circuit is a system composed of multiple components. The module of the circuit refers to
the combination of components with similar functions in the circuit to form a module. In order …
the combination of components with similar functions in the circuit to form a module. In order …
An improved method for measuring the complexity in complex networks based on structure entropy
M Lei, L Liu, D Wei - IEEE Access, 2019 - ieeexplore.ieee.org
Although structure entropy is a useful method to measure the complexity of complex
networks, there exist shortcomings, such as the limits of network scales and network types …
networks, there exist shortcomings, such as the limits of network scales and network types …
Exact calculations of network coherence in weighted ring-trees networks and recursive trees
T **g, L Yang, W Sun - Physica Scripta, 2021 - iopscience.iop.org
In this paper, we study noisy consensus dynamics in two families of weighted ring-trees
networks and recursive trees with a controlled initial state. Based on the topological …
networks and recursive trees with a controlled initial state. Based on the topological …