Enumerating graphs and Brownian motion

DOI10.1002/(SICI)1097-0312(199703)50:3%3C291::AID-CPA4%3E3.0.CO;2-6MaRDI QIDQ4342733zbMATH OpenOpenAlexFDO

Authors Joel Spencer

Publication date 27 July 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0312(199703)50:3%3C291::aid-cpa4%3E3.0.co;2-6

zbMATH Keywords

asymptoticsenumerationtrees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Brownian motion (60J65)

Recommendations

• Brownian approximation to counting graphs
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• Asymptotic properties of labeled connected graphs
• Counting connected graphs asymptotically

Cited in

(25)

• Brownian excursions, critical random graphs and the multiplicative coalescent
• Generalized covariances of multi-dimensional Brownian excursion local times.
• Exact formulas for moments of sums of classical parking functions
• On the critical probability in percolation
• The second term in the asymptotics for the number of points moving along a metric graph
• On the largest component of the random graph at a nearcritical stage
• A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0
• Gončarov polynomials and parking functions
• The sum of powers of subtree sizes for conditioned Galton-Watson trees
• Another proof of Wright's inequalities
• The continuum limit of critical random graphs
• Multiparking functions, graph searching, and the Tutte polynomial
• Reinforced weak convergence of stochastic processes
• Random maps, coalescing saddles, singularity analysis, and Airy phenomena
• scientific article; zbMATH DE number 1984539 (Why is no real title available?)
• scientific article; zbMATH DE number 1552347 (Why is no real title available?)
• Brownian approximation to counting graphs
• Local asymptotics for the area of random walk excursions
• On the length of a random minimum spanning tree
• Generalized parking functions, tree inversions, and multicolored graphs
• On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
• Parking functions: from combinatorics to probability
• Critical scaling profile for trees and connected subgraphs on the complete graph
• Counting connected graphs asymptotically
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas

This page was built for publication: Enumerating graphs and Brownian motion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4342733)