Home
Hostname: page-component-5bf98f6d76-r9mtw Total loading time: 0.281 Render date: 2021-04-22T00:49:36.555Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

# All solutions of the stochastic fixed point equation of the Quicksort process

Published online by Cambridge University Press:  01 February 2019

Corresponding

## Abstract

The Quicksort process R (Rösler (2018)) can be characterized as the unique endogenous solution of the inhomogeneous stochastic fixed point equation R=D(UR1(1∧tU)+𝟭{U<t}(1-U)R2((t-U)∕(1-U))+C(U,t))t on the space 𝒟 of càdlàg functions, such that R(1) has the Quicksort distribution. In this paper we characterize all 𝒟-valued solutions of that equation. Every solution can be represented as the convolution of a solution of the inhomogeneous equation and a general solution of the homogeneous equation (Rüschendorf (2006)). The general solutions of the homogeneous equation are the distributions of Cauchy processes Y with constant drift. Any distribution of R+Y for independent R and Y is a solution of the inhomogeneous equation. Every solution of the inhomogeneous equation is of the form R+Y, where R and Y are independent. The endogenous solutions for the inhomogeneous equation are the shifted Quicksort process distributions. In comparison, the Quicksort distribution is the endogenous solution of the Quicksort fixed point equation unique up to a constant (Rösler (1991)). The general solution can be represented as the convolution of the shifted Quicksort distribution and some symmetric Cauchy distribution (Fill and Janson (2000)), possibly degenerate.

## MSC classification

Type
Original Article
Information
Advances in Applied Probability , December 2018 , pp. 131 - 140

## References

[1]Aldous, D. J. and Bandyopadhyay, A. (2005).A survey of max-type recursive distributional equations.Ann. Appl. Prob. 15,10471110.CrossRefGoogle Scholar
[2]Alsmeyer, G. and Meiners, M. (2013).Fixed points of the smoothing transform: two-sided solutions.Prob. Theory Relat. Fields 155,165199.CrossRefGoogle Scholar
[3]Alsmeyer, G. and Rösler, U. (2006).A stochastic fixed point equation related to weighted branching with deterministic weights.Electron. J. Prob. 11,2756.CrossRefGoogle Scholar
[4]Athreya, K. B. and Ney, P. E. (1972).Branching Processes (Die Grundlehren der Mathematischen Wissenschaften 196).Springer,New York.CrossRefGoogle Scholar
[5]Billingsley, P. (1968).Convergence of Probability Measures.John Wiley,New York.Google Scholar
[6]Fill, J. A. and Janson, S. (2000).A characterization of the set of fixed points of the Quicksort transformation.Electron. Commun. Prob. 5,7784.CrossRefGoogle Scholar
[7]Grübel, R. (1998).Hoare's selection algorithm: a Markov chain approach.J. Appl. Prob. 35,3645.CrossRefGoogle Scholar
[8]Grübel, R. and Roesler, U. (1996).Asymptotic distribution theory for Hoare's selection algorithm.Adv. Appl. Prob. 28,252269.CrossRefGoogle Scholar
[9]Knof, D. and Roesler, U. (2012).The analysis of Find and versions of it.Discrete Math. Theoret. Comput. Sci. 14,129154.Google Scholar
[10]Kurtz, T.,Lyons, R.,Pemantle, R. and Peres, Y. (1997).A conceptual proof of the Kesten‒Stigum theorem for multi-type branching processes. In Classical and Modern Branching Processes (IMA Vol. Math. Appl. 84),Springer,New York, pp. 181185.CrossRefGoogle Scholar
[11]Lyons, R.,Pemantle, R. and Peres, Y. (1995).Conceptual proofs of Llog L criteria for mean behavior of branching processes.Ann. Prob. 23,11251138.CrossRefGoogle Scholar
[12]Martínez, C. (2004).Partial Quicksort. In Proc. 6th Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics (New Orleans, January 2004), eds L. Arge, G. F. Italiano and R. Sedgewick,SIAM, pp. 224228.Google Scholar
[13]Martínez, C. and Rösler, U. (2010).Partial Quicksort and Quickpartitionsort. In 1st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10; Discrete Math. Theoret. Comput. Sci. AM),Association of Discrete Mathematics and Theoretical Computer Science,Nancy, pp. 505512.Google Scholar
[14]Meiners, M. and Mentemeier, S. (2017).Solutions to complex smoothing equations.Prob. Theory Relat. Fields 168,199268.CrossRefGoogle Scholar
[15]Mentemeier, S. (2016).The fixed points of the multivariate smoothing transform.Prob. Theory Relat. Fields 164,401458.CrossRefGoogle Scholar
[16]Neininger, R. and Rüschendorf, L. (2005).Analysis of algorithms by the contraction method: additive and max-recursive equations. In Interacting Stochastic Systems, eds. J.-D. Deuschel and A. Greven,Springer,Berlin, pp. 435450.CrossRefGoogle Scholar
[17]Neininger, R. and Sulzbach, H. (2015).On a functional contraction method.Ann. Prob. 43,17771822.CrossRefGoogle Scholar
[18]Ragab, M. and Roesler, U. (2014).The Quicksort process.Stoch. Process. Appl. 124,10361054.CrossRefGoogle Scholar
[19]Rao, M. M. (1971).Projective limits of probability spaces.J. Multivariate Anal. 1,2857.CrossRefGoogle Scholar
[20]Rösler, U. (1991).A limit theorem for 'Quicksort'.RAIRO Inf. Théor. Appl. 25,85100.CrossRefGoogle Scholar
[21]Rösler, U. (1992).A fixed point theorem for distributions.Stoch. Process. Appl. 42,195214.CrossRefGoogle Scholar
[22]Rösler, U. (1993).The weighted branching process. In Dynamics of Complex and Irregular Systems (Bielefeld, 1991; Bielefeld Encount. Math. Phys. VIII),World Scientific,River Edge, NJ, pp. 154165.Google Scholar
[23]Rösler, U. (2018).Almost sure convergence to the Quicksort process. To appear in Stoch. Process. Appl.Google Scholar
[24]Rösler, U. and Rüschendorf, L. (2001).The contraction method for recursive algorithms.Algorithmica 29,333.CrossRefGoogle Scholar
[25]Rüschendorf, L. (2006).On the stochastic recursive equations of sum and max type.J. Appl. Prob. 43,687703.CrossRefGoogle Scholar

### Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 167 *
View data table for this chart

* Views captured on Cambridge Core between 01st February 2019 - 22nd April 2021. This data will be updated every 24 hours.

You have Access

# Send article to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

All solutions of the stochastic fixed point equation of the Quicksort process
Available formats
×

# Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

All solutions of the stochastic fixed point equation of the Quicksort process
Available formats
×

# Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

All solutions of the stochastic fixed point equation of the Quicksort process
Available formats
×
×