Controlling and optimizing the transport (search) efficiency with local information on a class of scale-free trees

Cites Work

Title not available (Why is that?)
From first-passage times of random walks in confinement to geometry-controlled kinetics
Maximal entropy random walk on heterogenous network for miRNA-disease association prediction
Return probability for random walks on scale-free complex trees
Random walks and the effective resistance of networks
Combinatorics, Paul Erdős is eighty. Vol. 2
Best location of service centers in a treelike network under budget constraints
Diffusion and reactions in fractals and disordered systems
Effect of trap position on the efficiency of trapping in treelike scale-free networks
Emergence of Scaling in Random Networks
Influence of weight heterogeneity on random walks in scale-free networks
Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
Dynamical Processes on Complex Networks
The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
Exact calculations of first-passage properties on the pseudofractal scale-free web
TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
Trapping efficiency of random walks on weighted scale-free trees
The average trapping time on the weighted pseudofractal scale-free web
The true reinforced random walk with bias
Average trapping time of weighted scale-free m-triangulation networks
First-Passage Phenomena and Their Applications
Phase Changes in the Topological Indices of Scale-Free Trees
A Guide to First-Passage Processes

This page was built for publication: Controlling and optimizing the transport (search) efficiency with local information on a class of scale-free trees

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