The search session has expired. Please query the service again.
Displaying 241 –
258 of
258
The influence of “Grundbegriffe” by A. N. Kolmogorov (published in 1933) on education in the area of probability and its impact on research in stochastics cannot be overestimated. We would like to point out three aspects of the classical probability theory “calling for“ an upgrade: (i) classical random events are black-and-white (Boolean); (ii) classical random variables do not model quantum phenomena; (iii) basic maps (probability measures and observables – dual maps to random variables) have very...
We present a lower and an upper bound for the second smallest eigenvalue of Laplacian matrices in terms of the averaged minimal cut of weighted graphs. This is used to obtain an upper bound for the real parts of the non-maximal eigenvalues of irreducible nonnegative matrices. The result can be applied to Markov chains.
We obtain upper bounds for minimal metrics in the central limit theorem for sequences of independent real-valued random variables.
In this paper we study upper bounds for the density of solution to stochastic differential equations driven by a fractional Brownian motion with Hurst parameter . We show that under some geometric conditions, in the regular case , the density of the solution satisfies the log-Sobolev inequality, the Gaussian concentration inequality and admits an upper Gaussian bound. In the rough case and under the same geometric conditions, we show that the density of the solution is smooth and admits an upper...
We consider the standard first passage percolation model in ℤd for d ≥ 2 and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a hyperrectangle of sidelength proportional to n and whose height is h(n) for a certain height function h. We denote this maximal flow by τn (respectively φn). We emphasize the fact that the cylinder may be tilted. We look at the probability that these flows, rescaled by the surface...
The asymptotics of the probability that the self-intersection local time of a random walk on exceeds its expectation by a large amount is a fascinating subject because of its relation to some models from Statistical Mechanics, to large-deviation theory and variational analysis and because of the variety of the effects that can be observed. However, the proof of the upper bound is notoriously difficult and requires various sophisticated techniques. We survey some heuristics and some recently elaborated...
Multitype branching processes (MTBP) model branching structures, where the nodes of the resulting tree are particles of different types.
Usually such a process is not observable in the sense of the whole tree, but
only as the “generation” at a given moment in time, which consists of the
number of particles of every type. This requires an EM-type algorithm to
obtain a maximum likelihood (ML) estimate of the parameters of the branching process. Using a version of the inside-outside algorithm for stochastic
context-free...
Currently displaying 241 –
258 of
258