"Random walks over weighted complex networks: Are the most occupied nodes ..."

Pablo Medina et al. (2025)

> Home

Details and statistics

DOI: 10.1016/J.CNSNS.2025.108778

access: closed

type: Journal Article

metadata version: 2025-05-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cnsns/MedinaECRRV25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cnsns/MedinaECRRV25
Pablo Medina, Tomás P. Espinoza, Sebastián C. Carrasco, Reinaldo R. Rosa, José Rogan, Juan Alejandro Valdivia:
Random walks over weighted complex networks: Are the most occupied nodes the nearest ones? Commun. Nonlinear Sci. Numer. Simul. 146: 108778 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.