Sciweavers

598 search results - page 36 / 120
» A random graph model for massive graphs
Sort
View
FOCS
2009
IEEE
14 years 5 months ago
Convergence to Equilibrium in Local Interaction Games
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
Andrea Montanari, Amin Saberi
PAKDD
2010
ACM
179views Data Mining» more  PAKDD 2010»
14 years 3 months ago
Answer Diversification for Complex Question Answering on the Web
We present a novel graph ranking model to extract a diverse set of answers for complex questions via random walks over a negative-edge graph. We assign a negative sign to edge weig...
Palakorn Achananuparp, Xiaohua Hu, Tingting He, Ch...
VTC
2006
IEEE
121views Communications» more  VTC 2006»
14 years 5 months ago
Location-Dependent Parameterization of a Random Direction Mobility Model
— Mobility models are widely used in simulation-based performance analyses of mobile networks. However, there is a trade-off between simplicity and realistic movement patterns. S...
Bernd Gloss, Michael Scharf, Daniel Neubauer
CPC
2006
116views more  CPC 2006»
13 years 11 months ago
Finding Large Independent Sets in Polynomial Expected Time
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
Amin Coja-Oghlan
SIGMETRICS
2004
ACM
107views Hardware» more  SIGMETRICS 2004»
14 years 4 months ago
On zone-balancing of peer-to-peer networks: analysis of random node join
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri L...