ISSN 1944-9488
Vol. 8, Issue 4, 2012November 30, 2012 EDT
Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks
Articles in Vol. 8, Issue 4, 2012
Vol. 8, Issue 4, 2012
- Model Selection for Social Networks Using GraphletsJeannette JanssenMatt HurshmanNauzer Kalyaniwalla
- Balance in Random Signed GraphsA. EL MaftouhiY. ManoussakisO. Megalakaki
- Mean Commute Time for Random Walks on Hierarchical Scale-Free NetworksYilun Shang
- Digraph Laplacian and the Degree of AsymmetryZhi-Li ZhangYanhua Li
- Strategic Coloring of a GraphJérôme MonnotLaurent GourvèsBruno Escoffier
- Bistability through Triadic ClosurePeter GrindrodMark C. ParsonsDesmond J. Higham
- Editorial Board EOVInternet Mathematics
Shang, Yilun. 2012. “Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks.” Internet Mathematics 8 (4). https://doi.org/10.1080/15427951.2012.685685.