Related papers: Limit profile for random transpositions
We study a class of self-repelling diffusions on compact Riemannian manifolds whose drift is the gradient of a potential accumulated along their trajectory. When the interaction potential admits a suitable spectral decomposition, the…
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…
We prove limit theorems for the number of fixed points, descents, and inversions of iterated random-to-top shuffles in two asymptotic regimes. Our proofs are analytic, and they utilize new combinatorial decompositions that represent each…
We connect known results about diffusion limits of Markov chain Monte Carlo (MCMC) algorithms to the Computer Science notion of algorithm complexity. Our main result states that any diffusion limit of a Markov process implies a…
We prove a new sample complexity result for divergence regularized optimal transport. Our bound holds for probability measures on~$\mathbb{R}^d$ with exponential tail decay and for radial cost functions that satisfy a local Lipschitz…
We provide a lower bound for the ratio between the ordinary and uniform exponent of both simultaneous Diophantine approximation and Diophantine approximation by linear forms in any dimension. This lower bound was conjectured by Schmidt and…
In this paper we improve some existing results concerning the approximation of the distribution of extremes of a 1-dependent and stationary sequence of random variables. We enlarge the range of applicability and improve the approximation…
The upper estimate of the percolation threshold of the Bernoulli random field on the hexagonal lattice is found. It is done on the basis of the cluster decomposition. Each term of the decomposition is estimated using the number estimate of…
We study the transmission problem in bounded domains with dissipative boundary conditions. Under some natural assumptions, we prove uniform bounds of the corresponding resolvents on the real axis at high frequency, and as a consequence, we…
A method is presented for proving upper bounds on the moments of the position operator when the dynamics of quantum wavepackets is governed by a random (possibly correlated) Jacobi matrix. As an application, one obtains sharp upper bounds…
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
In this paper, we use the concept of excursion sets for the extrapolation of stationary random fields. Doing so, we define excursion sets for the field and its linear predictor, and then minimize the expected volume of the symmetric…
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,…
We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations.…
Uncertainty often plays an important role in dynamic flow problems. In this paper, we consider both, a stationary and a dynamic flow model with uncertain boundary data on networks. We introduce two different ways how to compute the…
In this paper, we consider upper bounds on the size of transitive subtournaments in a digraph. In particular, we give an analogy of Hoffman's bound for the size of cocliques in a regular graph. Furthermore, we partially improve the Hoffman…
We demonstrate a simple analytic argument that may be used to bound the Levy concentration function of a sum of independent random variables. The main application is a version of a recent inequality due to Rudelson and Vershynin, and its…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
We prove that the upper bounds for the consistency strength of certain instances of mutual stationarity considered by Liu-Shelah~\cite{MR1469093} are close to optimal. We also consider some related and, as it turns out, stronger properties.
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known…