Results 51 to 60 of about 131 (118)
Multivariate representations of univariate marked Hawkes processes
Abstract Univariate marked Hawkes processes are used to model a range of real‐world phenomena including earthquake aftershock sequences, contagious disease spread, content diffusion on social media platforms, and order book dynamics. This paper illustrates a fundamental connection between univariate marked Hawkes processes and multivariate Hawkes ...
Louis Davis +3 more
wiley +1 more source
Theta maps for combinatorial Hopf algebras
There is a very natural and well-behaved Hopf algebra morphism from quasisymmetric functions to peak algebra, which we call it Theta map. This paper focuses on generalizing the peak algebra by constructing generalized Theta maps for an arbitrary combinatorial Hopf algebra.
Aliniaeifard, Farid, Li, Shu Xiao
openaire +2 more sources
Quantum algorithms for differential equations are developed with applications in computational fluid dynamics. The methods follow an iterative simulation framework, implementing Jacobi and Gauss–Seidel schemes on quantum registers through linear combinations of unitaries.
Chelsea A. Williams +4 more
wiley +1 more source
ABSTRACT Unarguably, malware and their variants have metamorphosed into objects of attack and cyber warfare. These issues have directed research focus to modeling infrastructural settings and infection scenarios, analyzing propagation mechanisms, and conducting studies that highlight optimized remedial measures.
Chukwunonso Henry Nwokoye
wiley +1 more source
Combinatorial Hopf algebra of supercharacters of type D [PDF]
We provide a Hopf algebra structure on the supercharacter theory for the unipotent upper triangular group of type {D} over a finite field. Also, we make further comments with respect to types {B} and {C}. Type {A} was explored by M. Aguiar et. al (2010), thus this extended abstract is a contribution to understand combinatorially the supercharacter ...
openaire +3 more sources
Nonlinear Modeling and Transient Stability Analysis of SG–PV Infeed Systems
The system stability can be judged by comparing the TEF value with the critical energy at the initial state of early fault recovery, no necessary to wait until late fault recovery. This study provides a system‐level physical picture and a fast transient stability criterion for the transient stability analysis of SG‐PV infeed systems.
Qihao Shen, Meng Zhan
wiley +1 more source
Large‐Amplitude Periodic Solutions to the Steady Euler Equations With Piecewise Constant Vorticity
ABSTRACT We consider steady solutions to the incompressible Euler equations in a two‐dimensional channel with rigid walls. The flow consists of two periodic layers of constant vorticity separated by an unknown interface. Using global bifurcation theory, we rigorously construct curves of solutions that terminate either with stagnation on the interface ...
Alex Doak +3 more
wiley +1 more source
Siegel–Veech constants for cyclic covers of generic translation surfaces
Abstract We compute the asymptotic number of cylinders, weighted by their area to any nonnegative power, on any cyclic branched cover of any generic translation surface in any stratum. Our formulae depend only on topological invariants of the cover and number‐theoretic properties of the degree: in particular, the ratio of the related Siegel–Veech ...
David Aulicino +4 more
wiley +1 more source
A combinatorial Hopf algebra on partition diagrams
We introduce a Combinatorial Hopf Algebra (CHA) with bases indexed by the partition diagrams indexing the bases for partition algebras. By analogy with the operation $H_α H_β = H_{α\cdot β}$ for the complete homogeneous basis of the CHA $ \textsf{NSym}$ given by concatenating compositions $α$ and $β$, we mimic this multiplication rule by setting ...
openaire +2 more sources
Bell polynomials in combinatorial Hopf algebras
Partial multivariate Bell polynomials have been defined by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Algebra, Probabilities, etc. Many of the formulae on Bell polynomials involve combinatorial objects (set partitions, set partitions in lists, permutations, etc.).
Aboud, Ammar +4 more
openaire +2 more sources

