中文
相关论文

相关论文: Extension of results on generalized P\'olya's urns…

200 篇论文

Consider a generalized time-dependent P\'olya urn process defined as follows. Let $d\in \mathbb{N}$ be the number of urns/colors. At each time $n$, we distribute $\sigma_n$ balls randomly to the $d$ urns, proportionally to $f$, where $f$ is…

概率论 · 数学 2022-02-01 Wioletta M. Ruszel , Debleena Thacker

We study the long-time asymptotics of a network of weakly reinforced P\'olya urns. In this system, which extends the WARM introduced by R. van der Hofstad et. al. (2016) to countable networks, the nodes fire at times given by a Poisson…

概率论 · 数学 2021-06-28 Yannick Couzinié , Christian Hirsch

Following Hales (2018), the evolution of P\'olya's urn may be interpreted as a walk, a P\'olya walk, on the integer lattice $\mathbb{N}^2$. We study the visibility properties of P\'olya's walk or, equivalently, the divisibility properties…

概率论 · 数学 2024-04-09 José L. Fernández , Pablo Fernández

Working in combinatorial model $\mathrm{W_{co}}(d)$, $d=1,2,\dots$, of P\'olya's random walker in $\mathbb{Z}^d$, we prove two theorems on recurrence to a vertex. We obtain an effective version of the first theorem if $d=2$. Using a…

概率论 · 数学 2025-05-29 Martin Klazar , Richard Horský

We consider P\'olya urns with infinitely many colours that are of a random walk type, in two related version. We show that the colour distribution a.s., after rescaling, converges to a normal distribution, assuming only second moments on…

概率论 · 数学 2018-03-13 Svante Janson

This thesis examines edge-reinforced random walks with some modifications to the standard definition. An overview of known results relating to the standard model is given and the proof of recurrence for the standard linearly edge-reinforced…

概率论 · 数学 2023-09-07 Fabian Michel

In [arXiv:1906.10951 (forthcoming on Advances in Applied Probability),arXiv:2011.05933 (published on PLOS ONE)] the authors introduce, study and apply a new variant of the Eggenberger-Polya urn, called the "Rescaled" Polya urn, which, for a…

概率论 · 数学 2022-03-30 Giacomo Aletti , Irene Crimaldi

In this paper, we consider a new type of urn scheme, where the selection probabilities are proportional to a weight function, which is linear but decreasing in the proportion of existing colours. We refer to it as the \emph{negatively…

概率论 · 数学 2018-01-09 Antar Bandyopadhyay , Gursharn Kaur

This work is devoted to P\'olya-Young urns, a class of periodic P\'olya urns of importance in the analysis of Young tableaux. We provide several extension of the previous results of Banderier, Marchal and Wallner [Ann. Prob. (2020)] on…

概率论 · 数学 2024-06-28 Markus Kuba

We define and prove limit results for a class of dominant P\'olya sequences, which are randomly reinforced urn processes with color-specific random weights and unbounded number of possible colors. Under fairly mild assumptions on the…

概率论 · 数学 2023-12-12 Hristo Sariev , Sandra Fortini , Sonia Petrone

This article describes a purely analytic approach to urn models of the generalized or extended P\'olya-Eggenberger type, in the case of two types of balls and constant ``balance,'' that is, constant row sum. The treatment starts from a…

概率论 · 数学 2007-05-23 Philippe Flajolet , Joaquim Gabarro , Helmut Pekari

We answer Problem 11.1 of Janson arXiv:1803.04207 on P\'olya urns associated with stable random walk. Our proof use neither martingales nor trees, but an approximation with a differential equation.

概率论 · 数学 2024-02-13 Arthur Blanc-Renaudie

Among other things, we prove that, for a doubling weight $w$, $0< p\leq\infty$, $r\in{\mathbb N}_0$, and $0<\alpha <r+1 - 1/\lambda_p$, we have \[ E_n(f)_{p, w_n} = O(n^{-\alpha}) \iff \omega_\varphi^{r+1}(f, n^{-1})_{p, w_n} =…

经典分析与常微分方程 · 数学 2015-07-20 Kirill A. Kopotun

Interacting urns with exponential reinforcement were introduced and studied in Launay (2011). As its parameter $\rho$ tends to $\iy$, this reinforcement mechanism converges to the "generalized" reinforcement, in which the probability of…

概率论 · 数学 2012-07-25 Mickaël Launay , Vlada Limic

We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…

概率论 · 数学 2026-01-21 Ákos Urbán

We discuss a complementary asymptotic analysis of the so called minimal random walk. More precisely, we present a version of the almost sure central limit theorem as well as a generalization of the recently proposed quadratic strong laws.…

We consider the edge-reinforced random walk with multiple (but finitely many) walkers which influence the edge weights together. The walker which moves at a given time step is chosen uniformly at random, or according to a fixed order.…

概率论 · 数学 2023-11-16 Nina Gantert , Fabian Michel , Guilherme Reis

We prove that the rescaled ``true'' self-avoiding walk $(n^{-2/3}X_{\lfloor nt \rfloor})_{t\in\mathbb{R}_+}$ converges weakly as $n$ goes to infinity to the ``true'' self-repelling motion constructed by T\'oth and Werner. The proof features…

概率论 · 数学 2025-10-03 Elena Kosygina , Jonathon Peterson

The article considers generic extensions of measure-preserving actions. We prove that the P-entropy of the generic extensions with finite P-entropy is infinite. This is exploited to obtain the result by Austin, Glasner, Thouvenot, and Weiss…

动力系统 · 数学 2023-07-11 Valery V. Ryzhikov

Turing progressions have been often used to measure the proof-theoretic strength of mathematical theories. Turing progressions based on $n$-provability give rise to a $\Pi_{n+1}$ proof-theoretic ordinal. As such, to each theory $U$ we can…

逻辑 · 数学 2015-08-04 Joost J. Joosten
‹ 上一页 1 2 3 10 下一页 ›