Related papers: Structural and computational depth of diffusion li…
Clustering high-dimensional datasets is hard because interpoint distances become less informative in high-dimensional spaces. We present a clustering algorithm that performs nonlinear dimensionality reduction and clustering jointly. The…
Dimensionality reduction and clustering techniques are frequently used to analyze complex data sets, but their results are often not easy to interpret. We consider how to support users in interpreting apparent cluster structure on scatter…
I present a first-principles theory of diffusion-limited aggregation in two dimensions. A renormalized mean-field approximation gives the form of the unstable manifold for branch competition, following the method of Halsey and Leibig [Phys.…
Laplacian growth, associated to the diffusion-limited aggregation (DLA) model or the more general dielectric-breakdown model (DBM), is a fundamental out-of-equilibrium process that generates structures with characteristic…
The intuition that a long history is required for the emergence of complexity in natural systems is formalized using the notion of depth. The depth of a system is defined in terms of the number of parallel computational steps needed to…
We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of…
The tasks of identifying separation structures and clusters in flow data are fundamental to flow visualization. Significant work has been devoted to these tasks in flow represented by vector fields, but there are unique challenges in…
The structure of the QCD gluonic cascade in configuration space is investigated. The explicit form of the inclusive single particle density in configuration space transverse coordinates is derived in the double logarithmic approximation…
Big data often has emergent structure that exists at multiple levels of abstraction, which are useful for characterizing complex interactions and dynamics of the observations. Here, we consider multiple levels of abstraction via a…
In this tutorial-style review we discuss basic concepts of coupled cluster theory and recent developments that increase its computational efficiency for calculations of molecules, solids and materials in general. We will touch upon the…
A diffusion process on complex networks is introduced in order to uncover their large scale topological structures. This is achieved by focusing on the slowest decaying diffusive modes of the network. The proposed procedure is applied to…
Clustering has been a major research topic in the field of machine learning, one to which Deep Learning has recently been applied with significant success. However, an aspect of clustering that is not addressed by existing deep clustering…
We explore a key architectural aspect of deep convolutional neural networks: the pattern of internal skip connections used to aggregate outputs of earlier layers for consumption by deeper layers. Such aggregation is critical to facilitate…
The classical method of determining the atomic structure of complex molecules by analyzing diffraction patterns is currently undergoing drastic developments. Modern techniques for producing extremely bright and coherent X-ray lasers allow a…
In this paper we examine a number of models that generate random fractals. The models are studied using the tools of computational complexity theory from the perspective of parallel computation. Diffusion limited aggregation and several…
The area of constrained clustering has been extensively explored by researchers and used by practitioners. Constrained clustering formulations exist for popular algorithms such as k-means, mixture models, and spectral clustering but have…
Cylindrical lattice diffusion limited aggregation (DLA), with a narrow width N, is solved for site-sticking conditions using a Markovian matrix method (which was previously developed for the bond-sticking case). This matrix contains the…
A recently proposed theory for diffusion-limited aggregation (DLA), which models this system as a random branched growth process, is reviewed. Like DLA, this process is stochastic, and ensemble averaging is needed in order to define…
This paper introduces a concept of layer aggregation to describe how information from previous layers can be reused to better extract features at the current layer. While DenseNet is a typical example of the layer aggregation mechanism, its…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…