2079 search results - page 59 / 416 » Universality of random graphs |
147
click to vote
RSA
2006
15 years 6 months ago
2006
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...
171
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
159
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
157
click to vote
COMBINATORICA
2010
15 years 3 months ago
2010
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
154
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for generating a random k-coloring of a n-vertex graph with maximum degree . We prove that, for every > 0, the d...