Searcharxiv⌕ Search

arXiv · math/0605552

Exponential Approximation by Stein's Method and Spectral Graph Theory

Abstract

General Berry-Esseen bounds are developed for the exponential distribution using Stein's method. As an application, a sharp error term is obtained for Hora's result that the spectrum of the Bernoulli-Laplace Markov chain has an exponential limit. This is the first use of Stein's method to study the spectrum of a graph with a non-normal limit.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sourav Chatterjee, Jason Fulman, Adrian Rollin. 2008-10-04. Exponential Approximation by Stein's Method and Spectral Graph Theory. https://searcharxiv.com/abs/math/0605552

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Approximation of the Lévy-driven stochastic heat equation on the sphere

The stochastic heat equation on the sphere driven by an additive square-integrable Lévy process is approximated by a spectral method in space and forward and backward Euler-Maruyama schemes in time. New sharp regularity results are proven for its solution. The spectral approximation is based on a truncation of the series expansion with respect to the spherical harmonic functions. For a given regularity of the initial condition and two different settings of regularity for the driving noise, strong convergence rates for the spectral approximation and for the Euler-Maruyama methods are proven. Moreover, weak rates of up to twice the strong rates are shown for Wiener noise and for Lévy noise with independent and up to a deterministic decay rate factor identically distributed components, while for general square-integrable Lévy noise the weak rate depends explicitly on the polynomial order of the test function. Numerical simulations confirm the theoretical results.

math.PR↗

A Multivariate Generalized Cox Model for Dependent and Simultaneous Default Times

We propose a framework for dependent default times where each name defaults when an increasing driver crosses an independent unit exponential threshold. As in Gueye and Jeanblanc (2022), the drivers may jump, so defaults may occur at stopping times of the reference filtration, including predictable ones, and a common jump may cause no, one or several simultaneous defaults. For general drivers, we derive the conditional joint survival law by a backward recursion; it is an explicit product of survival functions if and only if, for every set of names, the predictable reduction of the compensator of their first default time is deterministic. If, moreover, defaults avoid predictable stopping times, the law is a fatal shock law with hazards identified from the drivers; predictable default atoms can rule this out. Examples include Lévy subordinators and, with random reductions but explicit laws, Liu's model and shot-noise drivers with memory.

math.PR↗

Concentration Inequalities for Branching Random Walks

Motivated by phase transition problems in CSPs, we prove a more general concentration inequality that retains classical sub-Gaussian tails under a mild global linear-growth condition $|S_n| < Cn$, relaxing the bounded-increment assumption to finite exponential moments and requiring neither independence nor the martingale property. We further extend it to branching random walks (BRWs), obtaining the first concentration inequality for BRWs.

math.PR↗