Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Mean first-passage time and robustness of complex cellular mobile communication network
JB Liu, X Zhang, J Cao, L Chen - IEEE Transactions on Network …, 2024 - ieeexplore.ieee.org
With the rapid development of complex network science and the complexity of
communication network, it is difficult to research its technical application. In order to solve …
communication network, it is difficult to research its technical application. In order to solve …
Enhanced graphene photodetector with fractal metasurface
Graphene has been demonstrated to be a promising photodetection material because of its
ultrabroadband optical absorption, compatibility with CMOS technology, and dynamic …
ultrabroadband optical absorption, compatibility with CMOS technology, and dynamic …
Random walks in weighted networks with a perfect trap: An application of Laplacian spectra
Trap** processes constitute a primary problem of random walks, which characterize
various other dynamical processes taking place on networks. Most previous works focused …
various other dynamical processes taking place on networks. Most previous works focused …
Eigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: Analytical results and applications
The eigenvalues of the normalized Laplacian matrix of a network play an important role in its
structural and dynamical aspects associated with the network. In this paper, we study the …
structural and dynamical aspects associated with the network. In this paper, we study the …
Optimizing search processes with stochastic resetting on the pseudofractal scale-free web
Y Chen, Z Yuan, L Gao, J Peng - Physical Review E, 2023 - APS
The pseudofractal scale-free web (PSFW) is a well-known model for a scale-free network
with small-world characteristics. Understanding the dynamic properties of this network can …
with small-world characteristics. Understanding the dynamic properties of this network can …
Exact determination of MFPT for random walks on rounded fractal networks with varying topologies
Y Liu, J Chen, W Sun - Journal of Complex Networks, 2024 - academic.oup.com
Random walk is a stochastic process that moves through a network between different states
according to a set of probability rules. This mechanism is crucial for understanding the …
according to a set of probability rules. This mechanism is crucial for understanding the …
Laplacian spectra of recursive treelike small-world polymer networks: Analytical solutions and applications
A central issue in the study of polymer physics is to understand the relation between the
geometrical properties of macromolecules and various dynamics, most of which are …
geometrical properties of macromolecules and various dynamics, most of which are …
Low-mean hitting time for random walks on heterogeneous networks
Y Sheng, Z Zhang - IEEE Transactions on Information Theory, 2019 - ieeexplore.ieee.org
Mean hitting time for random walks on a network, defined as the average of hitting times
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
over all possible pairs of nodes, has found a large variety of applications in many areas. In …
First encounters on Bethe lattices and Cayley trees
In this work we consider the first encounter problems between a fixed and/or mobile target A
and a moving trap B on Bethe lattices and Cayley trees. The survival probabilities (SPs) of …
and a moving trap B on Bethe lattices and Cayley trees. The survival probabilities (SPs) of …
[HTML][HTML] Exact results for the first-passage properties in a class of fractal networks
In this work, we consider a class of recursively grown fractal networks G n (t) whose topology
is controlled by two integer parameters, t and n. We first analyse the structural properties of …
is controlled by two integer parameters, t and n. We first analyse the structural properties of …