Local heuristics and the emergence of spanning subgraphs in complex networks

Details Local heuristics and the emergence of spanning subgraphs in complex networks Local heuristics and the emergence of spanning subgraphs in complex networks

2004-11-25

arxiv.org/abs/cs/0411090v1

Theoretical Computer Science 355 (2006), 80-95

Computer Science

Networking and Internet Architecture

Scientific paper

10.1016/j.tcs.2005.12.007

We study the use of local heuristics to determine spanning subgraphs for use in the dissemination of information in complex networks. We introduce two different heuristics and analyze their behavior in giving rise to spanning subgraphs that perform well in terms of allowing every node of the network to be reached, of requiring relatively few messages and small node bandwidth for information dissemination, and also of stretching paths with respect to the underlying network only modestly. We contribute a detailed mathematical analysis of one of the heuristics and provide extensive simulation results on random graphs for both of them. These results indicate that, within certain limits, spanning subgraphs are indeed expected to emerge that perform well in respect to all requirements. We also discuss the spanning subgraphs' inherent resilience to failures and adaptability to topological changes.

Affiliated with

Also associated with

No associations

Rating

Local heuristics and the emergence of spanning subgraphs in complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Local heuristics and the emergence of spanning subgraphs in complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Local heuristics and the emergence of spanning subgraphs in complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414835