Pith. sign in

REVIEW

Nonamenable Liouville Graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1010.3365 v1 pith:FGDJJGCA submitted 2010-10-16 math.MG math.PR

Itai Benjamini , Gady Kozma This is my paper · ORCID
classification math.MGmath.PR
keywords graphleveladmitsbinaryboundededgesexpanderfunctions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Add to each level of binary tree edges to make the induced graph on the level a uniform expander. It is shown that such a graph admits no non-constant bounded harmonic functions.

Discussion (0). Continue with ORCID to comment.

Pith tools