Pages that link to "Item:Q3847795"

The following pages link to A Generalization of the Ballot Problem and its Application in the Theory of Queues (Q3847795):

Displaying 29 items.

• Simply generated trees, conditioned Galton-Watson trees, random allocations and condensation (Q431520) (← links)
• On some results of Takacs in ballot problems (Q598693) (← links)
• Convergence and asymptotic variance of bootstrapped finite-time ruin probabilities with partly shifted risk processes (Q659157) (← links)
• Another look at the Picard--Lefèvre formula for finite-time ruin probabilities (Q704403) (← links)
• A link between wave governed random motions and ruin processes (Q704404) (← links)
• Counting forests (Q750454) (← links)
• Robustness analysis and convergence of empirical finite-time ruin probabilities and estimation risk solvency margin (Q998292) (← links)
• On a generalization of polynomials in the ballot problem (Q1076022) (← links)
• Gould series distributions with applications to fluctuations of sums of random variables (Q1078939) (← links)
• Some exact distributions of the number of one-sided deviations and the time of the last such deviation in the simple random walk (Q1091669) (← links)
• On a problem of Gy. Hajós (Q1096635) (← links)
• Combinatorial approach to Markovian queueing models (Q1209660) (← links)
• On the enumeration of certain sets of planted plane trees (Q1216321) (← links)
• Imbedded Markov chains in queueing systems M/G/1 and GI/M/1 with limited waiting room (Q1226811) (← links)
• Random enriched trees with applications to random graphs (Q1658748) (← links)
• Lattice path counting and \(M/M/c\) queueing systems (Q1892653) (← links)
• Ballot theorems revisited (Q1903181) (← links)
• Short proofs in extrema of spectrally one sided Lévy processes (Q1990022) (← links)
• Rerooting multi-type branching trees: the infinite spine case (Q2135184) (← links)
• Limits of random tree-like discrete structures (Q2192232) (← links)
• A combinatorial method in the theory of Markov chains (Q2265728) (← links)
• Analytically 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\) queue (Q2272864) (← links)
• A cyclic approach on classical ruin model (Q2306094) (← links)
• The stochastic law of the busy period for a single-server queue with Poisson input (Q2626036) (← links)
• Coding multitype forests: Application to the law of the total population of branching forests (Q2787987) (← links)
• Busy period in batch queues (Q3040217) (← links)
• The inverse binomial distribution as a statistical model (Q3472988) (← links)
• Path Counting for Grid-Based Navigation (Q5094043) (← links)
• Smart Contract Execution - the (+-)-Biased Ballot Problem. (Q5136237) (← links)