Sciweavers

750 search results - page 5 / 150
» Reconstruction for Models on Random Graphs
Sort
View
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 1 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
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
The Degree Distribution of Random k-Trees
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model...
Yong Gao
ACSAC
2003
IEEE
14 years 20 days ago
Automatic Reassembly of Document Fragments via Context Based Statistical Models
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
Kulesh Shanmugasundaram, Nasir D. Memon
DIALM
2008
ACM
179views Algorithms» more  DIALM 2008»
13 years 9 months ago
Distance graphs: from random geometric graphs to Bernoulli graphs and between
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
Chen Avin
RSA
2010
98views more  RSA 2010»
13 years 5 months ago
Merging percolation on Zd and classical random graphs: Phase transition
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
Tatyana S. Turova, Thomas Vallier