scientific article
From MaRDI portal
Publication:3003675
zbMath1230.60014MaRDI QIDQ3003675
Publication date: 30 May 2011
Full work available at URL: http://www.math.uni.wroc.pl/~pms/files/30.2/Abstract/30.2.1.abs.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
momentsStirling numbersPoisson distributionBell numbersbinomial distributionsums of random variablesbounds on moments
Inequalities; stochastic orderings (60E15) Partitions of sets (05A18) Bell and Stirling numbers (11B73) Inequalities for sums, series and integrals (26D15)
Related Items (60)
Energy-efficient scheduling and routing via randomized rounding ⋮ Lie groups of controlled characters of combinatorial Hopf algebras ⋮ Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics ⋮ Randomized Reference Models for Temporal Networks ⋮ Unnamed Item ⋮ \(t\)-copula from the viewpoint of tail dependence matrices ⋮ On some extensions of the Ailon-Rudnick theorem ⋮ Algorithms for the workflow satisfiability problem engineered for counting constraints ⋮ Universality in a class of fragmentation-coalescence processes ⋮ Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form ⋮ Compartmental observability approach for the optimal transparency problem in multi-agent systems ⋮ An Itô calculus for a class of limit processes arising from random walks on the complex plane ⋮ The power of cut-based parameters for computing edge-disjoint paths ⋮ The graph motif problem parameterized by the structure of the input graph ⋮ A cooperative game-theoretic approach to the social ridesharing problem ⋮ The distribution of numbers with many factorizations ⋮ Computing highly oscillatory integrals ⋮ Unnamed Item ⋮ Improved Steiner tree algorithms for bounded treewidth ⋮ Knapsack problems: a parameterized point of view ⋮ Combinatorial search in two and more rounds ⋮ A strictly stationary \(\beta\)-mixing process satisfying the central limit theorem but not the weak invariance principle ⋮ Phase transitions of Best‐of‐two and Best‐of‐three on stochastic block models ⋮ On the hardness of labeled correlation clustering problem: a parameterized complexity view ⋮ Popular subsets for Euler's \(\varphi \)-function ⋮ An algorithm for computing the t-signature of two-state networks ⋮ Randomized oblivious integral routing for minimizing power cost ⋮ The Poisson binomial distribution -- old \& new ⋮ Grid-free weighted particle method applied to the Vlasov-Poisson equation ⋮ Asymptotic bounds for clustering problems in random graphs ⋮ Improved bounds in Stein's method for functions of multivariate normal random vectors ⋮ Bayesian generalized network design ⋮ Parameterized complexity of even/odd subgraph problems ⋮ Unnamed Item ⋮ Lower bounds for finding stationary points I ⋮ Autonomous quantum machines and finite-sized clocks ⋮ Disassociation energies for the finite-density \(N\)-body problem ⋮ Unnamed Item ⋮ An entropy argument for counting matroids ⋮ The Bargmann transform and powers of harmonic oscillator on Gelfand-Shilov subspaces ⋮ An initial study of time complexity in infinite-domain constraint satisfaction ⋮ Fast and accurate algorithm for the generalized exponential integral \(E_{\nu}(x)\) for positive real order ⋮ Probabilistic representation formula for the solution of fractional high-order heat-type equations ⋮ Unnamed Item ⋮ Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width ⋮ Simulating aggregates of bivalents in \(2n=40\) mouse meiotic spermatocytes through inhomogeneous site percolation processes ⋮ The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations ⋮ Faster algorithms for counting subgraphs in sparse graphs ⋮ Gravity as an ensemble and the moment problem ⋮ The noncrossing bond poset of a graph ⋮ The ML–EM algorithm in continuum: sparse measure solutions ⋮ Diagonal Discriminant Analysis With Feature Selection for High-Dimensional Data ⋮ Green's relations in deterministic finite automata ⋮ Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth ⋮ Sharp and simple bounds for the raw moments of the binomial and Poisson distributions ⋮ Multi-colored spanning graphs ⋮ Parameterized Pre-Coloring Extension and List Coloring Problems ⋮ On the quantitative dynamical Mordell-Lang conjecture ⋮ Stirling number of the fourth kind and lucky partitions of a finite set ⋮ Invertibility of frame operators on Besov-type decomposition spaces
This page was built for publication:
