|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'506'133
Articles rated: 2609
27 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
Modifying network connectivity with a subgraph addition | | Dane Taylor
; Juan G. Restrepo
; | | Date: |
24 Feb 2011 | | Abstract: | The principal eigenvalue $lambda$ of a network’s adjacency matrix often
determines dynamics on the network (e.g., in synchronization and spreading
processes) and some of its structural properties (e.g., robustness against
failure or attack), and is therefore a good indicator for how "strongly" a
network is connected. We study how $lambda$ is modified by the addition of a
subgraph. This type of modification has broad applications, ranging from those
involving a single modification (e.g., introduction of a drug into a biological
process) to those involving repeated subnetwork additions (e.g., power-grid and
transit development). We describe how to optimally connect the subgraph to the
network to either maximize or minimize the shift in $lambda$, noting several
applications. | | Source: | arXiv, 1102.4876 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER