Related papers: Structural and computational depth of diffusion li…
A complex network approach on a rough fracture is developed. In this manner, some hidden metric spaces (similarity measurements) between apertures profiles are set up and a general evolutionary network in two directions (in parallel and…
Since its foundations, more than one hundred years ago, the field of structural biology has strived to understand and analyze the properties of molecules and their interactions by studying the structure that they take in 3D space. However,…
Using off-lattice noise reduction it is possible to estimate the asymptotic properties of diffusion-limited aggregation clusters grown in three dimensions with greater accuracy than would otherwise be possible. The fractal dimension of…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
This work presents an unsupervised deep discriminant analysis for clustering. The method is based on deep neural networks and aims to minimize the intra-cluster discrepancy and maximize the inter-cluster discrepancy in an unsupervised…
This is a tutorial and survey paper for nonlinear dimensionality and feature extraction methods which are based on the Laplacian of graph of data. We first introduce adjacency matrix, definition of Laplacian matrix, and the interpretation…
Convolutional networks are at the center of best-in-class computer vision applications for a wide assortment of undertakings. Since 2014, a profound amount of work began to make better convolutional architectures, yielding generous…
When plane waves diffract through fractal-patterned apertures, the resulting far-field profiles or diffractals also exhibit iterated, self-similar features. Here we show that this specific architecture enables robust signal processing and…
In the present note we analyze the one-dimensional multi-particle diffusion limited aggregation (MDLA) model: the initial number of particles at each positive integer site has Poisson distribution with mean $\mu$, independently of all other…
We consider a stochastic aggregation model on Z^d. Start with particles located at the vertices of the lattice, initially distributed according to the product Bernoulli measure with parameter \mu. In addition, there is an aggregate, which…
We propose a revision of the classic mean-field approach of diffusion-limited aggregation (DLA) model originally introduced by Witten and Sander [Phys. Rev. Lett. 47, 1400 (1981)]. The derived nonlinear mean-field equations providing…
The Internal Diffusion Limited Aggregation has been introduced by Diaconis and Fulton in 1991. It is a growth model defined on an infinite set and associated to a Markov chain on this set. We focus here on sets which are finitely generated…
We discuss topological aspects of cluster analysis and show that inferring the topological structure of a dataset before clustering it can considerably enhance cluster detection: theoretical arguments and empirical evidence show that…
Traditional clustering methods often perform clustering with low-level indiscriminative representations and ignore relationships between patterns, resulting in slight achievements in the era of deep learning. To handle this problem, we…
In many modern applications, there is interest in analyzing enormous data sets that cannot be easily moved across computers or loaded into memory on a single computer. In such settings, it is very common to be interested in clustering.…
Using stochastic conformal mapping techniques we study the patterns emerging from Laplacian growth with a power-law decaying threshold for growth $R_N^{-\gamma}$ (where $R_N$ is the radius of the $N-$ particle cluster). For $\gamma > 1$ the…
A new depth-based clustering procedure for directional data is proposed. Such method is fully non-parametric and has the advantages to be flexible and applicable even in high dimensions when a suitable notion of depth is adopted. The…
Clustering is a widely used technique in data mining applications for discovering patterns in underlying data. Most traditional clustering algorithms are limited to handling datasets that contain either numeric or categorical attributes.…
Deep generative models have made rapid progress in image, text, audio, and video generation, and are increasingly being applied to structured records. For tabular data, however, generative modeling remains difficult: a dataset may contain…
Distributed aggregation allows the derivation of a given global aggregate property from many individual local values in nodes of an interconnected network system. Simple aggregates such as minima/maxima, counts, sums and averages have been…