Related papers: Limit profile for random transpositions

A comparison technique for finite random walks on finite graphs is introduced, using the well-known interlacing method. It yields improved return probability bounds. A key feature is the incorporation of parts of the spectrum of the…

We consider the inverse boundary value problem of determining the Lam\'e moduli of an isotropic, static elasticity equations of system at the boundary from the localized Dirichlet-to-Neumann map. Assuming appropriate local regularity…

In this paper, we establish sharp upper bounds on shifted moments of the family of Dirichlet $L$-functions to a fixed modulus over function fields. We apply the result to obtain upper bounds on moments of Dirichlet character sums over…

We use causality to derive a number of simple and universal constraints on dispersion relations, which describe the location of singularities of retarded two-point functions in relativistic quantum field theories. We prove that all causal…

We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…

We present an overview of the representation theoretic techniques used to study the mixing times of random walks on finite groups. We focus on the card shuffle studied by Diaconis and Shahshahani in the 1980s and a recent improvement on…

We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…

The principal results of this contribution are the weak and strong limits of maxima of contracted stationary Gaussian random sequences. Due to the random contraction we introduce a modified Berman condition which is sufficient for the weak…

We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

In this paper, we approach the task of determining sensitivity bounds for pose estimation neural networks. This task is particularly challenging as it requires characterizing the sensitivity of 3D rotations. We develop a sensitivity measure…

A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

We study some properties of the coincidence set for the boundary Signorini problem, improving some results from previous works by the second author and collaborators. Among other new results, we show here that the convexity assumption on…

We obtain rigorous upper and lower bounds for the error in the recent approximation for $\pi$ proposed by Chakrabarti and Hudson

In this note, we give a probabilistic interpretation of the Central Limit Theorem used for approximating isotropic Gaussians in [1].

We consider diffraction at random point scatterers on general discrete point sets in $\R^\nu$, restricted to a finite volume. We allow for random amplitudes and random dislocations of the scatterers. We investigate the speed of convergence…

This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…

This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…

We develop an encounter-based approach for describing restricted diffusion with a gradient drift towards a partially reactive boundary. For this purpose, we introduce an extension of the Dirichlet-to-Neumann operator and use its eigenbasis…