Related papers: An algorithm for the computation of joint Hawkes m…
A cluster representation for a Hawkes process with renewal immigration is obtained. The centre and satellite processes are indicated as a renewal process and generalized branching processes respectively. It is confirmed that the proposed…
Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter. This operation is fundamental in quantum mechanics,…
A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…
We provide an algebraic setting for cumulants and factorial moments through the classical umbral calculus. Main tools are the compositional inverse of the unity umbra, connected with the logarithmic power series, and a new umbra here…
Classic estimation methods for Hawkes processes rely on the assumption that observed event times are indeed a realisation of a Hawkes process, without considering any potential perturbation of the model. However, in practice, observations…
An algorithm for numerically computing the exponential of a matrix is presented. We have derived a polynomial expansion of $e^x$ by computing it as an initial value problem using a symbolic programming language. This algorithm is shown to…
We present quadrature schemes to calculate matrices, where the so-called modified Hilbert transformation is involved. These matrices occur as temporal parts of Galerkin finite element discretizations of parabolic or hyperbolic problems when…
We assume some standard choices for the branch cuts of a group of functions and consider the problem of then calculating the branch cuts of expressions involving those functions. Typical examples include the addition formulae for inverse…
Reductions combine collections of input values with an associative and often commutative operator to produce collections of results. When the same input value contributes to multiple outputs, there is an opportunity to reuse partial…
A key difficulty that arises from real event data is imprecision in the recording of event time-stamps. In many cases, retaining event times with a high precision is expensive due to the sheer volume of activity. Combined with practical…
In this work, we have developed a multiscale computational algorithm to couple finite element method with an open source molecular dynamics code --- the Large scale Atomic/Molecular Massively Parallel Simulator (LAMMPS) --- to perform…
As an extension of self-exciting Hawkes process, the multivariate Hawkes process models counting processes of different types of random events with mutual excitement. In this paper, we present a perfect sampling algorithm that can generate…
We present a multiscale integrator for Hamiltonian systems with slowly varying quadratic stiff potentials that uses coarse timesteps (analogous to what the impulse method uses for constant quadratic stiff potentials). This method is based…
We present a new method to compute short-time expectation values in large collective spin systems with generic Markovian decoherence. Our method is based on a Taylor expansion of a formal solution to the equations of motion for Heisenberg…
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of…
We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…
At high energy physics experiments, processing billions of records of structured numerical data from collider events to a few statistical summaries is a common task. The data processing is typically more complex than standard query…
Driven by the recent surge in neural-inspired modeling, point processes have gained significant traction in systems and control. While the Hawkes process is the standard model for characterizing random event sequences with memory,…
We derive a recursive formula for the moments of the number of flips using a possibly biased coin to produce a prescribed finite binary string $S$ when $S$ is either a run of heads or a run of heads followed by a tails. Our recursive…
We propose an ensemble algorithm, which provides a new approach for evaluating and summing up a set of function samples. The proposed algorithm is not a quantum algorithm, insofar it does not involve quantum entanglement. The query…