O jistém problému z počtu pravděpodobnosti
O některých úlohách teorie pravděpodobnosti
O pojmu pravděpodobnosti
O použití ergodických vět pro Markovovy řetězce
O pravděpodobnostním pojetí technických problémů
O přesnosti hodnot nabytých průkladem praktických tabulek mathematických
Obata’s Rigidity Theorem for Metric Measure Spaces
We prove Obata’s rigidity theorem for metric measure spaces that satisfy a Riemannian curvaturedimension condition. Additionally,we show that a lower bound K for the generalizedHessian of a sufficiently regular function u holds if and only if u is K-convex. A corollary is also a rigidity result for higher order eigenvalues.
Oblique derivative problems and invariant measures
Observations de M. Rouché en réponse à une Note de M. Delannoy
Occupation laws for some time-nonhomogeneous Markov chains.
Occupation time sets of supports of continuous additive functionals
Occupation times of branching systems with initial inhomogeneous Poisson states and related superprocesses.
Occupation times of compact sets by planar brownian motion
Occupation times of Lévy processes as quadratic variations
Occurence times of rare events for mixing dynamical systems
Occurrence of rare events in ergodic interacting spin systems
Odd cutsets and the hard-core model on
We consider the hard-core lattice gas model on and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds , the model exhibits multiple hard-core measures, thus improving the previous bound of given by Galvin and Kahn. At the heart of our approach lies the study of a certain class of edge cutsets in , the so-called odd cutsets, that appear naturally as the boundary between different phases in the hard-core model. We provide a refined combinatorial...
On a Bernoulli Property of some Piecewise C2-Diffeomorphisms in ...d.
On a Berry-Esseen type bound for the maximum likelihood estimator of a parameter for some stochastic partial differential equations.
On a bound on algebraic connectivity: the case of equality
In a recent paper the authors proposed a lower bound on , where , , is an eigenvalue of a transition matrix of an ergodic Markov chain. The bound, which involved the group inverse of , was derived from a more general bound, due to Bauer, Deutsch, and Stoer, on the eigenvalues of a stochastic matrix other than its constant row sum. Here we adapt the bound to give a lower bound on the algebraic connectivity of an undirected graph, but principally consider the case of equality in the bound when...