Related papers: An ergodic theorem for partially exchangeable rand…
We discuss the conditions under which identical particles may yet be distinguishable and the relationship between particle permutation and exchange. We show that we can always define permutation-symmetric state vectors. When the particles…
In recent work by Botkin, Dawsey, Hemmer, Just and the present author, a deterministic model of prime number distribution is developed based on properties of integer partitions that gives almost exact estimates for $\pi(n)$, the number of…
The theoretical cornerstone of statistical mechanics is the ergodic assumption that all accessible configurations of a physical system are equally likely. Here we show how such property arises when an open quantum system is continuously…
Although exchangeable processes from Bayesian nonparametrics have been used as a generating mechanism for random partition models, we deviate from this paradigm to explicitly incorporate clustering information in the formulation of our…
We consider a random time evolution operator composed of a circuit of random unitaries coupling even and odd neighboring spins on a chain in turn. In spirit of Floquet evolution, the circuit is time-periodic; each timestep is repeated with…
The first-passage time is proposed as an independent thermodynamic parameter of the statistical distribution that generalizes the Gibbs distribution. The theory does not include the determination of the first passage statistics itself. A…
We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…
The exponential upper bounds for the convergence rate of the distribution of restorable element with partially energized standby redundancy are founded, in the case when all working and repair times are bounded by exponential random…
For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…
We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and-paste chain are determined by products of i.i.d. stochastic…
We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…
We find a general formula for the distribution of time averaged observables for weakly non-ergodic systems. Such type of ergodicity breaking is known to describe certain systems which exhibit anomalous fluctuations, e.g. blinking quantum…
We explore the class of exchangeable Bernoulli distributions building on their geometrical structure. Exchangeable Bernoulli probability mass functions are points in a convex polytope and we have found analytical expressions for their…
If the von Neumann equation is modified by time dependent statistical weights, the time rate of entropy, the entropy exchange and production of a Schottky system are derived whose Hamiltonian does not contain the interaction with the…
In the classical Erd\"os-R\'enyi random graph G(n,p) there are n vertices and each of the possible edges is independently present with probability p. The random graph G(n,p) is homogeneous in the sense that all vertices have the same…
We study sequences of partitions of a non decreasing sequence I n of intervals into subintervals, starting from the trivial partition, in which each partition is obtained from the one before by splitting its subintervals in two, according…
The convergence of simultaneous and marginal predictive classifiers under partition exchangeability in supervised classification is obtained. The result shows the asymptotic convergence of these classifiers under infinite amount of training…
Let $S$ be a Polish space and $(X_n:n\geq1)$ an exchangeable sequence of $S$-valued random variables. Let $\alpha_n(\cdot)=P(X_{n+1}\in \cdot\mid X_1,\...,X_n)$ be the predictive measure and $\alpha$ a random probability measure on $S$ such…
The Three Gap Theorem states that for any $\alpha \in (0,1)$ and any integer $N \geq 1$, the fractional parts of the sequence $0, \alpha, 2\alpha, \cdots, (N-1)\alpha$ partition the unit interval into $N$ subintervals having at most…
In this work a quantum dynamical system $(\mathfrak M,\Phi, \varphi)$ is constituted by a von Neumann algebra $\mathfrak M$, by a unital Schwartz map $\Phi:\mathfrak{M\rightarrow M}$ and by a $\Phi$-invariant normal faithful state $\varphi$…