activity
20082015
most citedA Prior Distribution over Directed Acyclic Graphs for Sparse Bayesian Networks

1 citations · 2 across the 7 of their papers we have counts for

collaborators

8 papers

math.PR2015

Effect of Stochastic Perturbations for Front Propagation in Kolmogorov Petrovskii Piscunov Equations

John M. Noble

This article considers equations of Kolmogorov Petrovskii Piscunov type in one space dimension, with stochastic perturbation: \partial_t u = \left (\fracκ{2} u_{xx} + u(1-u) \right…

stat.ML2015★ 1 cited

A Prior Distribution over Directed Acyclic Graphs for Sparse Bayesian Networks

Felix L. Rios, John M. Noble, Timo J. T. Koski

The main contribution of this article is a new prior distribution over directed acyclic graphs, which gives larger weight to sparse graphs. This distribution is intended for struct…

math.PR2014

Lp Solutions for Stochastic Evolution Equation with Nonlinear Potential

John M. Noble

This article considers the stochastic partial differential equation \[ \left\{ \begin{array}{l} u_t = \frac{1}{2} u_{xx} + u^γξu(0,.) = u_0 \end{array}\right. \] \noindent where $ξ…

math.PR2013

Time Homogeneous Diffusion with drift and killing to meet a given marginal

John M. Noble

This article gives conditions on a probability measure and drift field b such that for a given killing field k and a given time t > 0, there is function a such that there is a time…

math.PR2011

Time Homogeneous Diffusions with a Given Marginal at a Deterministic Time

John M. Noble

In this article, it is proved that for any cumulative distribution function with compact support and a specified t > 0, there exists a diffusion martingale which has this law at ti…

stat.CO2010★ 1 cited

An Algorithm for Learning the Essential Graph

John M. Noble

This article presents an algorithm for learning the essential graph of a Bayesian network. The basis of the algorithm is the Maximum Minimum Parents and Children algorithm develope…