Related papers: Characterising submonolayer deposition via visibil…
We consider the problem of estimating the probability of a large loss from a financial portfolio, where the future loss is expressed as a conditional expectation. Since the conditional expectation is intractable in most cases, one may…
We introduce an off-lattice model with continuous particle distances and pair-potential interactions which allows for the efficient simulation of strained heteroepitaxial growth by means of kinetic Monte Carlo (KMC) simulations. We discuss…
The analysis of the results of a depletion code is often considered a tedious and delicate task for it requires both the processing of large volume of information (the time dependent composition of up to thousands isomeric states) and an…
We propose a method for demonstrating sub community structure in scientific networks of relatively small size from analyzing databases of publications. Research relationships between the network members can be visualized as a graph with…
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the…
Mutual visibility in graphs provides a framework for analysing how vertices can observe one another along shortest paths free of internal obstructions. The visibility polynomial, which enumerates mutual-visibility sets of all orders, has…
Although histogram methods have been extremely effective for analyzing data from Monte Carlo simulations, they do have certain limitations, including the range over which they are valid and the difficulties of combining data from…
Deep subspace clustering (DSC) networks based on self-expressive model learn representation matrix, often implemented in terms of fully connected network, in the embedded space. After the learning is finished, representation matrix is used…
In this paper, we characterize planar point sets that can be partitioned into disjoint polygons of arbitrarily specified sizes. We provide an algorithm to construct such a partition, if it exists, in polynomial time. We show that this…
A Bayesian re-analysis of published radial velocity data sets is providing evidence for additional planetary candidates. The nonlinear model fitting is accomplished with a new hybrid Markov chain Monte Carlo (HMCMC) algorithm which…
A kinetic Monte Carlo (KMC) method is used to study the structural properties and dynamics of a supercooled binary Lennard-Jones liquid around the glass transition temperature. This technique permits us to explore the potential energy…
A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding points are visible from each other, that is, the open…
The discovery of small world and scale free properties of many real world networks has revolutionized the way we study, analyze, model and process networks. An important way to analyze these complex networks is to visualize them using graph…
K-core decomposition is a commonly used metric to analyze graph structure or study the relative importance of nodes in complex graphs. Recent years have seen rapid growth in the scale of the graph, especially in industrial settings. For…
Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph…
Particle-based kinetic Monte Carlo simulations of neutral particles is one of the major computational bottlenecks in tokamak scrape-off layer simulations. This computational cost comes from the need to resolve individual collision events in…
We present a multi-lattice kinetic Monte Carlo (kMC) approach that efficiently describes the atomistic dynamics of morphological transitions between commensurate structures at crystal surfaces. As an example we study the reduction of a…
We report on early stages of submonolayer Ag island coarsening on Ag(111) surface at room temperature ($300$ K) carried out using realistic kinetic Monte Carlo (KMC) simulations. We find that during early stages, coarsening proceeds as a…
An efficient method for the simulation of strained heteroepitaxial growth with intermixing using kinetic Monte Carlo is presented. The model used is based on a solid-on-solid bond counting formulation in which elastic effects are…
A growth model and parameters obtained in our previous experimental (scanning tunneling microscopy, KMC) and theoretical (kinetic Monte Carlo simulations, KMC) studies of Ag/Si(111)-(7x7) heteroepitaxy were used to optimise growth…