scholarly journals Polynomial tails of additive-type recursions

2008 ◽  
Vol DMTCS Proceedings vol. AI,... (Proceedings) ◽  
Author(s):  
Eva-Maria Schopp
Keyword(s):  
Tail Probability ◽  
Upper Bounds ◽  
Random Trees ◽  
Divide And Conquer ◽  
Variation Theory ◽  
Recursive Sequences ◽  
Recursive Structures ◽  
International Audience ◽  
Asymptotic Tail Probability ◽  
Polynomial Bounds

International audience Polynomial 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 mainly focuss on polynomial tails that arise due to heavy tail bounds of the toll term and the starting distributions. Besides estimating the tail probability directly we use a modified version of a theorem from regular variation theory. This theorem states that upper bounds on the asymptotic tail probability can be derived from upper bounds of the Laplace―Stieltjes transforms near zero.

scholarly journals Exponential bounds and tails for additive random recursive sequences

2007 ◽  
Vol Vol. 9 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Ludger Rüschendorf ◽  
Eva-Maria Schopp
Keyword(s):  
Analysis Of Algorithms ◽  
Sufficient Conditions ◽  
Random Trees ◽  
Divide And Conquer ◽  
Recursive Sequences ◽  
Recursive Structures ◽  
International Audience ◽  
Exponential Bounds ◽  
The Moment

Analysis of Algorithms International audience 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ösler (% \citeyearNPRoesler:91, % \citeyearNPRoesler:92) and % \citeNNeininger: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 \citeNKasahara:78.

scholarly journals On rates of convergence in the probabilistic analysis of algorithms

2021 ◽  
Author(s):  
◽  
Jasmin Straub
Keyword(s):  
Normal Limit ◽  
Analysis Of Algorithms ◽  
Rates Of Convergence ◽  
Random Trees ◽  
Divide And Conquer ◽  
Complexity Measures ◽  
Limit Laws ◽  
Contraction Method ◽  
Normal Limits ◽  
Recursive Structures

Within the last thirty years, the contraction method has become an important tool for the distributional analysis of random recursive structures. While it was mainly developed to show weak convergence, the contraction approach can additionally be used to obtain bounds on the rate of convergence in an appropriate metric. Based on ideas of the contraction method, we develop a general framework to bound rates of convergence for sequences of random variables as they mainly arise in the analysis of random trees and divide-and-conquer algorithms. The rates of convergence are bounded in the Zolotarev distances. In essence, we present three different versions of convergence theorems: a general version, an improved version for normal limit laws (providing significantly better bounds in some examples with normal limits) and a third version with a relaxed independence condition. Moreover, concrete applications are given which include parameters of random trees, quantities of stochastic geometry as well as complexity measures of recursive algorithms under either a random input or some randomization within the algorithm.

scholarly journals A survey of multivariate aspects of the contraction method

2006 ◽  
Vol Vol. 8 ◽  
Author(s):  
Ralph Neininger ◽  
Ludger Rüschendorf
Keyword(s):  
Limit Theorems ◽  
Analysis Of Algorithms ◽  
Branching Processes ◽  
Random Trees ◽  
Open Problems ◽  
Limit Laws ◽  
Contraction Method ◽  
Recursive Sequences ◽  
International Audience ◽  
General Conditions

International audience We survey multivariate limit theorems in the framework of the contraction method for recursive sequences as arising in the analysis of algorithms, random trees or branching processes. We compare and improve various general conditions under which limit laws can be obtained, state related open problems and give applications to the analysis of algorithms and branching recurrences.

scholarly journals Additive tree functionals with small toll functions and subtrees of random trees

2012 ◽  
Vol DMTCS Proceedings vol. AQ,... (Proceedings) ◽  
Author(s):  
Stephan Wagner
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Central Limit ◽  
Random Trees ◽  
Divide And Conquer ◽  
Main Motivation ◽  
Additive Tree ◽  
International Audience ◽  
Number Of Leaves ◽  
Labelled Trees

International audience Many parameters of trees are additive in the sense that they can be computed recursively from the sum of the branches plus a certain toll function. For instance, such parameters occur very frequently in the analysis of divide-and-conquer algorithms. Here we are interested in the situation that the toll function is small (the average over all trees of a given size $n$ decreases exponentially with $n$). We prove a general central limit theorem for random labelled trees and apply it to a number of examples. The main motivation is the study of the number of subtrees in a random labelled tree, but it also applies to classical instances such as the number of leaves.

scholarly journals Concentration Properties of Extremal Parameters in Random Discrete Structures

2006 ◽  
Vol DMTCS Proceedings vol. AG,... (Proceedings) ◽  
Author(s):  
Michael Drmota
Keyword(s):  
Maximum Degree ◽  
Random Trees ◽  
Height Distribution ◽  
Exponential Tail ◽  
Scale Free ◽  
Main Emphasis ◽  
Discrete Structures ◽  
International Audience ◽  
Concentration Properties

International audience The purpose of this survey is to present recent results concerning concentration properties of extremal parameters of random discrete structures. A main emphasis is placed on the height and maximum degree of several kinds of random trees. We also provide exponential tail estimates for the height distribution of scale-free trees.

scholarly journals The profile of unlabeled trees

2005 ◽  
Vol DMTCS Proceedings vol. AD,... (Proceedings) ◽  
Author(s):  
Bernhard Gittenberger
Keyword(s):  
Local Time ◽  
Joint Distribution ◽  
Random Trees ◽  
Rooted Trees ◽  
Brownian Excursion ◽  
Level Number ◽  
International Audience ◽  
The Times ◽  
Simply Generated Trees

International audience We consider the number of nodes in the levels of unlabeled rooted random trees and show that the joint distribution of several level sizes (where the level number is scaled by $\sqrt{n}$) weakly converges to the distribution of the local time of a Brownian excursion evaluated at the times corresponding to the level numbers. This extends existing results for simply generated trees and forests to the case of unlabeled rooted trees.

scholarly journals Upper bounds on the non-3-colourability threshold of random graphs

2002 ◽  
Vol Vol. 5 ◽  
Author(s):  
Nikolaos Fountoulakis ◽  
Colin McDiarmid
Keyword(s):  
Random Graph ◽  
Random Graphs ◽  
Upper Bounds ◽  
Average Degree ◽  
Expected Number ◽  
International Audience ◽  
Full Analysis ◽  
A Minor ◽  
Minor Improvement

International audience We present a full analysis of the expected number of 'rigid' 3-colourings of a sparse random graph. This shows that, if the average degree is at least 4.99, then as n → ∞ the expected number of such colourings tends to 0 and so the probability that the graph is 3-colourable tends to 0. (This result is tight, in that with average degree 4.989 the expected number tends to ∞.) This bound appears independently in Kaporis \textitet al. [Kap]. We then give a minor improvement, showing that the probability that the graph is 3-colourable tends to 0 if the average degree is at least 4.989.

scholarly journals Note on the weighted internal path length of b-ary trees

2007 ◽  
Vol Vol. 9 no. 1 (Analysis of Algorithms) ◽  
Author(s):  
Ludger Rüschendorf ◽  
Eva-Maria Schopp
Keyword(s):  
Limit Theorem ◽  
Continuous Time ◽  
Path Length ◽  
Analysis Of Algorithms ◽  
Random Variables ◽  
Time Parameter ◽  
Recursive Sequences ◽  
International Audience

Analysis of Algorithms International audience In a recent paper Broutin and Devroye (2005) have studied the height of a class of edge-weighted random trees.This is a class of trees growing in continuous time which includes many wellknown trees as examples. In this paper we derive a limit theorem for the internal path length for this class of trees.For the proof we extend a limit theorem in Neininger and Rüschendorf (2004) to recursive sequences of random variables with continuous time parameter.

scholarly journals New Refinements and Improvements of Jordan’s Inequality

Mathematics ◽  
2018 ◽  
Vol 6 (12) ◽  
pp. 284 ◽  
Author(s):  
Lina Zhang ◽  
Xuesi Ma
Keyword(s):  
Lower Bounds ◽  
Upper Bounds ◽  
Quadratic Polynomial ◽  
Quartic Polynomial ◽  
Polynomial Bounds ◽  
Jordan’S Inequality

The polynomial bounds of Jordan’s inequality, especially the cubic and quartic polynomial bounds, have been studied and improved in a lot of the literature; however, the linear and quadratic polynomial bounds can not be improved very much. In this paper, new refinements and improvements of Jordan’s inequality are given. We present new lower bounds and upper bounds for strengthened Jordan’s inequality using polynomials of degrees 1 and 2. Our bounds are tighter than the previous results of polynomials of degrees 1 and 2. More importantly, we give new improvements of Jordan’s inequality using polynomials of degree 5, which can achieve much tighter bounds than those previous methods.

Sign in / Sign up

Export Citation Format

Share Document