相关论文: Analytic urns
This article investigates, by probabilistic methods, various geometric questions on B_p^n, the unit ball of \ell_p^n. We propose realizations in terms of independent random variables of several distributions on B_p^n, including the…
We study first order linear partial differential equations that appear, for example, in the analysis of dimishing urn models with the help of the method of characteristics and formulate sufficient conditions for a central limit theorem.
We propose a generalized Ehrenfest urn model of many urns arranged periodically along a circle. The evolution of the urn model system is governed by a directed stochastic operation. Method for solving an $N$-ball, $M$-urn problem of this…
Though widely used in applications, reinforced random walk on graphs have never been the subject of a valid statistical inference. We develop in this paper a statistical framework for a general two-colored urn model. The probability to draw…
Consider an urn model whose replacement matrix is triangular, has all entries nonnegative and the row sums are all equal to one. We obtain the strong laws for the counts of balls corresponding to each color. The scalings for these laws…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where…
The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…
We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's problem, originally introduced by Knuth and McCarthy, and…
Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…
At least two, different approaches to define and solve statistical models for the analysis of economic systems exist: the typical, econometric one, interpreting the Gravity Model specification as the expected link weight of an arbitrary…
The paper considers urn schemes in which several urns can be involved. Simplified formulas are proposed that allow direct calculation of probabilities without the use of elements combinatorics.
Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…
We analyze the problem of global reconstruction of functions as accurately as possible, based on partial information in the form of a truncated power series at some point, and additional analyticity properties. This situation occurs…
This article deals with some stochastic population protocols, motivated by theoretical aspects of distributed computing. We modelize the problem by a large urn of black and white balls from which at every time unit a fixed number of balls…
In this work we introduce a new type of urn model with infinite but countable many colors indexed by an appropriate infinite set. We mainly consider the indexing set of colors to be the $d$-dimensional integer lattice and consider balanced…
As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic pattern occurrence statistics and use them in conjunction with the…
The Generalized P\'{o}lya Urn (GPU) is a popular urn model which is widely used in many disciplines. In particular, it is extensively used in treatment allocation schemes in clinical trials. In this paper, we propose a sequential…
Analytic continuation problems are notoriously ill-posed without additional regularizing constraints, even though every analytic function has a rigidity property of unique continuation from every curve inside the domain of analyticity. In…
We show that as $n$ changes, the characteristic polynomial of the $n\times n$ random matrix with i.i.d. complex Gaussian entries can be described recursively through a process analogous to P\'olya's urn scheme. As a result, we get a random…