Analysis of Brownian Particles for finding the shortest path in networks
In this paper, we propose a method to analyze the shortest path finding between two nodes in complex networks. In this method, we first find that single Brownian particle follows the shortest path between source node and destination node in the probability of where denotes the shortest path steps be...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | EJournal Article |
| Published: |
Institute of Advanced Engineering and Science,
2014-01-01.
|
| Subjects: | |
| Online Access: | Get fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get fulltext3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |