Related papers: Characterising submonolayer deposition via visibil…
We present a lattice-gas (generalised Ising) model for liquid droplets on solid surfaces. The time evolution in the model involves two processes: (i) Single-particle moves which are determined by a kinetic Monte Carlo algorithm. These…
Multivariate time series analysis is a vital but challenging task, with multidisciplinary applicability, tackling the characterization of multiple interconnected variables over time and their dependencies. Traditional methodologies often…
We investigate the kinetics of submonolayer epitaxial growth which is driven by a fixed flux of monomers onto a substrate. Adatoms diffuse on the surface, leading to irreversible aggregation of islands. We also account for the effective…
This paper proposes a method for computing the visible occluding contours of subdivision surfaces. The paper first introduces new theory for contour visibility of smooth surfaces. Necessary and sufficient conditions are introduced for when…
We present an algorithm for graph based saliency computation that utilizes the underlying dense subgraphs in finding visually salient regions in an image. To compute the salient regions, the model first obtains a saliency map using random…
Nested Monte Carlo is widely used for risk estimation, but its efficiency is limited by the discontinuity of the indicator function and high computational cost. This paper proposes a nested Multilevel Monte Carlo (MLMC) method combined with…
The overview-driven visual analysis of large-scale dynamic graphs poses a major challenge. We propose Multiscale Snapshots, a visual analytics approach to analyze temporal summaries of dynamic graphs at multiple temporal scales. First, we…
Structural and kinetic aspects of 2-D irreversible metal deposition under potentiostatic conditions are analyzed by means of dynamic Monte Carlo simulations employing embedded atom potentials for a model system. Three limiting models, all…
Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network…
The Monte Carlo (MC) Hamiltonian is a new stochastic method to solve many-body problems. The MC Hamiltonian represents an effective Hamiltonian in a finite energy window. We construct it from the classical action via Monte Carlo with…
Mutual visibility in graphs requires pairs of vertices to be connected by shortest paths that avoid all other vertices of a prescribed set, a condition that is often overly restrictive. In this paper, we introduce a new variant, called…
We develop a novel parallel decomposition strategy for unweighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect to similar previous…
In any valid Monte Carlo sampling that realizes microcanonical property we can collect statistics for a transition matrix in energy. This matrix is used to determine the density of states, from which most of the thermodynamical averages can…
Decomposing hypergraphs is a key task in hypergraph analysis with broad applications in community detection, pattern discovery, and task scheduling. Existing approaches such as $k$-core and neighbor-$k$-core rely on vertex degree…
Visual rendering of graphs is a key task in the mapping of complex network data. Although most graph drawing algorithms emphasize aesthetic appeal, certain applications such as travel-time maps place more importance on visualization of…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
The monography presents a new algorithm for finding the clique of maximal length in a nonseparable graph. The algorithm is based on the properties of the representation of a clique as a subset of the set of cycles with a length of three,…
A massively parallel kinetic Monte Carlo (kMC) approach is proposed for simulating ionic migration in a crystal system by introducing the atomic fragmentation scheme (fragment kMC). The fragment kMC method achieved a reasonable parallel…
We investigate submonolayer epitaxial growth with a fixed monomer flux and irreversible aggregation of adatom islands due to their effective diffusion. When the diffusivity D_k of an island of mass k is proportional to k^{-\mu}, a…
We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by…