Average weighted trapping time of the node- and edge-weighted fractal networks
From MaRDI portal
(Redirected from Publication:2200222)
Recommendations
- Average weighted trapping time of a special weighted fractal network
- THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE
- Trapping time of weighted-dependent walks depending on the weight factor
- The average trapping time on the weighted pseudofractal scale-free web
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
Cites work
- scientific article; zbMATH DE number 47345 (Why is no real title available?)
- scientific article; zbMATH DE number 194082 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- A new iterative approach to fractal models
- Global synchronization of weighted cellular neural network with time-varying coupling delays
- How to get the reliable fractal dimension by the box counting
- Lag projective synchronization of a class of complex network constituted nodes with chaotic behavior
- Orbit of an image under iterated system
- Projective lag synchronization of the general complex dynamical networks with distinct nodes
- Random walks and flights over connected graphs and complex networks
- Statistical mechanics of complex networks
- Synchronization for time-varying complex dynamical networks with different-dimensional nodes and non-dissipative coupling
- Synchronization in complex networks with distinct chaotic nodes
Cited in
(28)- Scaling properties of first return time on weighted transfractals \((1, 3)\)-flowers
- Average weighted trapping time of a special weighted fractal network
- Spectral analysis for weighted iterated triangulations of graphs
- Mean first-passage times for two biased walks on the weighted rose networks
- Eigentime identities for random walks on a family of treelike networks and polymer networks
- Average trapping time of weighted scale-free \(m\)-triangulation networks
- Average weighted receiving time on the non-homogeneous double-weighted fractal networks
- The average trapping time with non-nearest-neighbor jumps on the level-3 Sierpinski gasket
- Trapping on modular scale-free and small-world networks with multiple hubs
- EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
- Determining average path length and average trapping time on generalized dual dendrimer
- Network coherence and eigentime identity on a family of weighted fractal networks
- The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
- Spectral analysis for a family of treelike networks
- The average trapping time on the weighted pseudofractal scale-free web
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
- Controlling the trapping efficiency in a family of scale-free tree networks
- WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS
- Mean trapping time for an arbitrary node on regular hyperbranched polymers
- First-order network coherence and eigentime identity on the weighted Cayley networks
- AVERAGE TRAPPING TIME OF HONEYPOTS ON WEIGHTED RANDOM FRACTAL NETWORKS
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- Exact results for the first-passage properties in a class of fractal networks
- Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
- Trapping on deterministic multiplex networks
- Laplacian spectrum and coherence analysis of weighted hypercube network
- Coherence analysis of a class of weighted networks
This page was built for publication: Average weighted trapping time of the node- and edge-weighted fractal networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200222)
