Related papers: Cluster size distributions of discrete random fiel…
In this work we present for the first time an analytic framework for calculating the individual and joint distributions of the n-th most massive or n-th highest redshift galaxy cluster for a given survey characteristic allowing to formulate…
Standard clustering techniques assume a common configuration for all features in a dataset. However, when dealing with multi-view or longitudinal data, the clusters' number, frequencies, and shapes may need to vary across features to…
This article proposes a mixture modeling approach to estimating cluster-wise conditional distributions in clustered (grouped) data. We adapt the mixture-of-experts model to the latent distributions, and propose a model in which each…
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
We theoretically determine the probability distribution function of the net field of the random planar structure of dipoles which represent polarized particles. At small surface concentrations c of the point dipoles this distribution is…
In a cluster-randomized experiment, treatment is assigned to clusters of individual units of interest--households, classrooms, villages, etc.--instead of the units themselves. The number of clusters sampled and the number of units sampled…
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. When $d \ge 3$ and the fluctuation of the environment is well moderated by the random walk, we prove a central limit…
Diffusion on a T fractal lattice under the influence of topological biasing fields is studied by finite size scaling methods. This allows to avoid proliferation and singularities which would arise in a renormalization group approach on…
We obtain formulae for the expected number and height distribution of critical points of smooth isotropic Gaussian random fields parameterized on Euclidean space or spheres of arbitrary dimension. The results hold in general in the sense…
We present a systematic investigation of the distribution of normal forces at the boundaries of static packings of spheres. A new method for the efficient construction of large hexagonal-close-packed crystals is introduced and used to study…
We study the behavior of network diffusions based on the PageRank random walk from a set of seed nodes. These diffusions are known to reveal small, localized clusters (or communities) and also large macro-scale clusters by varying a…
Clustered standard errors and approximate randomization tests are popular inference methods that allow for dependence within observations. However, they require researchers to know the cluster structure ex ante. We propose a procedure to…
Clusters generated by the product-rule growth model of Achlioptas, D'Souza, and Spencer on a two-dimensional square lattice are shown to obey qualitatively different scaling behavior than standard (random growth) percolation. The threshold…
We study occurrences of patterns on clusters of size n in random fields on Z^d. We prove that for a given pattern, there is a constant a>0 such that the probability that this pattern occurs at most an times on a cluster of size n is…
Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of…
We consider a preferential growth model where particles are added one by one to the system consisting of clusters of particles. A new particle can either form a new cluster (with probability q) or join an already existing cluster with a…
Let $\mathbf{X}(n) \in \mathbb{R}^d$ be a sequence of random vectors, where $n\in\mathbb{N}$ and $d = d(n)$. Under certain weakly dependence conditions, we prove that the distribution of the maximal component of $\mathbf{X}$ and the…
We study the structure of extreme level sets of a standard one dimensional branching Brownian motion, namely the sets of particles whose height is within a fixed distance from the order of the global maximum. It is well known that such…
We consider a simple model of a growing cluster of points in $\Re^d,d\geq 2$. Beginning with a point $X_1$ located at the origin, we generate a random sequence of points $X_1,X_2,\ldots,X_i,\ldots,$. To generate $X_{i},i\geq 2$ we choose a…
In this paper, we present a novel method for constrained cluster size signed spectral clustering which allows us to subdivide large groups of people based on their relationships. In general, signed clustering only requires K hard clusters…