22 search results - page 4 / 5 » On the largest eigenvalue of non-regular graphs |
78
Voted
SRDS
2003
IEEE
15 years 4 months ago
2003
IEEE
How will a virus propagate in a real network? Does an epidemic threshold exist for a finite powerlaw graph, or any finite graph? How long does it take to disinfect a network giv...
108
Voted
IMC
2010
ACM
14 years 9 months ago
2010
ACM
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
93
Voted
JUCS
2007
14 years 11 months ago
2007
: In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying sm...
107
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
111
Voted
BICOB
2009
Springer
15 years 6 months ago
2009
Springer
Here we present a simple method based on graph spectral properties to automatically partition multi-domain proteins into individual domains. The identification of structural domain...