相关论文: New bounds for circulant Johnson-Lindenstrauss emb…
We consider the spectrum of additive, polynomially vanishing random perturbations of deterministic matrices, as follows. Let $M_N$ be a deterministic $N\times N$ matrix, and let $G_N$ be a complex Ginibre matrix. We consider the matrix…
A new lattice Boltzmann (LB) model is introduced, based on a regularization of the pre-collision distribution functions in terms of the local density, velocity, and momentum flux tensor. The model dramatically improves the precision and…
Following a strategy suggested by Michel--Venkatesh, we study the cubic moment of automorphic $L$-functions on $\operatorname{PGL}_2$ using regularized diagonal periods of products of Eisenstein series. Our main innovation is to produce…
Using spectral embedding based on the signless Laplacian, we obtain bounds on the spectrum of transition matrices on graphs. As a consequence, we bound return probabilities and the uniform mixing time of simple random walk on graphs. In…
The celebrated dimension reduction lemma of Johnson and Lindenstrauss has numerous computational and other applications. Due to its application in practice, speeding up the computation of a Johnson-Lindenstrauss style dimension reduction is…
In this paper, we study the condition number of a random Toeplitz matrix. Since a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic…
We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…
The Lovasz Local Lemma (LLL) is a probabilistic tool which has been used to show the existence of a variety of combinatorial structures with good "local" properties. The "LLL-distribution" can be used to show that the resulting structures…
We present an extension of an adaptive, partially matrix-free, Hierarchically Semi-Separable (HSS) matrix construction algorithm by Gorman et al. [SIAM J. Sci. Comput. 41(5), 2019] which uses Gaussian sketching operators to a broader class…
We study random matrices with independent subgaussian columns. Assuming each column has a fixed Euclidean norm, we establish conditions under which such matrices act as near-isometries when restricted to a given subset of their domain. We…
We consider $N\times N$ Gaussian random matrices, whose average density of eigenvalues has the Wigner semi-circle form over $[-\sqrt{2},\sqrt{2}]$. For such matrices, using a Coulomb gas technique, we compute the large $N$ behavior of the…
The random splitting Langevin Monte Carlo could mitigate the first order bias in Langevin Monte Carlo with little extra work compared other high order schemes. We develop in this work an analysis framework for the sampling error under…
The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and…
We prove strong hybrid subconvex bounds simultaneously in the $q$ and $t$ aspects for $L$-functions of selfdual $\mathrm{GL}_3$ cusp forms twisted by primitive Dirichlet characters. We additionally prove analogous hybrid subconvex bounds…
Relaxation method is described on simple superconducting cases in one and two dimensions in Ginzburg-Landau (GL) formalism. The structure of the algorithm is given for the case time independent and time dependent GL equation. The advantages…
The Johnson-Lindenstrauss lemma allows dimension reduction on real vectors with low distortion on their pairwise Euclidean distances. This result is often used in algorithms such as $k$-means or $k$ nearest neighbours since they only use…
The classical Gaussian ensembles of random matrices can be constructed by maximizing Boltzmann-Gibbs-Shannon's entropy, S_{BGS} = - \int d{\bf H} [P({\bf H})] \ln [P({\bf H})], with suitable constraints. Here we construct and analyze…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
We present model calculations for the Landauer conductance of tunnel junctions. The tunneling of free electrons through a rectangular potential barrier is considered. The conductance of a finite number of barriers was calculated using a…
We identify materially defined regions in unsteady two-dimensional flows that combine finite-time contraction with elevated accumulated intrinsic rotation along trajectories, which we term \emph{Lagrangian rotating contracting structures}…