Results 71 to 80 of about 885 (149)
PRX QuantumSolving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)]
David Jennings +4 more
doaj +1 more source
Fine structure of moments of the KMK transform of the Poissonized Plancharel measure [PDF]
, 2016 Patrick Waters
openalex +2 more sources
On the Domination of Random Walk on a Discrete Cylinder by Random Interlacements
, 2009 We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of side-length almost of
Sznitman, Alain-Sol
core +4 more sources
Poisson geometry around Poisson submanifolds
Journal of the European Mathematical SocietyWe construct a first-order local model for Poisson manifolds around a large class of Poisson submanifolds and give conditions under which this model is a local normal form. The resulting linearization theorem includes as special cases all the known linearization theorems for fixed points and symplectic leaves.
Rui Loja Fernandes, Ioan Mărcuţ
openaire +2 more sources
Local limit theorems for finite and infinite urn models
, 2006 Local limit theorems are derived for the number of occupied urns in general finite and infinite urn models under the minimum condition that the variance tends to infinity.
Hwang, Hsien-Kuei, Janson, Svante
core +7 more sources
, 2014 In this paper we develope a theory of reduction for classical systems with Poisson Lie groups symmetries using the notion of momentum map introduced by Lu. The local description of Poisson manifolds and Poisson Lie groups and the properties of Lu's momentum map allow us to define a Poisson reduced space.
openaire +3 more sources
The Total Acquisition Number of Random Geometric Graphs [PDF]
, 2016 Let $G$ be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex $u$ to a neighbouring vertex $v$ can be moved, provided that the weight on $v$ is at least as large as the weight on $u$.
Infeld, Ewa +2 more
core +2 more sources
Small-Sample Estimation of the Mutational Support and Distribution of SARS-CoV-2. [PDF]
IEEE/ACM Trans Comput Biol Bioinform, 2023 Rana V, Chien E, Peng J, Milenkovic O.
europepmc +1 more source
Nonparametric coalescent inference of mutation spectrum history and demography. [PDF]
Proc Natl Acad Sci U S A, 2021 DeWitt WS +3 more
europepmc +1 more source
The Page-R{\'e}nyi parking process [PDF]
, 2015 In the Page parking (or packing) model on a discrete interval (also known as the discrete R{\'e}nyi packing problem or the unfriendly seating problem), cars of length two successively park uniformly at random on pairs of adjacent places, until only ...
Gerin, Lucas
core +2 more sources