exponential bounds and tails for additive random recursive sequences
Clicks: 96
ID: 166112
2007
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
28.5
/100
96 views
12 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #12 of 23 articles by views in Proteins
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Exponential bounds and tail estimates are derived for additive random recursive sequences, which typically arise as functionals of recursive structures, of random trees or in recursive algorithms. In particular they arise as parameters of divide and conquer type algorithms. We derive tail bounds from estimates of the Laplace transforms and of the moment sequences. For the proof we use some classical exponential bounds and some variants of the induction method. The paper generalizes results of R"osler (% citeyearNP{Roesler:91}, % citeyearNP{Roesler:92}) and % citeN{Neininger:05} on subgaussian tails to more general classes of additive random recursive sequences. It also gives sufficient conditions for tail bounds of the form $exp(-a t^p)$ which are based on a characterization of citeN{Kasahara:78}.
| Reference Key |
rschendorf2007discreteexponential
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Ludger Rüschendorf;Eva-Maria Schopp |
| Journal | Proteins |
| Year | 2007 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.