Related papers: The oscillatory distribution of distances in rando…
We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…
Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by…
Given a sequence of numbers $\{p_n\}$ in $[0,1]$, consider the following experiment. First, we flip a fair coin and then, at step $n$, we turn the coin over to the other side with probability $p_n$, $n\ge 2$. What can we say about the…
We consider internal diffusion limited aggregation in dimension larger than or equal to two. This is a random cluster growth model, where random walks start at the origin of the d-dimensional lattice, one at a time, and stop moving when…
We investigate the structural organization of the point-to-point electric, diffusive or hydraulic transport in complex scale-free networks. The random choice of two nodes, a source and a drain, to which a potential difference is applied,…
The $\Delta_3(L)$ statistic is studied as a tool to detect missing levels in the neutron resonance data where 2 sequences are present. These systems are problematic because there is no level repulsion, and the resonances can be too close to…
Given a set of strings over a specified alphabet, identifying a median or consensus string that minimizes the total distance to all input strings is a fundamental data aggregation problem. When the Hamming distance is considered as the…
We study the growth of random networks under a constraint that the diameter, defined as the average shortest path length between all nodes, remains approximately constant. We show that if the graph maintains the form of its degree…
We derive distributional approximations for the number of triangles in the linear preferential attachment model $\mathrm{PAM}(m,\delta)$, where $m\ge 2$ and $\delta>-m$, with explicit rates of convergence. The limiting distribution…
Let $\mathbf{X} = (X_i)_{1\leq i \leq n}$ be an i.i.d. sample of square-integrable variables in $\mathbb{R}^d$, \GB{with common expectation $\mu$ and covariance matrix $\Sigma$, both unknown.} We consider the problem of testing if $\mu$ is…
Node centrality is one of the integral measures in network analysis with wide range of applications from socio-economic to personalized recommendation. We argue that an effective centrality measure should undertake stability even under…
We consider a wireless network comprising $n$ nodes located within a circular area of radius $R$, which are participating in a decentralized learning algorithm to optimize a global objective function using their local datasets. To enable…
The distribution of distances in the star graph $ST_n$, ($1<n\in\Z$), is established, and subsequently a threaded binary tree is obtained that realizes an orientation of $ST_n$ whose levels are given by the distances to the identity…
We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time $n=1,2,\dots$, right before stepping, the walker adds a random number (possibly…
Delaunay triangulation can be considered as a type of complex networks. For complex networks, the degree distribution is one of the most important inherent characteristics. In this paper, we first consider the two- and three-dimensional…
Stationary probability distributions of one-dimensional random walks on lattices with aperiodic disorder are investigated. The pattern of the distribution is closely related to the diffusional behavior, which depends on the wandering…
Data-driven spatial filtering algorithms optimize scores such as the contrast between two conditions to extract oscillatory brain signal components. Most machine learning approaches for filter estimation, however, disregard within-trial…
Consider a system of particles evolving as independent and identically distributed (i.i.d.) random walks. Initial fluctuations in the particle density get translated over time with velocity $\vec{v}$, the common mean velocity of the random…
The problem of comparing probability distributions is at the heart of many tasks in statistics and machine learning. Established comparison methods treat the standard setting that the distributions are supported in the same space. Recently,…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…