First-order network coherence and eigentime identity on the weighted Cayley networks
From MaRDI portal
Publication:4589151
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
Cites work
- Asynchronous Consensus of Multiple Double-Integrator Agents With Arbitrary Sampling Intervals and Communication Delays
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Coherence in a family of tree networks with an application of Laplacian spectrum
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Counting spanning trees in prism and anti-prism graphs
- Distribution characteristics of weighted bipartite evolving networks
- Eigentime identity for transient Markov chains
- Network coherence in the web graphs
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Stability of multiagent systems with time-dependent communication links
Cited in
(44)- 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
- MARKOV SPECTRA OF SELF-SIMILAR NETWORKS BY SUBSTITUTION RULE
- Network coherence analysis on a family of nested weighted \(n\)-polygon networks
- Spectral analysis for weighted iterated q-triangulation networks
- Spectral analysis for weighted iterated triangulations of graphs
- Applications of Markov spectra for the weighted partition network by the substitution rule
- Average trapping time of weighted scale-free m-triangulation networks
- Characteristic polynomial of adjacency or Laplacian matrix for weighted treelike networks
- Self-similar touching networks. II
- 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
- Weierstrass-type functions in p-adic local fields
- Network coherence and eigentime identity on a family of weighted fractal 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
- Asymptotic formula on average path length of a special network based on Sierpinski carpet
- Consensus problems in weighted hierarchical graphs
- Eigentime identity for weight-dependent walk on a class of weighted fractal scale-free hierarchical-lattice networks
- Two-point resistances in sailboat fractal 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
- Fractality of substitution networks
- Leader-follower coherence of the weighted recursive tree networks
- First-order network coherence in 5-rose graphs
- AVERAGE DISTANCES OF LINDSTRÖM SNOWFLAKE NETWORKS
- Network coherence of N-duplication corona weighted network
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- Average distances of a family of non-p.c.f. self-similar networks
- FRACTAL SETS IN THE FIELD OF p-ADIC ANALOGUE OF THE COMPLEX NUMBERS
- Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk
- Eigentime identities of fractal sailboat networks
- SPECTRAL ANALYSIS FOR WEIGHTED LEVEL-4 SIERPIŃSKI GRAPHS AND ITS APPLICATIONS
- Laplacian spectrum and coherence analysis of weighted hypercube network
- Coherence analysis of a class of weighted networks
- On the generalized adjacency, Laplacian and signless Laplacian spectra of the weighted edge corona networks
- EIGENTIME IDENTITIES OF FRACTAL FLOWER NETWORKS
- Self-similar touching networks. I
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)
