Related papers: Nonintersecting paths with a staircase initial con…
Using transfer matrices up to next-nearest-neighbour (NNN) interactions, we examine the structural correlations of quasi-one-dimensional systems of hard disks confined by two parallel lines and hard spheres confined in cylinders.…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
In many applications of machine learning, a large number of variables are considered. Motivated by machine learning of interacting particle systems, we consider the situation when the number of input variables goes to infinity. First, we…
We consider a branching random walk with immigration in a random environment, where the environment is a stationary and ergodic sequence indexed by time. We focus on the asymptotic properties of the sequence of measures $(Z_n)$ that count…
Spherical and hyperspherical data are commonly encountered in diverse applied research domains, underscoring the vital task of assessing independence within such data structures. In this context, we investigate the properties of test…
The state space of our model is the Euclidean space in dimension d = 2. Simultaneously, from all points of a homogeneous Poisson point process, we let grow independent and identically distributed random continuum paths. Each path stops…
We prove quenched invariance principle for simple random walk on the unique infinite percolation cluster for a general class of percolation models on Z^d, d>=2, with long-range correlations introduced in arXiv:1212.2885, solving one of the…
We demonstrate the existence of multiple converging sequences in the ab initio no-core shell model. By examining the underlying theory of effective operators, we expose the physical foundations for the alternative pathways to convergence.…
Given an iid sequence of pairs of stochastic processes on the unit interval we construct a measure of independence for the components of the pairs. We define distance covariance and distance correlation based on approximations of the…
We introduce and study a 2-parameter family of unitarily invariant probability measures on the space of infinite Hermitian matrices. We show that the decomposition of a measure from this family on ergodic components is described by a…
We consider nonintersecting random walks satisfying the condition that the increments have a finite moment generating function. We prove that in a certain limiting regime where the number of walks and the number of time steps grow to…
We study semi-infinite paths of the radial spanning tree (RST) of a Poisson point process in the plane. We first show that the expectation of the number of intersection points between semi-infinite paths and the sphere with radius $r$ grows…
Non-colliding Brownian particles in one dimension is studied. $N$ Brownian particles start from the origin at time 0 and then they do not collide with each other until finite time $T$. We derive the determinantal expressions for the…
We consider a class of growing random graphs obtained by creating vertices sequentially one by one: at each step, we choose uniformly the neighbours of the newly created vertex; its degree is a random variable with a fixed but arbitrary…
An important problem in quantum information theory is that of bounding sets of correlations that arise from making local measurements on entangled states of arbitrary dimension. Currently, the best-known method to tackle this problem is the…
A novel nonparametric clustering algorithm is proposed using the interpoint distances between the members of the data to reveal the inherent clustering structure existing in the given set of data, where we apply the classical nonparametric…
We consider the interlacement Poisson point process on the space of doubly-infinite Z^d-valued trajectories modulo time-shift, tending to infinity at positive and negative infinite times. The set of vertices and edges visited by at least…
On the complete graph ${\cal{K}}_M$ with $M \ge3$ vertices consider two independent discrete time random walks $\mathbb{X}$ and $\mathbb{Y}$, choosing their steps uniformly at random. A pair of trajectories $\mathbb{X} = \{ X_1, X_2, \dots…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…
We derive the timescale for two initially pure subsystems to become entangled with each other through an arbitrary Hamiltonian that couples them. The entanglement timescale is inversely proportional to the "correlated uncertainty" between…