Related papers: Characterising submonolayer deposition via visibil…
Massive networks have shown that the determination of dense subgraphs, where vertices interact a lot, is necessary in order to visualize groups of common interest, and therefore be able to decompose a big graph into smaller structures. Many…
We present a model for thin film growth by particle deposition that takes into account the possible evaporation of the particles deposited on the surface. Our model focuses on the formation of two-dimensional structures. We find that the…
A two-state-model consisting of hexagonally connected lipids being either in the ordered or disordered state is used to set up a Monte Carlo Simulation for lipid monolayers. The connection of the lipids is realized by Newtonian springs…
Two-component submonolayer growth on triangular lattice is qualitatively studied by kinetic Monte Carlo techniques. The hopping barrier governing surface diffusion of the atoms is estimated with an improved formula and using realistic pair…
We introduce a sequential model for the deposition and aggregation of particles in the submonolayer regime. Once a particle has been randomly deposited on the substrate, it sticks to the closest atom or island within a distance \ell,…
Graph-based subspace clustering methods have exhibited promising performance. However, they still suffer some of these drawbacks: encounter the expensive time overhead, fail in exploring the explicit clusters, and cannot generalize to…
A high-fidelity kinetic Monte Carlo (KMC) simulation method (T. Treeratanaphitak, M. Pritzker, N. M. Abukhdeir, Electrochim. Acta 121 (2014) 407--414) using the semi-empirical multi-body embedded-atom method (EAM) potential has been…
We consider the influence of realistic island diffusion rates to homoepitaxial growth on metallic surfaces using a recently developed rate equation model which describes growth in the submonolayer regime with hyperthermal deposition. To…
Isosurface visualization is fundamental for exploring and analyzing 3D volumetric data. Marching cubes (MC) algorithms with linear interpolation are commonly used for isosurface extraction and visualization. Although linear interpolation is…
Artifacts arise in the simulations of electrolytes using periodic boundary conditions (PBC). We show the origin of these artifacts are the periodic image charges and the constraint of charge neutrality inside the simulation box, both of…
We introduce a `virtual-move' Monte Carlo (VMMC) algorithm for systems of pairwise-interacting particles. This algorithm facilitates the simulation of particles possessing attractions of short range and arbitrary strength and geometry, an…
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique,…
We review quantum Monte Carlo methods for dealing with large shell model problems. These methods reduce the imaginary-time many-body evolution operator to a coherent superposition of one-body evolutions in fluctuating one-body fields; the…
In this work, we describe a method that determines an exact map from a finite set of subgraph densities to the parameters of a stochastic block model (SBM) matching these densities. Given a number $K$ of blocks, the subgraph densities of a…
We studied self-diffusion of small 2D Ni islands (consisting of up to 10 atoms) on Ni (111) surface using a self-learning kinetic Monte Carlo (SLKMC-II) method with an improved pattern-recognition scheme that allows inclusion of both fcc…
We present a light and fast, public available, ray-tracer {\tt Splotch} software tool which supports the effective visualization of cosmological simulations data. We describe the algorithm it relies on, which is designed in order to deal…
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common…
Epitaxial growth via chemical vapor deposition is considered to be the most promising way towards synthesizing large area graphene with high quality. However, it remains a big theoretical challenge to reveal growth kinetics with atomically…
The visibility graph of a simple polygon represents visibility relations between its vertices. Knowing the correct order of the vertices around the boundary of a polygon and its visibility graph, it is an open problem to locate the vertices…
In relational DBMS, window functions have been widely used to facilitate data analytics. Surprisingly, while similar concepts have been employed for graph analytics, there has been no explicit notions of graph window analytic functions. In…