Average weighted trapping time of the node- and edge-weighted fractal networks

DOI10.1016/J.CNSNS.2016.03.001OpenAlexW2297810210MaRDI QIDQ2200222FDOQ2200222

Lifeng Xi, Jie Hou, Dandan Ye, Meifeng Dai, Su Weiyi

Publication date: 19 September 2020

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2016.03.001

zbMATH Keywords

weight factorfractal networkaverage weighted trapping timethe node- and edge- weighted network

Mathematics Subject Classification ID

Combinatorics (05-XX) Computer science (68-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Statistical mechanics of complex networks
• A new iterative approach to fractal models
• Projective lag synchronization of the general complex dynamical networks with distinct nodes
• Lag projective synchronization of a class of complex network constituted nodes with chaotic behavior
• Global synchronization of weighted cellular neural network with time-varying coupling delays
• Synchronization in complex networks with distinct chaotic nodes
• Random walks and flights over connected graphs and complex networks
• Orbit of an image under iterated system
• Synchronization for time-varying complex dynamical networks with different-dimensional nodes and non-dissipative coupling
• How to get the reliable fractal dimension by the box counting

Cited In (19)

• 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 weighted receiving time on the non-homogeneous double-weighted fractal networks
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
• 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
• TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
• The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network
• SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS
• WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
• AVERAGE TRAPPING TIME OF HONEYPOTS ON WEIGHTED RANDOM FRACTAL NETWORKS
• Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
• THE AVERAGE TRAPPING TIME WITH NON-NEAREST-NEIGHBOR JUMPS ON THE LEVEL-3 SIERPINSKI GASKET
• Average trapping time on a type of horizontally segmented three dimensional Sierpinski gasket network with two types of locally self-similar structures
• Coherence analysis of a class of weighted networks
• Laplacian spectrum and coherence analysis of weighted hypercube network

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)