Enumerating graphs and Brownian motion
From MaRDI portal
Publication:4342733
DOI<291::AID-CPA4>3.0.CO;2-6 10.1002/(SICI)1097-0312(199703)50:3<291::AID-CPA4>3.0.CO;2-6zbMath0871.05032OpenAlexW1975340857MaRDI QIDQ4342733
Publication date: 27 July 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0312(199703)50:3<291::aid-cpa4>3.0.co;2-6
Related Items
A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0, Gončarov polynomials and parking functions, Brownian excursions, critical random graphs and the multiplicative coalescent, On breadth‐first constructions of scaling limits of random graphs and random unicellular maps, Generalized covariances of multi-dimensional Brownian excursion local times., Parking functions: from combinatorics to probability, The continuum limit of critical random graphs, Exact formulas for moments of sums of classical parking functions, On the Length of a Random Minimum Spanning Tree, On the critical probability in percolation, Multiparking functions, graph searching, and the Tutte polynomial, Reinforced weak convergence of stochastic processes, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Generalized parking functions, tree inversions, and multicolored graphs, The sum of powers of subtree sizes for conditioned Galton-Watson trees, Local asymptotics for the area of random walk excursions, On the largest component of the random graph at a nearcritical stage
