Tail behavior of solutions of linear recursions on trees (Q424501): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
Property / arXiv ID | |||
Property / arXiv ID: 1108.3809 / rank | |||
Normal rank |
Revision as of 14:30, 18 April 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Tail behavior of solutions of linear recursions on trees |
scientific article |
Statements
Tail behavior of solutions of linear recursions on trees (English)
0 references
1 June 2012
0 references
The aim of the paper is to investigate the tail behavior of the solution to the stochastic fixed point equation \(R= \sum_{i=1}^N C_iR_i + Q\) where the equality is in distribution, \((Q, N, C_1, C_2, \dots)\) is a random vector and \(\{R_i\}\) is a sequence of i.i.d. random variables. The author constructs an explicit solution on a weighted branching tree which is the only one of practical interest. The main result of the paper is the derivation of uniform bound for the distribution of the sum of weights in the \(n\)-th generation.
0 references
stochastic fixed point equations
0 references
weighted branching processes
0 references
regular variation
0 references
stochastic recursion
0 references
large deviations
0 references
random difference equations
0 references
multiplicative cascades
0 references