A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
From MaRDI portal
Publication:4383740
Recommendations
- Concentration for Poisson functionals: component counts in random geometric graphs
- On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures
- Gaussian limiting distributions for the number of components in combinatorial structures
- The number of unbounded components in the Poisson Boolean model of continuum percolation in hyperbolic space
- Asymptotics for some combinatorial characteristics of the convex hull of a Poisson point process in the Clifford torus
- Asymptotics of combinatorial structures with large smallest component
- Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
- Combinatorial decompositions and homogeneous geometrical processes
- Asymptotics of largest components in combinatorial structures
- Random combinatorial structures: the convergent case
Cited in
(6)- Asymptotic enumeration and limit laws for multisets: the subexponential case
- On multisets, interpolated multiple zeta values and limit laws
- Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
- Asymptotics of decomposable combinatorial structures of alg-log type with positive log exponent
- The law of iterated logarithm for combinatorial multisets
- A phase transition for the probability of being a maximum among random vectors with general iid coordinates
This page was built for publication: A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383740)
