Epidemic spread in weighted networks
We study the detailed epidemic spreading process in scale-free networks with weight that denote familiarity between two people or computers.
arxiv.orgrank this link
Refine results · kind
shows people
4 indexed results
Insertion Sort is O(n log n)
Traditional Insertion Sort runs in O(n^2) time because each insertion takes O(n) time. When people run Insertion Sort in the
arxiv.orgrank this link
Bringing the Internet to Schools: US and EU policies
The Internet is changing rapidly the way people around the world communicate, learn, and work. Yet the tremendous benefits of
arxiv.orgrank this link
Why Vortex Lattice Melting Theory is Science Fiction
Five years ago the talk "The vortex lattice melting theory as example of science fiction" cond-mat/9811051 was presented. Nevertheless this
arxiv.orgrank this link