Related papers: A Graded M\"obius transform and its harmonic inter…
In this paper we extend the refined second-order Poincar\'e inequality for Poisson functionals from a one-dimensional to a multi-dimensional setting. Its proof is based on a multivariate version of the Malliavin-Stein method for normal…
Bayesian inference, while foundational to probabilistic reasoning, is often hampered by the computational intractability of posterior distributions, particularly through the challenging evidence integral. Conventional approaches like Markov…
We present a two term formula for the M\"obius function of intervals in the poset of all permutations, ordered by pattern containment. The first term in this formula is the number of so called normal occurrences of one permutation in…
We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
The set of all permutations, ordered by pattern containment, is a poset. We give a formula for the M\"obius function of intervals $[1,\pi]$ in this poset, for any permutation $\pi$ with at most one descent. We compute the M\"obius function…
In this paper, we study non-trivial upper bounds for the sum $\sum \limits_{n \in S} |\lambda_f(n)|$ where $f$ is a normalized Maass eigencusp form for the full modular group, $\lambda_f(n)$ is the $n$th normalized Fourier coefficient of…
We develop a numerical approach for computing the additive, multiplicative and compressive convolution operations from free probability theory. We utilize the regularity properties of free convolution to identify (pairs of) `admissible'…
Given a permutation $\sigma$, its corresponding binary search tree is obtained by recursively inserting the values $\sigma(1),\ldots,\sigma(n)$ into a binary tree so that the label of each node is larger than the labels of its left subtree…
In this note, we compute the Mellin transform of a Poissonian exponential functional, the underlying process being a simple continuous time random walk. It shows that the Poissonian functional can be expressed in term of the inverse of a…
We use M\"obius inversion and the Bernoulli polynomials to prove inequalities between the logarithmic summatory function of the M\"obius function and weighted averages of its ordinary summatory function.
We review some aspects of harmonic analysis for the Euclidean conformal group, including conformally-invariant pairings, the Plancherel measure, and the shadow transform. We introduce two efficient methods for computing these quantities:…
This is the second of a series of two technical papers devoted to the analysis of holonomy invariants in strict higher gauge theory with end applications in higher Chern--Simons theory. We provide a definition of trace over a crossed module…
We introduce a Poisson version of the graded twist of a graded associative algebra and prove that every graded Poisson structure on a connected graded polynomial ring $A:=\Bbbk[x_1,\ldots,x_n]$ is a graded twist of a unimodular Poisson…
We discuss a gauge invariant approach to the theory of cosmological perturbations in a higher-dimensonal background. We find the normal modes which diagonalize the perturbed action, for a scalar field minimally coupled to gravity, in a…
We give a condition for a function to produce a M\"obius invariant weighted inner product on the tangent space of the space of knots, and show that some kind of M\"obius invariant knot energies can produce M\"obius invariant and…
Given an orthogonal polynomial sequence on the real line, another sequence of polynomials can be found by composing these polynomials with a general M\"obius transformation. In this work, we study the properties of such M\"obius-transformed…
The transition matrix of a Markov chain $(X_k,k\geq 0)$ on a finite or infinite rooted tree is said to be almost upper-directed if, given $X_k$, the node $X_{k+1}$ is either a descendant of $X_k$ or the parent of $X_k$. It is said to be…
We consider the motion of a particle on a Galton Watson tree, when the probabilities of jumping from a vertex to any one of its neighbours is determined by a random process. Given the tree, positive weights are assigned to the edges in such…
In this article we present an intrinsec construction of foliated Brownian motion via stochastic calculus adapted to foliation. The stochastic approach together with a proposed foliated vector calculus provide a natural method to work on…