Sciweavers

1591 search results - page 45 / 319
» Random lifts of graphs
Sort
View
CPC
2010
117views more  CPC 2010»
15 years 2 months ago
Diameters in Supercritical Random Graphs Via First Passage Percolation
We study the diameter of C1, the largest component of the Erdos-R
Jian Ding, Jeong Han Kim, Eyal Lubetzky, Yuval Per...
RSA
2006
110views more  RSA 2006»
15 years 5 months ago
The degree sequences and spectra of scale-free random graphs
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...
Jonathan Jordan
PODS
2006
ACM
127views Database» more  PODS 2006»
16 years 5 months ago
Evolution of page popularity under random web graph models
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...
Rajeev Motwani, Ying Xu 0002
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 7 months ago
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
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...
Hang Dinh, Alexander Russell
COMBINATORICA
2010
15 years 2 months ago
Online vertex-coloring games in random graphs
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...
Martin Marciniszyn, Reto Spöhel