Related papers: Cluster Statistics of BTW Automata
The vision of automated driving is to increase both road safety and efficiency, while offering passengers a convenient travel experience. This requires that autonomous systems correctly estimate the current traffic scene and its likely…
We introduce and present preliminary results from COCOA (Cluster simulatiOn Comparison with ObservAtions) code for a star cluster after 12 Gyrs of evolution simulated using the MOCCA code. The COCOA code is being developed to quickly…
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…
We explore the utility of clustering in reducing error in various prediction tasks. Previous work has hinted at the improvement in prediction accuracy attributed to clustering algorithms if used to pre-process the data. In this work we more…
Cluster indices describe extremal behaviour of stationary time series. We consider runs estimators of cluster indices. Using a modern theory of multivariate, regularly varying time series, we obtain central limit theorems under conditions…
A small-world cellular automaton network has been formulated to simulate the long-range interactions of complex networks using unconventional computing methods in this paper. Conventional cellular automata use local updating rules. The new…
A new public conveyance model applicable to buses and trains is proposed in this paper by using stochastic cellular automaton. We have found the optimal density of vehicles, at which the average velocity becomes maximum, significantly…
We show that peculiar collective dynamics called slow switching arises in a population of leaky integrate-and-fire oscillators with delayed, all-to-all pulse-couplings. By considering the stability of cluster states and symmetry possessed…
A major challenge in cluster analysis is that the number of data clusters is mostly unknown and it must be estimated prior to clustering the observed data. In real-world applications, the observed data is often subject to heavy tailed noise…
We review some computer algorithms for the simulation of off-lattice clusters grown from a seed, with emphasis on the diffusion-limited aggregation, ballistic aggregation and Eden models. Only those methods which can be immediately extended…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
Substructure in galaxy clusters can be quantified with the robust Delta statistics (Dressler and Shectman 1988) which uses velocity kinematics and sky projected positions. We test its sensitivity using dissipationless numerical simulations…
We review recent work that investigates the formation of stellar clusters, ranging in scale from globular clusters through open clusters to the small scale aggregates of stars observed in T associations. In all cases, recent advances in…
It has recently been established that cluster-like states -- states that are in the same symmetry-protected topological phase as the cluster state -- provide a family of resource states that can be utilized for Measurement-Based Quantum…
The problem of change-point estimation is considered under a general framework where the data are generated by unknown stationary ergodic process distributions. In this context, the consistent estimation of the number of change-points is…
Timed Concurrent State Machines are an application of Alur's Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea of testing automata, allowing to specify time properties…
Updatable timed automata (UTA) are extensions of classic timed automata that allow special updates to clock variables, like x:= x - 1, x := y + 2, etc., on transitions. Reachability for UTA is undecidable in general. Various subclasses with…
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…
The cluster abundances are calculated from a quantum statistical approach taking into account in-medium corrections. For arbitrary cluster size the self-energy and Pauli blocking shifts are considered. Exploratory calculations are performed…
This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…