Sciweavers

7 search results - page 1 / 2
» Directed Random Dot Product Graphs
Sort
View
IM
2008
13 years 4 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»
13 years 11 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
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 5 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
PKDD
2009
Springer
129views Data Mining» more  PKDD 2009»
13 years 11 months ago
RTG: A Recursive Realistic Graph Generator Using Random Typing
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
Leman Akoglu, Christos Faloutsos
CPC
2011
219views Education» more  CPC 2011»
12 years 12 months ago
On Percolation and the Bunkbed Conjecture
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
Svante Linusson