Singularity Analysis of Generating Functions
From MaRDI portal
Publication:3496337
DOI10.1137/0403019zbMath0712.05004OpenAlexW2018919817MaRDI QIDQ3496337
Philippe Flajolet, Andrew M. Odlyzko
Publication date: 1990
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0403019
Related Items (only showing first 100 items - show all)
A new generalized Weibull family of distributions: mathematical properties and applications ⋮ XML compression via directed acyclic graphs ⋮ Asymptotic distributions and a multivariate Darboux method in enumeration problems ⋮ A calculus for the random generation of labelled combinatorial structures ⋮ Average cost of Duval's algorithm for generating Lyndon words ⋮ Combinatorics meets potential theory ⋮ Batcher's odd-even exchange revisited: a generating functions approach ⋮ The height of multiple edge plane trees ⋮ Random walks, heat equation and distributed algorithms ⋮ Compositions into powers of \(b\): asymptotic enumeration and parameters ⋮ On the cost of fixed partial match queries in \(K\)-d trees ⋮ A unified approach to linear probing hashing with buckets ⋮ Analytic continuation of a class of Dirichlet series ⋮ Random walk with long-range interaction with a barrier and its dual: exact results ⋮ Enumeration of cubic multigraphs on orientable surfaces ⋮ Heavy-traffic asymptotics of a priority polling system with threshold service policy ⋮ The density of the ISE and local limit laws for embedded trees ⋮ The left-right-imbalance of binary search trees ⋮ On the number of matchings of a tree ⋮ The generalized weighted probability measure on the symmetric group and the asymptotic behavior of the cycles ⋮ Enumerative properties of rooted circuit maps ⋮ A central limit theorem for the number of degree-\(k\) vertices in random maps ⋮ Analytical depoissonization and its applications ⋮ On the share of closed \(\mathsf {IL}\) formulas which are also in \(\mathsf {GL}\) ⋮ Analytic combinatorics of chord and hyperchord diagrams with \(k\) crossings ⋮ Restrictive patterns of combinatorial structures via comparative analysis ⋮ A new generalized Weibull distribution generated by gamma random variables ⋮ Outerplanar obstructions for a feedback vertex set ⋮ On some expansions for the Euler gamma function and the Riemann zeta function ⋮ Analysis of a drop-push model for percolation and coagulation ⋮ Many 2-level polytopes from matroids ⋮ The degree profile of random Pólya trees ⋮ Asymptotic variance of the self-intersections of stable random walks using Darboux-Wiener theory ⋮ Total progeny in killed branching random walk ⋮ Symmetric circular matchings and RNA folding ⋮ Automatic average-case analysis of algorithms ⋮ On the probability that certain compositions have the same number of parts ⋮ Asymptotic densities in logic and type theory ⋮ The edge correlation of random forests ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Left and right length of paths in binary trees or on a question of Knuth ⋮ Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding ⋮ Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model ⋮ Tail asymptotics for a generalized two-demand queueing model -- a kernel method ⋮ Enumerating simplicial decompositions of surfaces with boundaries ⋮ Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy ⋮ Some comments on a bin-packing problem of W. Knödel. ⋮ On the asymptotics of the average CRI length of the slotted ALOHA collision resolution algorithm ⋮ Marking in combinatorial constructions: Generating functions and limiting distributions ⋮ Mellin transforms and asymptotics: Finite differences and Rice's integrals ⋮ Random trees in queueing systems with deadlines ⋮ Steepest descent method and limiting distributions in combinatorial analysis ⋮ The Hamming weight of the non-adjacent-form under various input statistics ⋮ Central and local limit theorems applied to asymptotic enumeration. IV: Multivariate generating functions ⋮ Finding efficient recursions for risk aggregation by computer algebra ⋮ Average-case analysis of unification algorithms ⋮ General combinatorial schemas: Gaussian limit distributions and exponential tails ⋮ FCFS-scheduling in a hard real-time environment under rush-hour conditions ⋮ Page usage in a quadtree index ⋮ Average-case analysis on simple families of trees using a balanced probability model ⋮ Voronoi summation formulae and multiplicative functions on permutations ⋮ Degree distribution in random planar graphs ⋮ Limiting distributions for additive functionals on Catalan trees ⋮ The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees ⋮ Controlled non-uniform random generation of decomposable structures ⋮ Enumeration and limit laws of dissections on a cylinder ⋮ Walks in the quarter plane: Kreweras' algebraic model ⋮ Enumeration results for alternating tree families ⋮ The shape of unlabeled rooted random trees ⋮ The set of realizations of a max-plus linear sequence is semi-polyhedral ⋮ A combinatorial approach to the analysis of bucket recursive trees ⋮ Computing the complexity for Schelling segregation models ⋮ Enumerative and asymptotic analysis of a moduli space ⋮ A functional limit theorem for the profile of \(b\)-ary trees ⋮ Gaussian limiting distributions for the number of components in combinatorial structures ⋮ Width and mode of the profile for some random trees of logarithmic height ⋮ Combinatorial properties of a general domination problem with parity constraints ⋮ On \(q\)-functional equations and excursion moments ⋮ Hypergeometric expressions for generating functions of walks with small steps in the quarter plane ⋮ On Bartlett's formulation of the Luria-Delbrück mutation model ⋮ An analytic method in probabilistic combinatorics ⋮ On the parity of the Wiener index ⋮ Functional iterations and periodic oscillations for simple random walk on the Sierpiński graph ⋮ Arithmetical semigroups related to trees and polyhedra ⋮ Singularity analysis and asymptotics of Bernoulli sums ⋮ An integral formula for Taylor coefficients of a class of analytic functions ⋮ Maximum likelihood analysis of algorithms and data structures ⋮ Sums of products of Cauchy numbers ⋮ Enumeration of three-dimensional convex polygons ⋮ On the average depth of asymmetric LC-tries ⋮ Large deviations of combinatorial distributions. II: Local limit theorems ⋮ On the degrees of irreducible factors of polynomials over a finite field ⋮ Analytic combinatorics of non-crossing configurations ⋮ An analytic approach for the analysis of rotations in fringe-balanced binary search trees ⋮ Mean-field lattice trees ⋮ A result in order statistics related to probabilistic counting ⋮ Analytic variations on quadtrees ⋮ On sets of integers with prescribed gaps ⋮ Asymptotic analysis of a class of functional equations and applications ⋮ Spanning trees in random series-parallel graphs
This page was built for publication: Singularity Analysis of Generating Functions
