Sciweavers

598 search results - page 5 / 120
» A random graph model for massive graphs
Sort
View
WAW
2004
Springer
96views Algorithms» more  WAW 2004»
15 years 10 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
CORR
2011
Springer
205views Education» more  CORR 2011»
15 years 7 days ago
Random Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
Oksana Denysyuk, Luis Rodrigues
FOCS
2007
IEEE
15 years 11 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
144
Voted
ICML
2006
IEEE
16 years 6 months ago
Graph model selection using maximum likelihood
In recent years, there has been a proliferation of theoretical graph models, e.g., preferential attachment and small-world models, motivated by real-world graphs such as the Inter...
Adam Kalai, Ivona Bezáková, Rahul Sa...
150
Voted
CORR
2008
Springer
139views Education» more  CORR 2008»
15 years 5 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi