• Journal of applied mathematics & informatics
• /
• v.10 no.1_2
• /
• pp.145-155
• /
• 2002

In this paper we study the rooted loopless maps on the sphere and the projective plane with the valency of root-face and the number of edges as parameters. Explicit expression of enumerating function is obtained for such maps on the sphere and the projective plane. A parametric expression of the generating function is obtained for such maps on the projective plane, from which asymptotic evaluations are derived.

• Journal of the Korean Statistical Society
• /
• v.32 no.1
• /
• pp.33-46
• /
• 2003

The continual reassessment method (CRM) provides a Bayesian estimation of the maximum tolerated dose (MTD) in phase I clinical trials. The CRM has been proposed as an alternative design of the standard design. The CRM has been modified to improve practical feasibility and, recently, the likelihood approach CRM has been proposed. In this paper we investigate the consistency and asymptotic normality of the modified likelihood approach CRM in which the maximum likelihood estimate is used instead of the posterior mean. Small-sample properties of the consistency is examined using complete enumeration. Both the asymptotic results and their small-sample properties show that the modified CRML outperforms the standard design.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.113-129
• /
• 2010

Inclusion and exclusion is used in many papers to count certain objects exactly or asymptotically. Also it is used to derive the Bonferroni inequalities in probabilistic area [6]. Inclusion and exclusion on finitely many types of properties is first used in R. Meyer [7] in probability form and first used in the paper of McKay, Palmer, Read and Robinson [8] as a form of counting version of inclusion and exclusion on two types of properties. In this paper, we provide a proof for inclusion and exclusion on finitely many types of properties in counting version. As an example, the asymptotic number of general cubic graphs via inclusion and exclusion formula is given for this generalization.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1121-1148
• /
• 2017

Go is an ancient game of great complexity and has a huge following in East Asia. It is also very rich mathematically, and can be played on any graph, although it is usually played on a square lattice. As with any game, one of the most fundamental problems is to determine the number of legal positions, or the probability that a random position is legal. A random Go position is generated using a model previously studied by the author, with each vertex being independently Black, White or Uncoloured with probabilities q, q, 1 - 2q respectively. In this paper we consider the probability of legality for two scenarios. Firstly, for an $N{\times}N$ square lattice graph, we show that, with $q=cN^{-{\alpha}}$ and c and ${\alpha}$ constant, as $N{\rightarrow}{\infty}$ the limiting probability of legality is 0, exp($-2c^5$), and 1 according as ${\alpha}$ < 2/5, ${\alpha}=2/5$ and ${\alpha}$ > 2/5 respectively. On the way, we investigate the behaviour of the number of captured chains (or chromons). Secondly, for a random graph on n vertices with edge probability p generated according to the classical $Gilbert-Erd{\ddot{o}}s-R{\acute{e}}nyi$ model ${\mathcal{G}}$(n; p), we classify the main situations according to their asymptotic almost sure legality or illegality. Our results draw on a variety of probabilistic and enumerative methods including linearity of expectation, second moment method, factorial moments, polyomino enumeration, giant components in random graphs, and typicality of random structures. We conclude with suggestions for further work.