[CSUSB]>> [CNS]>> [CSE]>> [R J Botting]>> biba.php

Bibliographic Item (1.0)

Denning04c

  1. Peter J Denning
  2. Network Laws
  3. Commun ACM V47n11(Nov 2004)pp15-20
  4. =SURVEY MATHEMATICS NETWORKS RANDOM GRAPHS POWER LAWS SMALL WORLDS
  5. Clique: highly connected subset with few connections outside the clique.
  6. Hubs: nodes with many links.
  7. Broker: the only connection between a pair of cliques.
  8. Bridge: connected to several cliques In many real networks the Pr[k links at a node] = (1/k)**p, "power law".
  9. Accounted for by new nodes being created at random and connecting to nodes wit h larger numbers of links.
  10. Hubs are key for securing and using a network.
  11. Command a network by communicating intent and delegating decision making.

Search for bibliographic items containing a matching string.


(Search uses POSIX regular expressions and ignores case)

Search for a specific bibliographic item by name.



To see the complete bibliography (1Mb+) select:[Bibliography]