Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ENDM
2002

favoriteEmaildiscussreport

109views more ENDM 2002»

Graph Operations and Zipfian Degree Distributions

13 years 4 months ago

Graph Operations and Zipfian Degree Distributions

Download www.cs.sjsu.edu

The probability distribution on a set S = { 1, 2, . . . , n } defined by Pr(k) = 1/(Hnk), where Hn in the nth harmonic number, is commonly called a Zipfian distribution. In this note we look at the degree distribution of graphs created from graphs with Zipfian degree distributions using some standard graph theoretical operations.

Walter W. Kirchherr

Real-time Traffic

Degree Distributions | ENDM 2002 | Nth Harmonic Number | Probability Distribution |

claim paper

Related Content

» Sparse random graphs with clustering

» Evolution of GraphLike Programs with Parallel Distributed Genetic Programming

» Skip Tree Graph a Distributed and Balanced Search Tree for PeertoPeer Networks

» Efficient and Adaptive Distributed Skyline Computation

» Local Algorithms for Finding Interesting Individuals in Large Networks

» The Power of Orientation in SymmetryBreaking

» Efficient aggregation for graph summarization

» Model of an Adaptive Support Interface for Distance Learning

» Distributed aggregation for dataparallel computing interfaces and implementations

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	ENDM
Authors	Walter W. Kirchherr

Comments (0)