相关论文: Discrete logarithms in free groups
Calculation of the distribution of the average value of a Gaussian random field in a finite domain is carried out for different cases. The results of the calculation demonstrate a strong dependence of the width of the distribution on the…
This paper presents a general approach to linear stochastic processes driven by various random noises. Mathematically, such processes are described by linear stochastic differential equations of arbitrary order (the simplest non-trivial…
We show that on an arbitrary finitely generated non virtually solvable linear group, any two independent random walks will eventually generate a free subgroup. In fact, this will hold for an exponential number of independent random walks.
We study discretizations of Hamiltonian systems on the probability density manifold equipped with the $L^2$-Wasserstein metric. Based on discrete optimal transport theory, several Hamiltonian systems on graph (lattice) with different…
We develop in this paper a new framework for discrete calculus of variations when the actions have densities involving an arbitrary discretization operator. We deduce the discrete Euler-Lagrange equations for piecewise continuous critical…
Let $\Gamma$ be a dense subgroup of a simply connected nilpotent Lie group $G$ generated by a finite symmetric set $S$. We consider the $n$-ball $S_n$ for the word metric induced by $S$ on $\Gamma$. We show that $S_n$ (with uniform measure)…
Improving over an earlier construction by Kaye and Zalka, Maslov et al. describe an implementation of Shor's algorithm which can solve the discrete logarithm problem on binary elliptic curves in quadratic depth O(n^2). In this paper we show…
The Gumbel trick is a method to sample from a discrete probability distribution, or to estimate its normalizing partition function. The method relies on repeatedly applying a random perturbation to the distribution in a particular way, each…
The scope of constrained differential renormalization is to provide renormalized expressions for Feynman graphs, preserving at the same time the Ward identities of the theory. It has been shown recently that this can be done consistently at…
We consider the problem of deterministic load balancing of tokens in the discrete model. A set of $n$ processors is connected into a $d$-regular undirected network. In every time step, each processor exchanges some of its tokens with each…
In this paper, we study the problem of deriving fast and accurate classification algorithms with uncertainty quantification. Gaussian process classification provides a principled approach, but the corresponding computational burden is…
We consider the value distribution of the difference between logarithms of two symmetric power $L$-functions at $s=\sigma > 1/2$. We prove that certain averages of those values can be written as integrals involving a density function which…
We present fast and efficient randomized distributed algorithms to find Hamiltonian cycles in random graphs. In particular, we present a randomized distributed algorithm for the $G(n,p)$ random graph model, with number of nodes $n$ and…
We study $2$-step nilpotent Lorentzian Lie groups $N$, which are naturally reductive with respect to a certain class of transitive subgroups of isometries. We describe the isotropy representation and prove that its fixed points give raise…
We consider a natural class of long range random walks on torsion free nilpotent groups and develop limit theorems for these walks. Given the original discrete group $\Gamma$ and a random walk $(S_n)_ {n\ge1}$ driven by a certain type of…
In this paper, I will introduce a fast and novel clustering algorithm based on Gaussian distribution and it can guarantee the separation of each cluster centroid as a given parameter, $d_s$. The worst run time complexity of this algorithm…
With recently developed tools, we prove a homogenisation theorem for a random ODE with short and long-range dependent fractional noise. The effective dynamics are not necessarily diffusions, they are given by stochastic differential…
The aim of this paper is to give a new result of the differential Galois theory of linear ordinary differential equations. In particular, we compute differential Galois group for special type non-resonant Fuchsian system.
We develop a near-optimal testing procedure under the framework of Gaussian differential privacy for simple as well as one- and two-sided tests under monotone likelihood ratio conditions. Our mechanism is based on a private mean estimator…
We show how to perform systematically improvable variational calculations in the $O(2N)$ Gross-Neveu model for generic $N$, in such a way that all infinities usually plaguing such calculations are accounted for in a way compatible with the…