BA Model with “min” tweak, m = 1, eigencentrality ordered adjacency matrix plot.
Barabási – Albert preferential attachment and the Internet
BA Model with “min” tweak, m = 1, eigencentrality ordered adjacency matrix plot.
About
Interested in network routing and distributed protocols, especially Internet related. Also cycling, MotoGP, Linux, tech, etc. More...Archives..
- Tweets by pjakma
Top Posts
- BGP Path Hunting
- SPF
- BGP Multi-Exit-Discriminator
- SRAMs' wireless bicycle gear shifting: Protocol analysis
- Graph distance using matrix multiplication in Octave
- Transport Scotland and its attitude to active transport spending
- The surprising centres of the Internet
- Code and error handling strategies and FSMs
- Barabási - Albert preferential attachment and the Internet
- Are IPv6 addresses too small?
- 11 AF296 Airbus analysis anti-competitive AS graph Aviation BBC BBC Trust BGP bicycle bits Broomielaw competition content protection council crash cycle-paths cycling Cycling Scotland diagramme doping DRM eigencentrality email embargo encryption Fedora Flash fly-by-wire FOI Freedom of Information frustration GCC Glasgow Glasgow City Council graph guide harmful helmet injury install internet IP iPlayer IPv4 IPv6 Lance Armstrong maintenance myths NAMA networking performance pilot programming property protocol public interest Quagga RBS release religion risk road safety routing safety science Scotland Security software sponsor trees Twitter Vyatta work
Recent Comments
- haneyf on BGP Path Hunting
- Paul Jakma on Study shows Australian cyclist helmet law leads to increasing head injury rates
- Paul Jakma on The case against bicycle helmet advocacy: a quick guide
- Paul Jakma on Making the Internet Scale Through NAT
- Paul Jakma on The case against bicycle helmet advocacy: a quick guide
Meta
Pages
Paul Jakma's Blog 
Leave a comment