Sciweavers

183 search results - page 10 / 37
» The Degree Distribution of Random k-Trees
Sort
View
IM
2008
13 years 8 months ago
Directed Random Dot Product Graphs
In this paper we consider three models for random graphs that utilize the inner product as their fundamental object. We analyze the behavior of these models with respect to cluster...
Stephen J. Young, Edward R. Scheinerman
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 2 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»
13 years 8 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...
FOCS
2003
IEEE
14 years 1 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
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
13 years 10 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan