750 search results - page 19 / 150 » Reconstruction for Models on Random Graphs |
ACL
2009
13 years 6 months ago
2009
Most approaches to topic modeling assume an independence between documents that is frequently violated. We present an topic model that makes use of one or more user-specified grap...
IM
2007
13 years 8 months ago
2007
We present a new model for self-organizing networks such as the web graph, and analyze its limit behaviour. In the model, new vertices are introduced over time that copy the neighb...
SIGIR
2011
ACM
12 years 11 months ago
2011
ACM
Online forum discussions are emerging as valuable information repository, where knowledge is accumulated by the interaction among users, leading to multiple threads with structure...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
STOC
1994
ACM
14 years 16 days ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...