750 search results - page 8 / 150 » Reconstruction for Models on Random Graphs |
CAAN
2004
Springer
14 years 1 months ago
2004
Springer
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
RSA
2010
13 years 3 months ago
2010
We show that asymptotic equivalence, in a strong form, holds between two random graph models with slightly differing edge probabilities under substantially weaker conditions than w...
JCT
2007
13 years 8 months ago
2007
The preferential attachment graph Gm(n) is a random graph formed by adding a new vertex at each time step, with m edges which point to vertices selected at random with probability...
GECCO
2006
Springer
14 years 3 days ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
ICMLA
2007
13 years 10 months ago
2007
Dynamic programming is introduced to quantize a continuous random variable into a discrete random variable. Quantization is often useful before statistical analysis or reconstruct...