Sciweavers

1511 search results - page 49 / 303
» Randomness, lowness and degrees
Sort
View
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
15 years 6 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
14 years 11 months ago
Short Cycles in Random Regular Graphs
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...
Brendan D. McKay, Nicholas C. Wormald, Beata Wysoc...
ISCAS
2006
IEEE
146views Hardware» more  ISCAS 2006»
15 years 5 months ago
Adaptive combined bispectrum-filtering signal processing in radar systems with low SNR
—The application of adaptive techniques for obtaining bispectrum estimates in additive Gaussian noise and random shifts of received signals is considered. An approach using joint...
Vladimir V. Lukin, A. Totsky, D. Fevralev, Alexey ...
FOCS
2003
IEEE
15 years 5 months ago
A Non-Markovian Coupling for Randomly Sampling Colorings
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
Thomas P. Hayes, Eric Vigoda
RSA
2006
80views more  RSA 2006»
14 years 11 months ago
Regular subgraphs of random graphs
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
Béla Bollobás, Jeong Han Kim, Jacque...