Pith. sign in

REVIEW 1 cited by

Estimating Random Variables from Random Sparse Observations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0709.0145 v1 pith:S2SLCFWS submitted 2007-09-03 cs.IT math.ITmath.PR

classification cs.ITmath.ITmath.PR
keywords randomvariablesobservationsdistributionnumberobservationrelationsparse
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables. Assume each observation Y_a to be a random function of some a random subset of the X_i's, and consider the conditional distribution of X_i given the observations, namely \mu_i(x_i)\equiv\prob\{X_i=x_i|Y\} (a posteriori probability). We establish a general relation between the distribution of \mu_i, and the fixed points of the associated density evolution operator. Such relation holds asymptotically in the large system limit, provided the average number of variables an observation depends on is bounded. We discuss the relevance of our result to a number of applications, ranging from sparse graph codes, to multi-user detection, to group testing.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Simple Algorithm for Best Separable State

    cs.DS 2026-08 conditional novelty 7.0 of 10

    Under perfect completeness, a global-correlation-rounding analysis improves best-separable-state algorithms to n^{O(sqrt(n/epsilon))} and n^{O(sqrt(q))}.

Pith tools