FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS

DOI10.1142/S0218348X17500499zbMath1421.05083OpenAlexW2749699212MaRDI QIDQ4589151

Wei Yi Su, Meifeng Dai, Jiahui Zou, Yue Zong, Yufei Chen, Xiao Qian 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

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)

Related Items (41)

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

Cites Work

• Eigentime identity for transient Markov chains
• Distribution characteristics of weighted bipartite evolving networks
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
• Network coherence in the web graphs
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Asynchronous Consensus of Multiple Double-Integrator Agents With Arbitrary Sampling Intervals and Communication Delays
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• 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
• Coherence in a family of tree networks with an application of Laplacian spectrum

This page was built for publication: FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS