中文
相关论文

相关论文: On dynamical bit sequences

200 篇论文

Let $\xi_1,\xi_2,...$ be independent identically distributed random variables and $F:\bbR^\ell\to SL_d(\bbR)$ be a Borel measurable matrix-valued function. Set $X_n=F(\xi_{q_1(n)},\xi_{q_2(n)},...,\xi_{q_\ell(n)})$ where $0\leq…

概率论 · 数学 2018-12-18 Yuri Kifer , Sasha Sodin

We unify two paradigmatic mesoscopic mechanisms for the emergence of nonextensive statistics, namely the multiplicative noise mechanism leading to a {\it linear} Fokker-Planck (FP) equation with {\it inhomogenous} diffusion coefficient, and…

统计力学 · 物理学 2015-05-28 Ananias M. Mariz , Constantino Tsallis

Let $(X_n)_{n \in\mathbb{N}}$ be a $V$-geometrically ergodic Markov chain on a measurable space $\mathbb{X}$ with invariant probability distribution $\pi$. In this paper, we propose a discretization scheme providing a computable sequence…

概率论 · 数学 2019-10-09 Loic Hervé , James Ledoux

This paper is concerned with sampling from probability distributions $\pi$ on $\mathbb{R}^d$ admitting a density of the form $\pi(x) \propto e^{-U(x)}$, where $U(x)=F(x)+G(Kx)$ with $K$ being a linear operator and $G$ being…

最优化与控制 · 数学 2024-05-28 Andreas Habring , Martin Holler , Thomas Pock

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

计算复杂性 · 计算机科学 2009-02-10 Laurent Bienvenu , Rod Downey

We study a class of Piecewise Deterministic Markov Processes with state space Rd x E where E is a finite set. The continuous component evolves according to a smooth vector field that is switched at the jump times of the discrete coordinate.…

We study Markov chains generated by iterated Lipschitz functions systems with possibly place dependent probabilities. Under general conditions, we prove uniqueness of the invariant probability measure for the associated Markov chain, by…

概率论 · 数学 2017-07-25 Fetima Ladjimi , Marc Peigné

Consider an N-dimensional Markov chain obtained from N one-dimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller…

概率论 · 数学 2014-10-03 Alexei Borodin , Vadim Gorin

We use the $f-divergence$ also called relative entropy as a measure of diversity between probability densities and review its basic properties. In the sequence we define a few objects which capture relevant information from the sample of a…

统计理论 · 数学 2012-06-20 A. R. Baigorri , C. R. Goncalves , P. A. A. Resende

We consider the piecewise-deterministic Markov process obtained by randomly switching between the flows generated by a finite set of smooth vector fields on a compact set. We obtain H\"ormander-type conditions on the vector fields…

概率论 · 数学 2023-02-14 Michel Benaïm , Oliver Tough

We provide probabilistic and computational results on Markovian multivariate Hawkes processes and induced population processes. By applying the Markov property, we characterize in closed form a joint transform, bijective to the probability…

概率论 · 数学 2025-08-08 R. S. Karim , R. J. A. Laeven , M , M. Mandjes

Quantum Markov chains (QMCs) are positive maps on a trace-class space describing open quantum dynamics on graphs. Such objects have a statistical resemblance with classical random walks, while at the same time it allows for internal…

量子物理 · 物理学 2024-11-21 Manuel D. De la Iglesia , Carlos F. Lardizabal

Each compact manifold M of finite dimension k is differentiable and supports an intrinsic probability measure. There then exists a measurable transformation of M to the k-dimensional "surface" of the (k+1)-dimensional ball.

微分几何 · 数学 2007-11-19 Brockway McMillan

We say that $f:[0,1]\to [0,1]$ is a {\it piecewise continuous interval map} if there exists a partition $0=x_0<x_1<\cdots<x_{d}<x_{d+1}=1$ of $[0,1]$ such that $f\vert_{(x_{i-1},x_i)}$ is continuous and the lateral limits $w_0^+=\lim_{x\to…

动力系统 · 数学 2016-03-09 Benito Pires

For a given sequence $\mathbf{\alpha} = [\alpha_1,\alpha_2,\dots,\alpha_{N+1}]$ of $N+1$ positive integers, we consider the combinatorial function $E(\mathbf{\alpha})(t)$ that counts the nonnegative integer solutions of the equation…

In this paper, we use the Markov property introduced in Balan and Ivanoff (J. Theor. Probab. 15, 2002, 553-588) for set-indexed processes and we prove that a Markov prior distribution leads to a Markov posterior distribution. In particular,…

概率论 · 数学 2009-11-10 Raluca Balan

This paper introduces a scalable approach for probabilistic top-k similarity ranking on uncertain vector data. Each uncertain object is represented by a set of vector instances that are assumed to be mutually-exclusive. The objective is to…

数据库 · 计算机科学 2009-07-17 Thomas Bernecker , Hans-Peter Kriegel , Nikos Mamoulis , Matthias Renz , Andreas Zuefle

We associate to an $N$-sample of a given rotationally invariant probability measure $\mu_0$ with compact support in the complex plane, a polynomial $P_N$ with roots given by the sample. Then, for $t \in (0,1)$, we consider the empirical…

概率论 · 数学 2025-06-11 André Galligo , Joseph Najnudel , Truong Vu

Denote by $K_p(n,k)$ the random subgraph of the usual Kneser graph $K(n,k)$ in which edges appear independently, each with probability $p$. Answering a question of Bollob\'as, Narayanan, and Raigorodskii,we show that there is a fixed $p<1$…

组合数学 · 数学 2015-02-20 Pat Devlin , Jeff Kahn

We consider a general piecewise deterministic Markov process (PDMP) $X=\{X_t\}_{t\geqslant 0}$ with measure-valued generator $\mathcal{A}$, for which the conditional distribution function of the inter-occurrence time is not necessarily…

概率论 · 数学 2017-04-27 Zhaoyang Liu , Yuying Liu , Guoxin Liu