A Generalization of the Ballot Problem and its Application in the Theory of Queues

From MaRDI portal
Publication:3847795

DOI10.2307/2281642zbMath0109.36702OpenAlexW4237942961MaRDI QIDQ3847795

Lajos Takács

Publication date: 1962

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2281642




Related Items (36)

On a generalization of polynomials in the ballot problemGould series distributions with applications to fluctuations of sums of random variablesLe problème d'Anscombe pour les lois binomiales négatives généraliséesThe stochastic law of the busy period for a single-server queue with Poisson inputRerooting multi-type branching trees: the infinite spine caseSome exact distributions of the number of one-sided deviations and the time of the last such deviation in the simple random walkANALYTICALLY CLOSED-FORM SOLUTIONS FOR THE DISTRIBUTION OF A NUMBER OF CUSTOMERS SERVED DURING A BUSY PERIOD FOR SPECIAL CASES OF THE GEO/G/1 QUEUELattice path counting and \(M/M/c\) queueing systemsOn a problem of Gy. HajósBallot theorems revisitedThe inverse binomial distribution as a statistical modelRandom enriched trees with applications to random graphsOn some results of Takacs in ballot problemsOn some probability distributions associated with random walksPath Counting for Grid-Based NavigationEin Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1Limits of random tree-like discrete structuresSimply generated trees, conditioned Galton-Watson trees, random allocations and condensationConvergence and asymptotic variance of bootstrapped finite-time ruin probabilities with partly shifted risk processesShort proofs in extrema of spectrally one sided Lévy processesBallot problemsCombinatorial approach to Markovian queueing modelsAnother look at the Picard--Lefèvre formula for finite-time ruin probabilitiesA link between wave governed random motions and ruin processesOn the enumeration of certain sets of planted plane treesBusy period in batch queuesA combinatorial method in the theory of Markov chainsImbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting roomAnalytically explicit results for the distribution of the number of customers served during a busy period for special cases of the \(\mathrm{M}/\mathrm{G}/1\) queueCoding multitype forests: Application to the law of the total population of branching forestsOn finite-time ruin probabilities for classical risk modelsRobustness analysis and convergence of empirical finite-time ruin probabilities and estimation risk solvency marginCounting forestsA cyclic approach on classical ruin modelA multivariate generalized polya-eggenberger probability model - first passage approachSmart Contract Execution - the (+-)-Biased Ballot Problem.




This page was built for publication: A Generalization of the Ballot Problem and its Application in the Theory of Queues