Related papers: Computing the average parallelism in trace monoids

Trace monoids and heaps of pieces appear in various contexts in combinatorics. They also constitute a model used in computer science to describe the executions of asynchronous systems. The design of a natural probabilistic layer on top of…

We prove a unified trace-average formula for the $k$-th higher trace $\lambda_k(A)=\operatorname{tr}(\Lambda^k A)$ of a linear operator $A$ on a finite-dimensional normed space. The formula averages the matrix coefficient…

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the…

We give a graded version of the M\"obius inversion formula in the framework of trace monoids. The formula is based on a graded version of the M\"obius transform, related to the notion of height deriving from the Cartier-Foata normal form of…

We introduce an algorithm for the uniform generation of infinite traces, i.e., infinite words up to commutation of some letters. The algorithm outputs on-the-fly approximations of a theoretical infinite trace, the latter being distributed…

Here we describe the distribution of rational points on the Hilbert scheme of two points in the projective plane. More specifically, we explicitly describe a two-parameter family of height functions $H_{s, t}$, such that the height function…

To each sequence $(a_n)$ of positive real numbers we associate a growing sequence $(T_n)$ of continuous trees built recursively by gluing at step $n$ a segment of length $a_n$ on a uniform point of the pre-existing tree, starting from a…

We introduce an algorithm for the uniform generation of infinite runs in concurrent systems under a partial order probabilistic semantics. We work with trace monoids as concurrency models. The algorithm outputs on-the-fly approximations of…

Let X_0=0, X_1, X_2, ..., be an aperiodic random walk generated by a sequence xi_1, xi_2, ..., of i.i.d. integer-valued random variables with common distribution p(.) having zero mean and finite variance. For an N-step trajectory…

We derive a non-asymptotic expression for the moments of traces of monomials in several independent complex Wishart matrices, extending some explicit formulas available in the literature. We then deduce the explicit expression for the…

We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…

Transient responses in disordered systems typically show a heavy-tail relaxation behavior: the decay time constant increases as time increases, revealing a spectral distribution of time constants. The asymptotic value of such transients is…

The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…

The reflected process of a random walk or L\'evy process arises in many areas of applied probability, and a question of particular interest is how the tail of the distribution of the heights of the excursions away from zero behaves…

We show that in any symmetric monoidal category, if a weight for colimits is absolute, then the resulting colimit of any diagram of dualizable objects is again dualizable. Moreover, in this case, if an endomorphism of the colimit is induced…

We define a notion of height for rational points with respect to a vector bundle on a proper algebraic stack with finite diagonal over a global field, which generalizes the usual notion for rational points on projective varieties. We…

The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…

It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…

The parallel computational complexity of the quadratic map is studied. A parallel algorithm is described that generates typical pseudotrajectories of length t in a time that scales as log t and increases slowly in the accuracy demanded of…

The associative algebra of symplectic reflections $\mathcal H:= H_{1,\nu_1, \nu_2}(I_2(2m))$ based on the group generated by the root system $I_2(2m)$ has two parameters, $\nu_1$ and $\nu_2$. For every value of these parameters, the algebra…