English
Related papers

Related papers: The CLT Analogue for Cyclic Urns

200 papers

Let $\cT$ be Teichm\"uller space of a closed surface of genus at least 2. For any point $c\in \cT$, we describe an action of the circle on $\cT\times \cT$, which limits to the earthquake flow when one of the parameters goes to a measured…

Geometric Topology · Mathematics 2016-02-01 Francesco Bonsante , Gabriele Mondello , Jean-Marc Schlenker

We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let $c(\ell)$ be the limit of the ratio of the maximum number of cycles of length $\ell$ in an $n$-vertex tournament and the…

Combinatorics · Mathematics 2022-07-25 Andrzej Grzesik , Daniel Kral , Laszlo Miklos Lovasz , Jan Volec

We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…

Mathematical Physics · Physics 2008-07-17 Yu. G. Stroganov

A Fluctuation Theorem (FT), both Classical and Quantum, describes the large-deviations in the approach to equilibrium of an isolated quasi-integrable system. Two characteristics make it unusual: (i) it concerns the internal dynamics of an…

Statistical Mechanics · Physics 2018-11-14 Tomer Goldfriend , Jorge Kurchan

For uniform random permutations conditioned to have no long cycles, we prove that the total number of cycles satisfies a central limit theorem. Under additional assumptions on the asymptotic behavior of the set of allowed cycle lengths, we…

Probability · Mathematics 2016-08-31 Volker Betz , Helge Schäfer

An urn model of Diaconis and some generalizations are discussed. A convergence theorem is proved that implies for Diaconis' model that the empirical distribution of balls in the urn converges with probability one to the uniform…

Probability · Mathematics 2007-05-23 David Siegmund , Benjamin Yakir

We consider systems of interacting Generalized Friedman's Urns (GFUs) having irreducible mean replacement matrices. The interaction is modeled through the probability to sample the colors from each urn, that is defined as convex combination…

Probability · Mathematics 2018-01-09 Giacomo Aletti , Andrea Ghiglietti

We analyze the fluctuations of incomplete $U$-statistics over a triangular array of independent random variables. We give criteria for a Central Limit Theorem (CLT, for short) to hold in the sense that we prove that an appropriately scaled…

Probability · Mathematics 2020-03-24 Matthias Löwe , Sara Terveer

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

Combinatorics · Mathematics 2015-06-15 Daniel Horsley , Rosalind A. Hoyte

We discuss the phenomenon of universal fluctuations in mesoscopic systems and nuclei. For this purpose we use Random Matrix Theory (RMT). The statistical $S$-matrix is used to obtain the physical observables in the case of Quantum Dots,…

Mesoscale and Nanoscale Physics · Physics 2018-05-29 M. S. Hussein , J. G. G. S. Ramos

A circulant graph is a Cayley graph of a finite cyclic group. The Weisfeiler-Leman-dimension of a circulant graph $X$ with respect to the class of all circulant graphs is the smallest positive integer~$m$ such that the $m$-dimensional…

Combinatorics · Mathematics 2024-10-01 Yulai Wu , Ilia Ponomarenko

An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on $n$ vertices without directed 2-cycles possesses an acyclic set of size at least $3n/5$. We…

Combinatorics · Mathematics 2014-07-31 Noah Golowich , David Rolnick

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…

Probability · Mathematics 2018-01-09 Antar Bandyopadhyay , Gursharn Kaur

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…

Combinatorics · Mathematics 2016-08-03 Michael Haythorpe

We consider random permutations on $\Sn$ with logarithmic growing cycles weights and study asymptotic behavior as the length $n$ tends to infinity. We show that the cycle count process converges to a vector of independent Poisson variables…

Probability · Mathematics 2018-06-14 Nicolas Robles , Dirk Zeindler

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…

Statistical Mechanics · Physics 2009-11-07 Yee-Mou Kao , Pi-Gang Luan

We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…

Mathematical Physics · Physics 2007-05-23 Saibal Mitra , Bernard Nienhuis

Over the last half century the liquid-gas phase transition and the magnetization phase transition have come to be well understood. After an order parameter, $r$, is defined, it can be derived how $r=0$ for $T>T_c$ and how $r \propto (T_c -…

Statistical Mechanics · Physics 2020-03-17 Steven Yuvan , Martin Bier

We develop a new semiclassical approach, which starts with the density matrix given by the Euclidean time path integral with fixed coinciding endpoints, and proceed by identifying classical (minimal Euclidean action) path, to be referred to…

High Energy Physics - Theory · Physics 2016-06-01 M. A. Escobar-Ruiz , E. Shuryak , A. V. Turbiner

We study a P\'olya-type urn model defined as follows. Start at time 0 with a single ball of some colour. Then, at each time n>0, choose a ball from the urn uniformly at random. With probability 1/2<p<1, return the ball to the urn along with…

Probability · Mathematics 2016-12-01 Erik Thörnblad