1067 search results - page 15 / 214 » Probabilistic regular graphs |
127
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
Consider random regular graphs of order n and degree d = d(n) 3. Let g = g(n) 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution simila...
146
click to vote
ICMCS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
127
click to vote
CAAN
2007
Springer
15 years 9 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
129
click to vote
COMBINATORICS
2004
15 years 3 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
141
click to vote
ALGORITHMICA
2011
14 years 10 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...