English
Related papers

Related papers: From Doob's maximal identity to Azema supermarting…

200 papers

We investigate the moments of the derivative, on the unit circle, of characteristic polynomials of random unitary matrices and use this to formulate a conjecture for the moments of the derivative of the Riemann zeta-function on the critical…

Number Theory · Mathematics 2007-05-23 J. Brian Conrey , Michael O. Rubinstein , Nina C. Snaith

Let $(S_0,S_1,...)$ be a supermartingale relative to a nondecreasing sequence of $\sigma$-algebras $H_{\le0},H_{\le1},...$, with $S_0\le0$ almost surely (a.s.) and differences $X_i:=S_i-S_{i-1}$. Suppose that $X_i\le d$ and $\mathsf…

Probability · Mathematics 2007-05-23 Iosif Pinelis

Let $\mathbb{\hat{E}}$ be the upper expectation of a weakly compact but non-dominated family $\mathcal{P}$ of probability measures. Assume that $Y$ is a $d$-dimensional $\mathcal{P}$-semimartingale under $\mathbb{\hat{E}}$. Given an open…

Probability · Mathematics 2020-08-25 Guomin Liu

Programs with randomization constructs is an active research topic, especially after the recent introduction of martingale-based analysis methods for their termination and runtimes. Unlike most of the existing works that focus on proving…

Logic in Computer Science · Computer Science 2019-02-18 Satoshi Kura , Natsuki Urabe , Ichiro Hasuo

For a spectrally negative positive self-similar Markov process with an a.s. finite overall supremum we provide, in tractable detail, a kind of conditional Wiener-Hopf factorization at the maximum of the absorption time at zero, the…

Probability · Mathematics 2018-05-16 Matija Vidmar

Given a reference filtration $\mathbb{F}$, we develop in this work a generic method for computing the semimartingale decomposition of $\mathbb{F}$-martingales in some specific enlargements of $\mathbb{F}$. This method is then applied to the…

Probability · Mathematics 2014-02-14 Monique Jeanblanc , Libo Li , Shiqi Song

Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps performed by a computer program during its execution, can be defined such that the…

History and Overview · Mathematics 2007-05-23 Germano D'Abramo

An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so; it…

Programming Languages · Computer Science 2017-12-27 Annabelle McIver , Carroll Morgan , Benjamin Lucien Kaminski , Joost-Pieter Katoen

This work provides a novel convergence analysis for stochastic optimization in terms of stopping times, addressing the practical reality that algorithms are often terminated adaptively based on observed progress. Unlike prior approaches,…

Optimization and Control · Mathematics 2025-07-17 Yasong Feng , Yifan Jiang , Tianyu Wang , Zhiliang Ying

We propose a notion of autoreducibility for infinite time computability and explore it and its connection with a notion of randomness for infinite time machines.

Logic · Mathematics 2014-02-06 Merlin Carl

We investigate superdiffusion for stochastic processes generated by nonuniformly hyperbolic system models, in terms of the convergence of rescaled distributions to the normal distribution following the abnormal central limit theorem, which…

Dynamical Systems · Mathematics 2017-09-05 Luke Mohr , Hong-Kun Zhang

We study asymptotics of the partition function $Z_N$ of a Laguerre-type random matrix model when the matrix order $N$ tends to infinity. By using the Deift-Zhou steepest descent method for Riemann-Hilbert problems, we obtain an asymptotic…

Classical Analysis and ODEs · Mathematics 2013-04-18 Yi Zhao , Lihua Cao , Dan Dai

The problem of drawing samples from a discrete distribution can be converted into a discrete optimization problem. In this work, we show how sampling from a continuous distribution can be converted into an optimization problem over…

Computation · Statistics 2015-01-27 Chris J. Maddison , Daniel Tarlow , Tom Minka

Let U be an open set in R^d. We show that under a mild assumption on the richness of the generator a Feller process in U with (predictable) killing is a semimartingale. To this end we generalize the notion of semimartingales in a natural…

Probability · Mathematics 2013-01-08 Alexander Schnurr

The asymptotic law of the truncated $S\times S$ random submatrix of a Haar random matrix in $\mathrm{GL}_N(\mathbb{Z}_m)$ as $N$ goes to infinity is obtained. The same result is also obtained when $\mathbb{Z}_m$ is replaced by any…

Probability · Mathematics 2016-02-29 Yanqi Qiu

We calculate the discrete moments of the characteristic polynomial of a random unitary matrix, evaluated a small distance away from an eigenangle. Such results allow us to make conjectures about similar moments for the Riemann zeta…

Number Theory · Mathematics 2009-11-07 C. P. Hughes

We prove non-autonomous maximal $L^p$-regularity results on UMD spaces replacing the common H\"older assumption by a weaker fractional Sobolev regularity in time. This generalizes recent Hilbert space results by Dier and Zacher. In…

Functional Analysis · Mathematics 2018-04-18 Stephan Fackler

We study periodic points for endomorphisms $\sigma$ of abelian varieties $A$ over algebraically closed fields of positive characteristic $p$. We show that the dynamical zeta function $\zeta_\sigma$ of $\sigma$ is either rational or…

Number Theory · Mathematics 2019-01-02 Jakub Byszewski , Gunther Cornelissen , Robert Royals , Thomas Ward

For a branching random walk that drifts to infinity, consider its Malthusian martingale, i.e.~the additive martingale with parameter $\theta$ being the smallest root of the characteristic equation. When particles are killed below the…

Probability · Mathematics 2025-05-20 Heng Ma , Pascal Maillard

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

Probability · Mathematics 2024-07-10 Daniela Bertacchi , Elisabetta Candellero , Fabio Zucca
‹ Prev 1 3 4 5 6 7 10 Next ›