Measure Concentration of Markov Tree Processes

Simple item page
dc.creatorKontorovich, Leonid
dc.date2006-08-21
dc.date2006-10-01
dc.date.accessioned2026-07-07T07:21:58Z
dc.date.available2026-07-07T07:21:58Z
dc.descriptionWe prove an apparently novel concentration of measure result for Markov tree processes. The bound we derive reduces to the known bounds for Markov processes when the tree is a chain, thus strictly generalizing the known Markov process concentration results. We employ several techniques of potential independent interest, especially for obtaining similar results for more general directed acyclic graphical models.
dc.description14 pages
dc.identifierhttps://arxiv.org/abs/math/0608511
dc.identifierhttp://arxiv.org/abs/math/0608511
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115495
dc.subjectProbability
dc.subjectFunctional Analysis
dc.subject60G07
dc.titleMeasure Concentration of Markov Tree Processes
dc.typetext

Files

Collections

arXiv