Sciweavers

865 search results - page 10 / 173
» Random graph models for the web graph
Sort
View
RSA
2006
69views more  RSA 2006»
13 years 8 months ago
On smoothed analysis in dense graphs and formulas
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
Michael Krivelevich, Benny Sudakov, Prasad Tetali
IM
2006
13 years 8 months ago
Using PageRank to Characterize Web Structure
Recent work on modeling the web graph has dwelt on capturing the degree distributions observed on the web. Pointing out that this represents a heavy reliance on "local" p...
Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
JCB
2006
124views more  JCB 2006»
13 years 8 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
SAC
2010
ACM
14 years 3 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
IV
2003
IEEE
92views Visualization» more  IV 2003»
14 years 1 months ago
Visualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in...
Peter Rodgers, Paul Mutton