中文
相关论文

相关论文: On processes which cannot be distinguished by fini…

200 篇论文

We provide a characterization of those nonmonotonic inference operations C for which C(X) may be described as the set of all logical consequences of X together with some set of additional assumptions S(X) that depends anti-monotonically on…

人工智能 · 计算机科学 2007-05-23 Yuri Kaluzhny , Daniel Lehmann

In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also…

信息论 · 计算机科学 2016-03-07 Mrinalkanti Ghosh , Satyadev Nandakumar , Atanu Pal

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

动力系统 · 数学 2018-09-10 Omer Angel , Alexander S. Kechris , Russell Lyons

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…

环与代数 · 数学 2026-03-03 Lia Vas

In this paper, a polynomial version of Furstenberg joining is introduced and its structure is investigated. Particularly, it is shown that if all polynomials are non-linear, then almost every ergodic component of the joining is a direct…

动力系统 · 数学 2023-01-20 Wen Huang , Song Shao , Xiangdong Ye

Let $\{X(t):t\in\mathbb R_+\}$ be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, $\mathbb E X(t) = 0$, $\mathbb E X^2(t) = 1$ and correlation function satisfying (i) $r(t) = 1 - C|t|^{\alpha} +…

概率论 · 数学 2018-03-05 K. Dębicki , K. M. Kosiński

A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…

计算机科学中的逻辑 · 计算机科学 2023-12-01 Jan Dreier , Ioannis Eleftheriadis , Nikolas Mählmann , Rose McCarty , Michał Pilipczuk , Szymon Toruńczyk

Let $(X,\mathcal{B},\mu,T)$ be a probability-preserving system with $X$ compact and $T$ a homeomorphism. We show that if every point in $X\times X$ is two-sided recurrent, then $h_{\mu}(T)=0$, resolving a problem of Benjamin Weiss, and that…

动力系统 · 数学 2025-06-11 Michael Hochman

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…

概率论 · 数学 2021-03-19 Jon Chaika , Arjun Krishnan

Let $W$ be a finite reflection group. A $W$-invariant function of class~$C^{\infty}$ may be expressed as a functions of class $C^{\infty}$ of the basic invariants. In finite class of differentiability, the situation is not this simple.…

泛函分析 · 数学 2019-06-18 Gerard Barbançon

We study conservative particle systems on W^S, where S is countable and W = {0, ..., N} or the natural numbers. The rate of a particle moving from site x to site y is given by p(x,y) b(eta_x, eta_y), where eta_z is the number of particles…

概率论 · 数学 2013-12-24 Richard Kraaij

We study the Furstenberg-entropy realization problem for stationary actions. It is shown that for finitely supported probability measures on free groups, any a-priori possible entropy value can be realized as the entropy of an ergodic…

动力系统 · 数学 2019-02-20 Yair Hartman , Ariel Yadin

For strictly ergodic systems, we introduce the class of CF-Nil($k$) systems: systems for which the maximal measurable and maximal topological $k$-step pronilfactors coincide as measure-preserving systems. Weiss' theorem implies that such…

动力系统 · 数学 2022-05-13 Yonatan Gutman , Zhengxing Lian

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

逻辑 · 数学 2025-11-11 Antonio Nakid Cordero

Consider a uniformly sampled random $d$-regular graph on $n$ vertices. If $d$ is fixed and $n$ goes to $\infty$ then we can relate typical (large probability) properties of such random graph to a family of invariant random processes (called…

概率论 · 数学 2021-12-07 Ágnes Backhausz , Charles Bordenave , Balázs Szegedy

The purpose of this work is to construct a {\it Brownian motion} with values in simplicial complexes with piecewise differential structure. In order to state and prove the existence of such Brownian motion, we define a family of continuous…

概率论 · 数学 2007-05-23 Taoufik Bouziane

A simple criterion for a functor to be finitary is presented: we call $F$ finitely bounded if for all objects $X$ every finitely generated subobject of $FX$ factorizes through the $F$-image of a finitely generated subobject of $X$. This is…

范畴论 · 数学 2019-10-22 Jiří Adámek , Stefan Milius , Lurdes Sousa , Thorsten Wißmann

We study stationary stable processes related to periodic and cyclic flows in the sense of Rosinski [Ann. Probab. 23 (1995) 1163-1187]. These processes are not ergodic. We provide their canonical representations, consider examples and show…

概率论 · 数学 2016-09-07 Vladas Pipiras , Murad S. Taqqu

We show that if $\mathcal{X}$ is a complete separable metric space and $\mathcal{C}$ is a countable family of Borel subsets of $\mathcal{X}$ with finite VC dimension, then, for every stationary ergodic process with values in $\mathcal{X}$,…

概率论 · 数学 2010-10-18 Terrence M. Adams , Andrew B. Nobel

This work concerns the Ornstein-Uhlenbeck type process associated to a positive self-similar Markov process $(X(t))_{t\geq 0}$ which drifts to $\infty$, namely $U(t):= {\rm e}^{-t}X({\rm e}^t-1)$. We point out that $U$ is always a…

概率论 · 数学 2017-09-21 Jean Bertoin