CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE

DOI10.1142/S0218348X20500784MaRDI QIDQ5129909zbMATH OpenFDO

Authors Tingting Chen, Meifeng Dai, Fang Huang, Shilin Feng

Publication date 3 November 2020

Published in Fractals (Search for Journal in Brave)

zbMATH Keywords

Laplacian matrix1D chain networkglobal mean weighted first-passage timeweighted reverse edge

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Signed and weighted graphs (05C22)

Recommendations

• The effect of reverse edges on convergence rate of directed weighted chain network
• First-order network coherence and eigentime identity on the weighted Cayley networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Exact calculations of first-passage quantities on a class of weighted tree-like fractal networks
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks

Cites work

• Average weighted receiving time on the non-homogeneous double-weighted fractal networks
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Effect of Adding Edges to Consensus Networks With Directed Acyclic Graphs
• Eigentime identities of fractal sailboat networks
• Fractality of multiple colored substitution networks
• Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
• Scale-free effect of substitution networks
• Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
• Scaling properties of first return time on weighted transfractals \((1, 3)\)-flowers
• The electrical resistance of a graph captures its commute and cover times
• The modified box dimension and average weighted receiving time of the weighted hierarchical graph

Cited in

(1)

• Average Fermat distances of two-colored substitution networks

This page was built for publication: CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE

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