Sciweavers

750 search results - page 4 / 150
» Reconstruction for Models on Random Graphs
Sort
View
RSA
2006
69views more  RSA 2006»
14 years 9 months ago
On smoothed analysis in dense graphs and formulas
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
Michael Krivelevich, Benny Sudakov, Prasad Tetali
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 4 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
15 years 2 months ago
A Geometric Preferential Attachment Model of Networks
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...
Abraham Flaxman, Alan M. Frieze, Juan Vera
FOCS
2000
IEEE
15 years 1 months ago
Random graph models for the web graph
Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopala...
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
15 years 3 months ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus