745 search results - page 35 / 149 » On Generating Random Network Structures: Connected Graphs |
104
click to vote
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
138
click to vote
SIGMETRICS
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is...
129
click to vote
KDD
2007
ACM
16 years 27 days ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
118
Voted
JDA
2010
14 years 11 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
104
Voted
SODA
2007
ACM
15 years 1 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...