, If |r ? p(1 ? p)| ? ? 2 /4, then, by considering the off-diagonal term, we have: M (y) ? M 0 ? ? |? ? pp ? r|
, If |r ? p(1 ? p)| ? ? 2 /4, then, by considering the first term on the diagonal, we have M (y) ? M 0 ? ? ? 2 /4. If |r ? p(1 ? p)| ? ? 2 /4, then, by considering the off-diagonal term, we have: M (y) ? M 0 ? ? |? ? pp + r|. , we get
, Assume then that 1 ? p ? p < ??/2. For ? = r ? p(1 ? p) ?
, with f = W (y, ·), g = W (y , ·) and ? = 1 ? p ? p , we get that: ? ? (1 ? ?)(? ? ?)
, If |r ? p(1 ? p)| ? ? 2 /4, then, by considering the first term on the diagonal, we have M (y) ? M 0 ? ? ? 2 /4. If |r ? p(1 ? p)| ? ? 2 /4, then, by considering the off-diagonal term, we have: M (y) ? M 0 ? ? |? ? pp + r|
, 123) holds when M 0 ? F + , when M 0 ? F ? and either |1 ? p ? p | > ?/2 or
Set f 1 = min(f, g) and g 1 = max(f, g) so 1 = [0,1] f g. Set h = min(f 1 , (1 ? ? ? g 1 )) as well as f 2 = f 1 ? h and ,
The forest associated with the record process on a Lévy tree, Stochastic Process. Appl, vol.123, issue.9, pp.3497-3517, 2013. ,
Record process on the continuum random tree, ALEA Lat. Am. J. Probab. Math. Stat, vol.10, issue.1, pp.225-251, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00609467
Local limits of conditioned Galton-Watson trees: the condensation case, Electron. J. Probab, vol.19, issue.56, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00909604
Local limits of conditioned Galton-Watson trees: the infinite spine case, Electron. J. Probab, vol.19, issue.2, p.19, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00813145
Stochastic blockmodel approximation of a graphon: Theory and consistent estimation, Advances in Neural Information Processing Systems, pp.692-700, 2013. ,
Statistical mechanics of complex networks, Rev. Modern Phys, vol.74, issue.1, pp.47-97, 2002. ,
Asymptotic fringe distributions for general families of random trees, Ann. Appl. Probab, vol.1, issue.2, pp.228-266, 1991. ,
The continuum random tree, I. Ann. Probab, vol.19, issue.1, pp.1-28, 1991. ,
The continuum random tree. II. An overview, Stochastic analysis, vol.167, pp.23-70, 1990. ,
The continuum random tree, III. Ann. Probab, vol.21, issue.1, pp.248-289, 1993. ,
Probability distributions on cladograms, Random discrete structures, vol.76, pp.1-18, 1993. ,
Representations for partially exchangeable arrays of random variables, J. Multivariate Anal, vol.11, issue.4, pp.581-598, 1981. ,
Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today, Statist. Sci, vol.16, issue.1, pp.23-34, 2001. ,
A p* primer: Logit models for social networks, Social Networks, vol.21, issue.1, pp.37-66, 1999. ,
Die Grundlehren der mathematischen Wissenschaften, 0196. ,
A short history of mathematical population dynamics, 2011. ,
Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999. ,
A central limit theorem for decomposable random variables with applications to random graphs, J. Combin. Theory Ser. B, vol.47, issue.2, pp.125-145, 1989. ,
Recurrence of distributional limits of finite planar graphs. Electron, J. Probab, vol.6, issue.23, p.13, 2001. ,
On the dependence of the Berry-Essèen bound on dimension, J. Statist. Plann. Inference, vol.113, issue.2, pp.385-402, 2003. ,
, Lévy Processes, 1996.
Normal approximation and asymptotic expansions, Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), vol.64, 2010. ,
Relations entre pont et excursion du mouvement brownien réel, Ann. Inst. H. Poincaré Probab. Statist, vol.22, issue.1, pp.1-7, 1986. ,
A nonparametric view of network models and newman-girvan and other modularities, Proceedings of the National Academy of Sciences, 2009. ,
The method of moments and degree distributions for network models, Ann. Statist, vol.39, issue.5, pp.2280-2301, 2011. ,
A sequential importance sampling algorithm for generating random graphs with prescribed degrees, Internet Math, vol.6, issue.4, pp.489-522, 2010. ,
The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance, Ann. Appl. Probab, vol.16, issue.4, pp.2195-2214, 2006. ,
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J. Combin, vol.1, issue.4, pp.311-316, 1980. ,
Random graphs, Cambridge Studies in Advanced Mathematics, vol.73, 2001. ,
The Erd?s-Rényi theory of random graphs, Paul Erd?s and his mathematics, II, vol.11, pp.79-134, 1999. ,
The phase transition in inhomogeneous random graphs, Random Structures Algorithms, vol.31, issue.1, pp.3-122, 2007. ,
Metrics for sparse graphs, Surveys in combinatorics, vol.365, pp.211-287, 2009. ,
Sparse graphs: metrics and random models, Random Structures Algorithms, vol.39, issue.1, pp.1-38, 2011. ,
Convergent sequences of sparse graphs: a large deviations approach, Random Structures Algorithms, vol.51, issue.1, pp.52-89, 2017. ,
Left and right convergence of graphs with bounded degree, Random Structures Algorithms, vol.42, issue.1, pp.1-28, 2013. ,
Moments of two-variable functions and the uniqueness of graph limits, Geom. Funct. Anal, vol.19, issue.6, pp.1597-1619, 2010. ,
Limits of randomly grown graph sequences, European J. Combin, vol.32, issue.7, pp.985-999, 2011. ,
Counting graph homomorphisms, Topics in discrete mathematics, vol.26, pp.315-371, 2006. ,
Private graphon estimation for sparse graphs, Advances in Neural Information Processing Systems, pp.1369-1377, 2015. ,
Convergent sequences of dense graphs. I. Subgraph frequencies, metric properties and testing, Adv. Math, vol.219, issue.6, pp.1801-1851, 2008. ,
Convergent sequences of dense graphs II. Multiway cuts and statistical physics, Ann. of Math, vol.176, issue.2, pp.151-219, 2012. ,
Exact formulas for the variance of several balance indices under the Yule model, J. Math. Biol, vol.67, issue.6-7, pp.1833-1846, 2013. ,
The collected mathematical papers, vol.8, 2009. ,
An introduction to large deviations for random graphs, Bull. Amer. Math. Soc. (N.S.), vol.53, issue.4, pp.617-642, 2016. ,
Random graphs with a given degree sequence, Ann. Appl. Probab, vol.21, issue.4, pp.1400-1435, 2011. ,
The large deviation principle for the Erd?s-Rényi random graph, European J. Combin, vol.32, issue.7, pp.1000-1017, 2011. ,
Arbres pour l'algorithmique, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01708981
Multivariate normal approximation by Stein's method: The concentration inequality approach, 2015. ,
Complex graphs and networks, Number, vol.107, 2006. ,
Review of phylogenetics: the theory and practice of phylogenetic systematics, Syst. Zool, vol.31, pp.100-104, 1982. ,
Poisson approximation of subgraph counts in stochastic block models and a graphon model, ESAIM Probab. Stat, vol.20, pp.131-142, 2016. ,
Interpolation and approximation, 1975. ,
Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon, 2018. ,
Cost functionals for large (uniform and simply generated) random trees, Electron. J. Probab, vol.23, pp.1-36, 2018. ,
A note on the height of binary search trees, J. Assoc. Comput. Mach, vol.33, issue.3, pp.489-498, 1986. ,
Branching processes in the analysis of the heights of trees, Acta Inform, vol.24, issue.3, pp.277-298, 1987. ,
Limit laws for local counters in random binary search trees, Random Structures Algorithms, vol.2, issue.3, pp.303-315, 1991. ,
Branching processes and their applications in the analysis of tree structures and tree algorithms, Probabilistic methods for algorithmic discrete mathematics, vol.16, pp.249-314, 1998. ,
Branching processes and their applications in the analysis of tree structures and tree algorithms, Probabilistic methods for algorithmic discrete mathematics, vol.16, pp.249-314, 1998. ,
Limit laws for sums of functions of subtrees of random binary search trees, SIAM J. Comput, vol.32, issue.1, pp.152-171, 2003. ,
Graph limits and exchangeable random graphs, Rend. Mat. Appl, vol.28, issue.7, pp.33-61, 2008. ,
On the Markov chain for the move-to-root rule for binary search trees, Ann. Appl. Probab, vol.5, issue.1, pp.1-19, 1995. ,
Rates of convergence for the move-to-root Markov chain for binary search trees, Ann. Appl. Probab, vol.5, issue.1, pp.20-36, 1995. ,
Multiway trees of maximum and minimum probability under the random permutation model, Combin. Probab. Comput, vol.5, issue.4, pp.351-371, 1996. ,
Total path length for random recursive trees, Random graphs and combinatorial structures, vol.8, pp.317-333, 1997. ,
Wiener index of trees: theory and applications, Acta Appl. Math, vol.66, issue.3, pp.211-249, 2001. ,
T -theory: an overview, Discrete metric spaces, vol.17, pp.161-175, 1994. ,
Random trees. SpringerWienNewYork, Vienna, 2009. An interplay between combinatorics and probability ,
URL : https://hal.archives-ouvertes.fr/inria-00001281
A limit theorem for the contour process of conditioned Galton-Watson trees, Ann. Probab, vol.31, issue.2, pp.996-1027, 2003. ,
Random trees, Lévy processes and spatial branching processes, Astérisque, issue.281, p.147, 2002. ,
Probabilistic and fractal aspects of Lévy trees, Probab. Theory Related Fields, vol.131, issue.4, pp.553-603, 2005. ,
Random graph dynamics, of Cambridge Series in Statistical and Probabilistic Mathematics, vol.20, 2010. ,
A measure-theoretic approach to the theory of dense hypergraphs, Adv. Math, vol.231, issue.3-4, pp.1731-1772, 2012. ,
On random graphs. I, Publ. Math. Debrecen, vol.6, pp.290-297, 1959. ,
On the evolution of random graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl, vol.5, pp.17-61, 1960. ,
On the evolution of random graphs, Bull. Inst. Internat. Statist, vol.38, pp.343-347, 1961. ,
On the strength of connectedness of a random graph, Acta Math. Acad. Sci. Hungar, vol.12, pp.261-267, 1961. ,
Lectures from the 35th Summer School on Probability Theory, Lecture Notes in Mathematics, vol.1920, 2005. ,
Rayleigh processes, real trees, and root growth with re-grafting, Probab. Theory Related Fields, vol.134, issue.1, pp.81-126, 2006. ,
On power-law relationships of the internet topology, ACM SIGCOMM computer communication review, vol.29, pp.251-262, 1999. ,
Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics, Bernoulli, vol.21, issue.4, pp.2157-2189, 2015. ,
Inferring phylogenies, Sinauer associates Sunderland, vol.2, 2004. ,
Mod-? convergence, SpringerBriefs in Probability and Mathematical Statistics, 2016. ,
, Graphons, permutons and the Thoma simplex: three mod-Gaussian moduli spaces, 2017.
On the distribution of binary search trees under the random permutation model, Random Struct. Algo, vol.8, issue.1, pp.1-25, 1996. ,
Singularity analysis, Hadamard products, and tree recurrences, J. Comput. Appl. Math, vol.174, issue.2, pp.271-313, 2005. ,
Smoothness and decay properties of the limiting Quicksort density function, Mathematics and computer science, pp.53-64, 2000. ,
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees, Ann. Comb, vol.12, issue.4, pp.403-416, 2009. ,
Limiting distributions for additive functionals on Catalan trees, Theoret. Comput. Sci, vol.326, issue.1-3, pp.69-102, 2004. ,
A repertoire for additive functionals of uniformly distributed m-ary search trees (extended abstract), 2005 International Conference on Analysis of Algorithms, pp.105-114 ,
, Discrete Math. Theor. Comput. Sci, 2005.
Transfer theorems and asymptotic distributional results for m-ary search trees, Random Struct. Algo, vol.26, issue.4, pp.359-391, 2005. ,
Patterns in random binary search trees, Random Struct. Algo, vol.11, issue.3, pp.223-244, 1997. ,
URL : https://hal.archives-ouvertes.fr/inria-00073700
Probabilities on cladograms: Introduction to the alpha model, ProQuest LLC, 2006. ,
Markov graphs, J. Amer. Statist. Assoc, vol.81, issue.395, pp.832-842, 1986. ,
DOI : 10.1080/01621459.1986.10478342
Reflection positivity, rank connectivity, and homomorphism of graphs, J. Amer. Math. Soc, vol.20, issue.1, pp.37-51, 2007. ,
Quick approximation to matrices and applications, vol.19, pp.175-220, 1999. ,
Rate-optimal graphon estimation, Ann. Statist, vol.43, issue.6, pp.2624-2652, 2015. ,
Some elementary inequalities relating to the gamma and incomplete gamma function, J. Math. and Phys, vol.38, p.60, 1959. ,
Random graphs, Ann. Math. Statist, vol.30, pp.1141-1144, 1959. ,
A local central limit theorem for triangles in a random graph, Random Structures Algorithms, vol.48, issue.4, pp.732-750, 2016. ,
Fifty years of the Wiener index, 1997. ,
The theory of branching processes. Dover Phoenix Editions, 2002. ,
Limits of locally-globally convergent graph sequences, Geom. Funct. Anal, vol.24, issue.1, pp.269-296, 2014. ,
Patterns in tree balance among cladistic, phenetic, and randomly generated phylogenetic trees, Evolution, vol.46, issue.6, pp.1818-1826, 1992. ,
A class of statistics with asymptotically normal distribution, Ann. Math. Statistics, vol.19, pp.293-325, 1948. ,
Stochastic blockmodels: first steps, Social Networks, vol.5, issue.2, pp.109-137, 1983. ,
An exponential family of probability distributions for directed graphs, J. Amer. Statist. Assoc, vol.76, issue.373, pp.33-65, 1981. ,
Limit laws for functions of fringe trees for binary search trees and random recursive trees, Electron. J. Probab, vol.20, issue.4, p.51, 2015. ,
Fringe trees, Crump-Mode-Jagers branching processes and m-ary search trees, Probab. Surv, vol.14, pp.53-154, 2017. ,
Row-column exchangeability and a generalized model for probability, Exchangeability in probability and statistics, pp.281-291, 1981. ,
Phase change of limit laws in the quicksort recurrence under varying toll functions, SIAM J. Comput, vol.31, issue.6, pp.1687-1722, 2002. ,
Second printing, corrected, Die Grundlehren der mathematischen Wissenschaften, p.125, 1974. ,
The Wiener index of simply generated random trees, Random Struct. Algo, vol.22, issue.4, pp.337-358, 2003. ,
Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation, Probab. Surv, vol.9, pp.103-252, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01197228
Asymptotic normality of fringe subtrees and additive functionals in conditioned Galton-Watson trees, Random Struct. Algo, vol.48, issue.1, pp.57-101, 2016. ,
The center of mass of the ISE and the Wiener index of trees, Electron. Comm. Probab, vol.9, pp.178-187, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00005089
Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, 2000. ,
The asymptotic distributions of generalized U -statistics with applications to random graphs, Probab. Theory Related Fields, vol.90, issue.3, pp.341-375, 1991. ,
Condensation in nongeneric trees, J. Stat. Phys, vol.142, issue.2, pp.277-313, 2011. ,
The genealogy of genealogy: branching processes before (and after) 1873, Bull. London Math. Soc, vol.7, issue.3, pp.225-253, 1975. ,
The Galton-Watson process conditioned on the total progeny, J. Appl. Probability, vol.12, issue.4, pp.800-806, 1975. ,
Subdiffusive behavior of random walk on a random cluster, Ann. Inst. H. Poincaré Probab. Statist, vol.22, issue.4, pp.425-487, 1986. ,
Searching for evolutionary patterns in the shape of a phylogenetic tree, Evolution, vol.47, issue.4, pp.1171-1181, 1993. ,
Oracle inequalities for network models and sparse graphon estimation, Ann. Statist, vol.45, issue.1, pp.316-354, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01602604
Optimal graphon estimation in cut distance, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01490371
The art of computer programming, Fundamental algorithms, vol.1, 1997. ,
The art of computer programming, Seminumerical algorithms, vol.2, 1998. ,
The art of computer programming, vol.3, 1998. ,
Invariance principles for Galton-Watson trees conditioned on the number of leaves, Stochastic Process. Appl, vol.122, issue.9, pp.3126-3172, 2012. ,
A simple proof of Duquesne's theorem on contour processes of conditioned Galton-Watson trees, Séminaire de Probabilités XLV, vol.2078, pp.537-558, 2013. ,
Limit theorems for conditioned non-generic Galton-Watson trees, Ann. Inst. Henri Poincaré Probab. Stat, vol.51, issue.2, pp.489-511, 2015. ,
Multivariate central limit theorems for rademacher functionals with applications, 2017. ,
Variational Bayes model averaging for graphon functions and motif frequencies inference in W -graph models, Stat. Comput, vol.26, issue.6, pp.1173-1185, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01519750
The uniform random tree in a Brownian excursion, Probab. Theory Related Fields, vol.96, issue.3, pp.369-383, 1993. ,
Random trees and applications, Probab. Surv, vol.2, pp.245-311, 2005. ,
Branching processes in Lévy processes: the exploration process, Ann. Probab, vol.26, issue.1, pp.213-252, 1998. ,
Scaling limits of random trees and planar maps, Probability and statistical physics in two and more dimensions, vol.15, pp.155-211, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00559461
Large networks and graph limits, vol.60, 2012. ,
Limits of dense graph sequences, J. Combin. Theory Ser. B, vol.96, issue.6, pp.933-957, 2006. ,
A short proof of the equivalence of left and right convergence for sparse graphs, European J. Combin, vol.53, pp.1-7, 2016. ,
Limiting distributions for path lengths in recursive trees, Probab. Engrg. Inform. Sci, vol.5, issue.1, pp.53-59, 1991. ,
Evolution of random search trees, Wiley-Interscience Series in Discrete Mathematics and Optimization, 1992. ,
, Statistical inference for network samples using subgraph counts, 2017.
On the altitude of nodes in random trees, Canad. J. Math, vol.30, issue.5, pp.997-1015, 1978. ,
On the log-product of the subtree-sizes of random trees, Random Structures Algorithms, vol.12, issue.2, pp.197-212, 1998. ,
A new balance index for phylogenetic trees, Math. Biosci, vol.241, issue.1, pp.125-136, 2013. ,
A critical point for random graphs with a given degree sequence. Random structures & algorithms, vol.6, pp.161-180, 1995. ,
The size of the giant component of a random graph with a given degree sequence, Combinatorics, probability and computing, vol.7, issue.3, pp.295-305, 1998. ,
Inferring evolutionary process from phylogenetic tree shape. The quarterly review of Biology, vol.72, pp.31-54, 1997. ,
A non-uniform bound of the remainder term in the central limit theorem for Bernoulli random variables, J. Math. Sci, vol.214, issue.1, pp.83-100, 2016. ,
On binary search tree recursions with monomials as toll functions, J. Comput. Appl. Math, vol.142, issue.1, pp.185-196, 2002. ,
The Wiener index of random trees, Combin. Probab. Comput, vol.11, issue.6, pp.587-597, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-01184772
Arbres et processus de Galton-Watson, Ann. Inst. H. Poincaré Probab. Statist, vol.22, issue.2, pp.199-207, 1986. ,
Networks: an introduction, 2010. ,
The structure and dynamics of networks, vol.19, 2011. ,
Random graphs with arbitrary degree distributions and their applications, Physical review E, vol.64, issue.2, p.26118, 2001. ,
Random graph models of social networks, Proceedings of the National Academy of Sciences, vol.99, issue.1, pp.2566-2572, 2002. ,
The structure and function of networks, Proceedings of the Europhysics Conference on Computational Physics (CCP 2001) (Aachen), vol.147, pp.40-45, 2002. ,
Asymptotic normality of graph statistics, J. Statist. Plann. Inference, vol.21, issue.2, pp.209-222, 1989. ,
Estimation and prediction for stochastic blockstructures, J. Amer. Statist. Assoc, vol.96, issue.455, pp.1077-1087, 2001. ,
Subgraph counts in random graphs using incomplete U -statistics methods, Proceedings of the First Japan Conference on Graph Theory and Applications, vol.72, pp.299-310, 1986. ,
Statistical mechanics of networks, Phys. Rev. E, vol.70, issue.3, p.13, 2004. ,
Lectures from the 32nd Summer School on Probability Theory, Lecture Notes in Mathematics, vol.1875, 2002. ,
Networks of scientific papers, Science, pp.510-515, 1965. ,
, Additive functionals of d-ary increasing trees, 2016.
A limiting distribution for quicksort, RAIRO Inform. Théor. Appl, vol.23, issue.3, pp.335-343, 1989. ,
Random subgraph counts and U -statistics: multivariate normal approximation via exchangeable pairs and embedding, J. Appl. Probab, vol.47, issue.2, pp.378-393, 2010. ,
Continuous martingales and Brownian motion, Grundlehren der Mathematischen Wissenschaften, vol.293 ,
, , 1999.
On q-functional equations and excursion moments, Discrete Math, vol.309, issue.1, pp.207-230, 2009. ,
An introduction to exponential random graph (p*) models for social networks, Social networks, vol.29, issue.2, pp.173-191, 2007. ,
Cambridge Mathematical Library, Markov processes, and martingales, vol.2, 2000. ,
A limit theorem for, Quicksort". RAIRO Inform. Théor. Appl, vol.25, issue.1, pp.85-100, 1991. ,
The contraction method for recursive algorithms, Algorithmica, vol.29, issue.1-2, pp.3-33, 2001. ,
When are small subgraphs of a random graph normally distributed? Probab. Theory Related Fields, vol.78, pp.1-10, 1988. ,
, phenograms. Systematic Biology, vol.21, issue.2, pp.225-226, 1972.
, Algorithms. Addison-Wesley Series in Computer Science, 1983.
An introduction to the analysis of algorithms, 2013. ,
, Mathematics and its Applications, vol.24, 2003.
, Sokal. Tree balance. Systematic Zoology, vol.39, issue.3, pp.266-276, 1990.
On a general class of models for interaction, SIAM Rev, vol.28, issue.4, pp.513-527, 1986. ,
The continuum random tree is the scaling limit of unlabelled unrooted trees, 2014. ,
URL : https://hal.archives-ouvertes.fr/ensl-01461633
Regular partitions of graphs, Problèmes combinatoires et théorie des graphes, vol.260, pp.399-401, 1976. ,
On the total heights of random rooted binary trees, J. Combin. Theory Ser. B, vol.61, issue.2, pp.155-166, 1994. ,
Generating graphs uniformly at random. In Computational graph theory, Comput. Suppl, vol.7, pp.235-255, 1990. ,
Chemical graph theory. Routledge, 2018. ,
Introduction to Mathematical Probability, 1937. ,
Random graphs and complex networks, Cambridge Series in Statistical and Probabilistic Mathematics, vol.1 ,
, of Cambridge Series in Statistical and Probabilistic Mathematics, vol.3, 1998.
A relation between Brownian bridge and Brownian excursion, Ann. Probab, vol.7, issue.1, pp.143-149, 1979. ,
Additive tree functionals with small toll functions and subtrees of random trees, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12), pp.67-80, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-01197234
Central limit theorems for additive tree parameters with small toll functions, Combin. Probab. Comput, vol.24, issue.1, pp.329-353, 2015. ,
Collective dynamics of 'small-world'networks. nature, vol.393, p.440, 1998. ,
Structural determination of paraffin boiling points, Journal of the American Chemical Society, vol.69, issue.1, pp.17-20, 1947. ,
Nonparametric graphon estimation, 2013. ,
-a mathematical theory of evolution, based on the conclusions of dr. jc willis, fr s. Phil, Trans. R. Soc. Lond. B, vol.213, pp.21-87, 1925. ,
Asymptotic cost of cutting down random free trees, Journal of The Iranian Statistical Society, vol.11, issue.1, pp.57-73, 2012. ,