中文
相关论文

相关论文: Time-dependent P\'olya urn

200 篇论文

We introduce a class of birth-and-death Polya urns, which allow for both sampling and removal of observations governed by an auxiliary inhomogeneous Bernoulli process, and investigate the asymptotic behaviour of the induced allelic…

概率论 · 数学 2016-11-23 Pierpaolo De Blasi , Matteo Ruggiero , Stephen G. Walker

Suppose that a coin with bias theta is tossed at renewal times of a renewal process, and a fair coin is tossed at all other times. Let mu_\theta be the distribution of the observed sequence of coin tosses, and let u_n denote the chance of a…

概率论 · 数学 2007-05-23 David A. Levin , Robin Pemantle , Yuval Peres

A model based on the classic non-interacting Ehrenfest urn model with two-urns is generalized to $M$ urns with the introduction of interactions for particles within the same urn. As the inter-particle interaction strength is varied, phases…

统计力学 · 物理学 2021-05-26 Chi-Ho Cheng , Beverly Gemao , Pik-Yin Lai

In the present paper we prove that the probabilities of the P\'olya urn distribution (with negative replacement) satisfy a monotonicity property similar to that of the binomial distribution (P\'olya urn distribution with no replacement). As…

概率论 · 数学 2018-03-30 Florenta Tripsa , Nicolae R. Pascu

Let $\phi:X\to \mathbb R$ be a continuous potential associated with a symbolic dynamical system $T:X\to X$ over a finite alphabet. Introducing a parameter $\beta>0$ (interpreted as the inverse temperature) we study the regularity of the…

动力系统 · 数学 2020-09-08 Tamara Kucherenko , Anthony Quas , Christian Wolf

The dynamics of random transitive delegations on a graph are of particular interest when viewed through the lens of an emerging voting paradigm, liquid democracy. This paradigm allows voters to choose between directly voting and…

Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…

数据结构与算法 · 计算机科学 2023-02-15 Ahad N. Zehmakan

Anomalous transitions involving photons derived by many-body interaction of the form, $\partial_{\mu} G^{\mu}$, in the standard model are studied. This does not affect the equation of motion in the bulk, but makes wave functions modified,…

高能物理 - 唯象学 · 物理学 2014-12-31 Kenzo Ishikawa , Toshiki Tajima , Yutaka Tobita

We consider a generalized two-color Polya urn (black and withe balls) first introduced by Hill, Lane, Sudderth where the urn composition evolves as follows: let $\pi:\left[0,1\right]\rightarrow\left[0,1\right]$, and denote by $x_{n}$ the…

概率论 · 数学 2025-07-09 Simone Franchini

Time crystals are classified as discrete or continuous depending on whether they spontaneously break discrete or continuous time translation symmetry. While discrete time crystals have been extensively studied in periodically driven systems…

Consider a graph $G=(V,E)$ and a random initial vertex-coloring, where each vertex is blue independently with probability $p_{b}$, and red with probability $p_r=1-p_b$. In each step, all vertices change their current color synchronously to…

形式语言与自动机理论 · 计算机科学 2017-11-30 Bernd Gärtner , Ahad N. Zehmakan

Here we present a combinatorial decision problem, inspired by the celebrated quiz show called the countdown, that involves the computation of a given target number T from a set of k randomly chosen integers along with a set of arithmetic…

统计力学 · 物理学 2015-06-05 Lucas Lacasa , Bartolo Luque

The voter model on $\mathbb{Z}^d$ is a particle system that serves as a rough model for changes of opinions among social agents or, alternatively, competition between biological species occupying space. When $d \geq 3$, the set of…

概率论 · 数学 2016-02-19 Balazs Rath , Daniel Valesin

We study a multiple-urn version of the Ehrenfest model. In this setting, we denote the n urns by Urn 1 to Urn n, where n>=2. Initially, M balls are randomly placed in the n urns. At each subsequent step, a ball is selected and put into the…

概率论 · 数学 2022-12-07 Sai Song , Qiang Yao

Consider a graph $G=(V,E)$ and an initial random coloring where each vertex $v \in V$ is blue with probability $P_b$ and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to…

数据结构与算法 · 计算机科学 2017-11-21 Bernd Gärtner , Ahad N. Zehmakan

We study the McKean--Vlasov equation on the finite tori of length scale $L$ in $d$--dimensions. We derive the necessary and sufficient conditions for the existence of a phase transition, which are based on the criteria first uncovered in…

数学物理 · 物理学 2015-05-14 Lincoln Chayes , Vladislav Panferov

In the spherical Poisson Boolean model, one takes the union of random balls centred on the points of a Poisson process in Euclidean $d$-space with $d \geq 2$. We prove that whenever the radius distribution has a finite $d$-th moment, there…

概率论 · 数学 2018-07-24 Mathew D. Penrose

Several differential equations usually appearing in mathematical physics are solved through a power series expansion, which reduces in solving difference equations. In this paper a probability problem is presented whose solution follows a…

概率论 · 数学 2019-06-27 Anastasios Taliotis

We consider an asynchronous voting process on graphs which we call discordant voting, and which can be described as follows. Initially each vertex holds one of two opinions, red or blue say. Neighbouring vertices with different opinions…

离散数学 · 计算机科学 2016-12-28 Colin Cooper , Martin Dyer , Alan Frieze , Nicolas Rivera

We propose a definition for the P\'olya number of continuous-time quantum walks to characterize their recurrence properties. The definition involves a series of measurements on the system, each carried out on a different member from an…

量子物理 · 物理学 2015-03-17 Z. Darázs , T. Kiss