Related papers: Computing the average parallelism in trace monoids
In the critical beta-splitting model of a random $n$-leaf binary tree, leaf-sets are recursively split into subsets, and a set of $m$ leaves is split into subsets containing $i$ and $m-i$ leaves with probabilities proportional to…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…
A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk…
We study, via combinatorial enumeration, the probability of k-hop connection between two nodes in a wireless multi-hop network. This addresses the difficulty of providing an exact formula for the scaling of hop counts with Euclidean…
In this work, we present a comprehensive study of the relationship among uniform Lyapunov exponents, the Liouville trace formula, and adapted metrics for cocycles in Hilbert spaces. First, we prove that uniform Lyapunov exponents can be…
Given a graph $G$ and a bijection $f : E(G)\rightarrow \{1, 2, \ldots,e(G)\}$, we say that a trail/path in $G$ is $f$-\emph{increasing} if the labels of consecutive edges of this trail/path form an increasing sequence. More than 40 years…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
Let $g$ be a random matrix distributed according to uniform probability measure on the finite general linear group $\mathrm{GL}_n(\mathbb{F}_q)$. We show that $\mathrm{Tr}(g^k)$ equidistributes on $\mathbb{F}_q$ as $n \to \infty$ as long as…
We consider the nonparametric regression problem with multiple predictors and an additive error, where the regression function is assumed to be coordinatewise nondecreasing. We propose a Bayesian approach to make an inference on the…
We study a natural analogue of Ulam's problem for random rooted trees distributed according to a Plancherel-type measure. This probability measure is closely related to the classical Plancherel measure on integer partitions. For a…
We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…
We consider a bivariate process $X_t=(X^1_t,X^2_t)$, which is observed on a finite time interval $[0,T]$ at discrete times $0,\Delta_n,2\Delta_n,....$ Assuming that its two components $X^1$ and $X^2$ have jumps on $[0,T]$, we derive tests…
We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all connected rooted graphs with the same number of vertices. On the…
Hyperproperties, which generalize trace properties by relating multiple traces, are widely studied in information-flow security. Recently, a number of logics for hyperproperties have been proposed, and there is a need to understand their…
We consider the model of random trees introduced by Devroye [SIAM J. Comput. 28 (1999) 409-432]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion…
We generalise the formula expressing the matrix trace of a given square matrix as the integral of the numerical values of $A$ over the Euclidean sphere to the unit spheres of finite-dimensional normed spaces that have a 1-symmetric basis.…
In this paper, we are concerned with mean hitting time $\langle\mathcal{H}\rangle$ for random walks on recursive growth tree networks that are built based on an arbitrary tree as the seed via implementing various primitive graphic…
We consider (random) walks in a multidimensional orthant. Using the idea of universality in probability theory, one can associate a unique polyhedral domain to any given walk model. We use this connection to prove two sets of new results.…
This paper extends the result of Broniatowski and Caron (2013) pertaining to the asymptotic distribution of a random walk conditioned on its final value as the number of summands increase. We consider multivariate light-tailed random walk…
We study analytically, in one dimension, the survival probability $P_{s}(t)$ up to time $t$ of an immobile target surrounded by mutually noninteracting traps each performing a continuous-time random walk (CTRW) in continuous space. We…