Related papers: Individual displacements in hashing with coalesced…
We investigate how entanglement spreads along small Bose-Hubbard chains, with only the first well initially occupied by a mesoscopic number of atoms, as the number of sites increases. For two- and three-well chains in the non-interacting…
The propagation of an interacting particle pair in a disordered chain is characterized by a set of localization lengths which we define. The localization lengths are computed by a new decimation algorithm and provide a more comprehensive…
While separate chaining is a common strategy for resolving collisions in a hash table taught in most textbooks, compact hashing is a less common technique for saving space when hashing integers whose domain is relatively small with respect…
We introduce a Poissonization method to study the coalescent structure of uniform samples from branching processes. This method relies on the simple observation that a uniform sample of size $k$ taken from a random set with positive…
Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…
We show that for all $\psi$-mixing shifts distributions of the numbers of multiple recurrencies to shrinking cylindrical neighborhoods of all points are close either to Poisson or to compound Poisson distributions. We also describe…
Ionic transport in conventional ionic solids is generally considered to proceed via independent diffusion events or "hops''. This assumption leads to well-known Arrhenius expressions for transport coefficients, and is equivalent to assuming…
Using the supersymmetry technique, we study the localization-delocalization transition in quasi-one-dimensional non-Hermitian systems with a direction. In contrast to chains, our model captures the diffusive character of carriers' motion at…
Asymptotics of the variances of many cost measures in random digital search trees are often notoriously messy and involved to obtain. A new approach is proposed to facilitate such an analysis for several shape parameters on random symmetric…
We suggest a new hardcore Poisson-type distribution for Young diagrams with the row lengths from some finite list. A discrete variant of the time-ordered Mat\'{e}rn II process in 1D is employed. This approach is related to that based on the…
We determine the asymptotic speed of the first-passage percolation process on some ladder-like graphs (or width-2 stretches) when the times associated with different edges are independent and exponentially distributed but not necessarily…
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…
We consider a spatial branching process with emigration in which children either remain at the same site as their parents or migrate to new locations and then found their own colonies. We are interested in asymptotics of the partition of…
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…
We consider a unified framework of sequential change-point detection and hypothesis testing modeled by means of hidden Markov chains. One observes a sequence of random variables whose distributions are functionals of a hidden Markov chain.…
We investigate the distribution of the depth of a node containing a specific key or, equivalently, the number of steps needed to retrieve an item stored in a randomly grown binary search tree. Using a representation in terms of mixed and…
Traditionally, time-development of the mean square displacement has been employed to determine the diffusion coefficient from the trajectories of single particles. However, this approach is sensitive to the noise and the motion blur upon…
We consider soft random geometric graphs, constructed by distributing points (nodes) randomly according to a Poisson Point Process, and forming links between pairs of nodes with a probability that depends on their mutual distance, the…
The asymptotic behavior of the tail probabilities for the first hitting times of the Bessel process with arbitrary index is shown without using the explicit expressions for the distribution function obtained in the authors' previous works.
We compute profile likelihoods for a stochastic model of diffusive transport motivated by experimental observations of heat conduction in layered skin tissues. This process is modelled as a random walk in a layered one-dimensional material,…