First-order network coherence and eigentime identity on the weighted Cayley networks

DOI10.1142/S0218348X17500499zbMATH Open1421.05083OpenAlexW2749699212MaRDI QIDQ4589151FDOQ4589151

Authors: Meifeng Dai, Yue Zong, Jiahui Zou, Yufei Chen, Su Weiyi, Xiaoqian Wang 

Publication date: 7 November 2017

Published in: Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218348x17500499

Recommendations

• Network coherence and eigentime identity on a family of weighted fractal networks
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
• Coherence analysis of a class of weighted networks
• EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS

zbMATH Keywords

eigentime identityentire mean first-passage timefirst-order network coherenceweighted Cayley network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Stability of multiagent systems with time-dependent communication links
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• Eigentime identity for transient Markov chains
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
• Distribution characteristics of weighted bipartite evolving networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Network coherence in the web graphs
• Coherence in a family of tree networks with an application of Laplacian spectrum
• Asynchronous Consensus of Multiple Double-Integrator Agents With Arbitrary Sampling Intervals and Communication Delays

Cited In (41)

• EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS
• MARKOV SPECTRA OF SELF-SIMILAR NETWORKS BY SUBSTITUTION RULE
• TWO-POINT RESISTANCES IN SAILBOAT FRACTAL NETWORKS
• FRACTALITY OF SUBSTITUTION NETWORKS
• Applications of Markov spectra for the weighted partition network by the substitution rule
• LEADER–FOLLOWER COHERENCE OF THE WEIGHTED RECURSIVE TREE NETWORKS
• AVERAGE DISTANCES OF A FAMILY OF NON-P.C.F. SELF-SIMILAR NETWORKS
• COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH
• EIGENTIME IDENTITY OF THE WEIGHTED KOCH NETWORKS
• AVERAGE DISTANCES OF A FAMILY OF P.C.F. SELF-SIMILAR NETWORKS
• Searching efficiency of multiple walkers on the weighted networks
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• Eigentime identities of flower networks with multiple branches
• Eigentime identities of potting networks
• Spectral analysis for weighted tree-like fractals
• 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
• AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS
• SELF-SIMILAR TOUCHING NETWORKS — PART I
• First-order network coherence in 5-rose graphs
• SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS
• EXACT CALCULATIONS OF FIRST-PASSAGE QUANTITIES ON A CLASS OF WEIGHTED TREE-LIKE FRACTAL NETWORKS
• Generalized adjacency and Laplacian spectra of the weighted corona graphs
• FRACTAL SETS IN THE FIELD OF p-ADIC ANALOGUE OF THE COMPLEX NUMBERS
• Spectral analysis for weighted iterated q-triangulation networks
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
• Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
• Eigentime identities of fractal sailboat networks
• Average trapping time of weighted scale-free m-triangulation networks
• SELF-SIMILAR TOUCHING NETWORKS — PART II
• CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS
• SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
• WEIERSTRASS-TYPE FUNCTIONS IN p-ADIC LOCAL FIELDS
• ASYMPTOTIC FORMULA ON AVERAGE PATH LENGTH OF A SPECIAL NETWORK BASED ON SIERPINSKI CARPET
• Coherence analysis of a class of weighted networks
• EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS
• Laplacian spectrum and coherence analysis of weighted hypercube network
• On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
• CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS

This page was built for publication: First-order network coherence and eigentime identity on the weighted Cayley networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589151)