ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.00554
  4. Cited By
A structural Markov property for decomposable graph laws that allows
  control of clique intersections
v1v2 (latest)

A structural Markov property for decomposable graph laws that allows control of clique intersections

1 May 2017
P. Green
Alun Thomas
ArXiv (abs)PDFHTML

Papers citing "A structural Markov property for decomposable graph laws that allows control of clique intersections"

3 / 3 papers shown
Title
Implementing a Metropolis sampler on decomposable graphs using a variety
  of ways to represent the graph
Implementing a Metropolis sampler on decomposable graphs using a variety of ways to represent the graph
Alun Thomas
10
0
0
16 Oct 2023
Parallel sampling of decomposable graphs using Markov chain on junction
  trees
Parallel sampling of decomposable graphs using Markov chain on junction trees
Mohamad Elmasri
19
1
0
05 Sep 2022
Sequential sampling of junction trees for decomposable graphs
Sequential sampling of junction trees for decomposable graphs
Jimmy Olsson
T. Pavlenko
Felix L. Rios
51
7
0
02 Jun 2018
1