1511 search results - page 11 / 303 » Randomness, lowness and degrees |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
CPC
1998
14 years 11 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
CIE
2007
Springer
15 years 3 months ago
2007
Springer
A guiding question in the study of weak 2-randomness is whether weak 2-randomness is closer to 1-randomness, or closer to 2randomness. Recent research indicates that the first alte...
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
116
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
ABSTRACT. Upon the discovery of power laws [8, 16, 30], a large body of work in complex network analysis has focused on developing generative models of graphs which mimick real-wor...