1640 search results - page 22 / 328 » Conditional Independence Trees |
EJC
2008
13 years 10 months ago
2008
We investigate the following vertex percolation process. Starting with a random regular graph of constant degree, delete each vertex independently with probability p, where p = n-...
SYNTHESE
2008
13 years 9 months ago
2008
We consider the problems arising from using sequences of experiments to discover the causal structure among a set of variables, none of whom are known ahead of time to be an "...
TON
2012
12 years 8 days ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...
RSA
2006
13 years 9 months ago
2006
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
DAM
2007
13 years 9 months ago
2007
The Fibonacci number of a graph is the number of independent vertex subsets. In this paper, we investigate trees with large Fibonacci number. In particular, we show that all trees...