CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE
From MaRDI portal
Publication:5129909
DOI10.1142/S0218348X20500784zbMath1445.05097MaRDI QIDQ5129909
Fang Huang, Shilin Feng, Meifeng Dai, Tingting Chen
Publication date: 3 November 2020
Published in: Fractals (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)
Related Items
Cites Work
- The electrical resistance of a graph captures its commute and cover times
- Average weighted receiving time on the non-homogeneous double-weighted fractal networks
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph
- Scale-free effect of substitution networks
- Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks
- Eigentime identities of fractal sailboat networks
- Fractality of multiple colored substitution networks
- Effect of Adding Edges to Consensus Networks With Directed Acyclic Graphs
- SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?