1542 search results - page 104 / 309 » The metamathematics of random graphs |
115
Voted
FCT
2009
Springer
15 years 8 months ago
2009
Springer
Despite of their applicability betweennness constraints have (to the author’s knowledge) hardly been considered from the random structures point of view. They are essentially di�...
IM
2007
15 years 1 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...
111
click to vote
IJON
2007
15 years 1 months ago
2007
Many conceptual studies of local cortical networks assume completely random wiring. For spatially extended networks, however, such random graph models are inadequate. The geometry...
133
Voted
KDD
2012
ACM
13 years 4 months ago
2012
ACM
Blockmodelling is an important technique for decomposing graphs into sets of roles. Vertices playing the same role have similar patterns of interactions with vertices in other rol...
102
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...