Bernard Kujawski

Learn More
We introduce four algorithms for packet transport in complex networks. These algorithms use deterministic rules which depend, in different ways, on the degree of the node, the number of packets posted down each edge, the mean delivery time of packets sent down each edge to each destination and the time since an edge last transmitted a packet. On scale-free(More)
We investigate the possibility of virtual community formation in an online social network under a rapid increase of activity of members and newcomers. The evolution is studied of the activity of online users at The Guardian-Comment Is Free forum-covering topics related to the Middle East turmoil during the period of 1 st of January 2010 to the 28 th of(More)
  • 1