Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems (Q6589568)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems |
scientific article; zbMATH DE number 7898695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems |
scientific article; zbMATH DE number 7898695 |
Statements
Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems (English)
0 references
20 August 2024
0 references
augmenting path
0 references
Eulerian matrix
0 references
fibre sampler
0 references
Markov basis
0 references
mixing time
0 references
random walk
0 references
second largest eigenvalue modulus
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.6947541832923889
0 references
0.6697776317596436
0 references
0.6683014035224915
0 references
0.66294264793396
0 references
0.6623532176017761
0 references
