Related papers: Length Distributions in Loop Soups
The center of gravity is one of the most frequently used algorithm for position reconstruction with different analytical forms for the noise optimization. The error distributions of the different forms are essential instruments to improve…
We construct a hierarchy of loop equations for invariant circular ensembles. These are valid for general classes of potentials and for arbitrary inverse temperatures $ {\rm Re}\,\beta>0 $ and number of eigenvalues $ N $. Using matching…
A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…
Poissonian ensembles of Markov loops on a finite graph define a random graph process in which the addition of a loop can merge more than two connected components. We study Markov loops on the complete graph derived from a simple random walk…
Consider a sequence of Poisson point processes of non-trivial loops with certain intensity measures $(\mu^{(n)})_n$, where each $\mu^{(n)}$ is explicitly determined by transition probabilities $p^{(n)}$ of a random walk on a finite state…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
We introduce a new correlated percolation model on the $d$-dimensional lattice $\mathbb{Z}^d$ called the random length worms model. Assume given a probability distribution on the set of positive integers (the length distribution) and $v \in…
We discuss the asymptotic behaviour of models of lattice polygons, mainly on the square lattice. In particular, we focus on limiting area laws in the uniform perimeter ensemble where, for fixed perimeter, each polygon of a given area occurs…
This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in expected $O(\log \log \log n)$ rounds and using this, we…
A new generalization of the family of Poisson-G is called beta Poisson-G family of distribution. Useful expansions of the probability density function and the cumulative distribution function of the proposed family are derived and seen as…
We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…
The structure of a river network may be seen as a discrete set of nested sub-networks built out of individual stream segments. These network components are assigned an integral stream order via a hierarchical and discrete ordering method.…
The discrete unitary (reversible) analogues of the continuous (irreversible) tent maps are numerically investigated, in particular, the lengths probability distribution of their periodic orbits. It is found that its density can be well…
A constrained diffusive random walk of n steps and a random flight in Rd, which can be expressed in the same terms, were investigated independently in recent papers. The n steps of the walk are identically and independently distributed…
We study the length of cycles in the model of spatial random permutations in Euclidean space. In this model, for given length $L$, density $\rho$, dimension $d$ and jump density $\varphi$, one samples $\rho L^d$ particles in a…
In this project, we employ the short-distance factorization to compute the distribution amplitude of the $\eta_c$-meson from Lattice QCD at leading twist. We employ a set of CLS $N_f=2$ ensembles at three lattice spacings and various quark…
In this article we survey properties of mixed Poisson distributions and probabilistic aspects of the Stirling transform: given a non-negative random variable $X$ with moment sequence $(\mu_s)_{s\in\mathbb{N}}$ we determine a discrete random…
We describe a procedure to determine moments of parton distribution functions of any order in lattice quantum chromodynamics (QCD). The procedure is based on the gradient flow for fermion and gauge fields. The flowed matrix elements of…
We study probability distributions of convergent random series of a special structure, called perpetuities. By giving a new argument, we prove that such distributions are of pure type: degenerate, absolutely continuous, or continuously…
Finding the underlying probability distributions of a set of observed sequences under the constraint that each sequence is generated i.i.d by a distinct distribution is considered. The number of distributions, and hence the number of…