Sciweavers

598 search results - page 27 / 120
» A random graph model for massive graphs
Sort
View
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
14 years 11 days ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
14 years 4 months ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 11 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
14 years 11 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
MONET
2006
157views more  MONET 2006»
13 years 11 months ago
Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
Ramin Hekmat, Piet Van Mieghem