Sciweavers

42 search results - page 4 / 9
» Component Evolution in General Random Intersection Graphs
Sort
View
UAI
2003
13 years 9 months ago
On Triangulating Dynamic Graphical Models
This paper introduces improved methodology to triangulate dynamic graphical models and dynamic Bayesian networks (DBNs). In this approach, a standard DBN template can be modified...
Jeff A. Bilmes, Chris Bartels
IM
2008
13 years 7 months ago
The Structure of Geographical Threshold Graphs
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
APPROX
2004
Springer
105views Algorithms» more  APPROX 2004»
14 years 1 months ago
Counting Connected Graphs and Hypergraphs via the Probabilistic Method
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwala...
RSA
2008
94views more  RSA 2008»
13 years 7 months ago
Random mappings with exchangeable in-degrees
In this paper we introduce a new random mapping model, T ^D n , which maps the set {1, 2, ..., n} into itself. The random mapping T ^D n is constructed using a collection of excha...
Jennie C. Hansen, Jerzy Jaworski
RECOMB
2005
Springer
14 years 8 months ago
Improved Duplication Models for Proteome Network Evolution
Protein-protein interaction networks, particularly that of the yeast S. Cerevisiae, have recently been studied extensively. These networks seem to satisfy the small world property ...
Gürkan Bebek, Petra Berenbrink, Colin Cooper,...