Papers
Topics
Authors
Recent
Search
2000 character limit reached

Recursive Soft Drop

Published 10 Apr 2018 in hep-ph and hep-ex | (1804.03657v2)

Abstract: We introduce a new jet substructure technique called Recursive Soft Drop, which generalizes the Soft Drop algorithm to have multiple grooming layers. Like the original Soft Drop method, this new recursive variant traverses a jet clustering tree to remove soft wide-angle contamination. By enforcing the Soft Drop condition N times, Recursive Soft Drop improves the jet mass resolution for boosted hadronic objects like W bosons, top quarks, and Higgs bosons. We further show that this improvement in mass resolution persists when including the effects of pileup, up to large pileup multiplicities. In the limit that N goes to infinity, the resulting groomed jets formally have zero catchment area. As an alternative approach, we present a bottom-up version of Recursive Soft Drop which, in its local form, is similar to Recursive Soft Drop and which, in its global form, can be used to perform event-wide grooming.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.