Related papers: Reconstructing biochemical cluster networks
We study the mechanism of formation of synchronized clusters in coupled maps on networks with various connection architectures. The nodes in a cluster are self- synchronized or driven-synchronized, based on the coupling strength and…
This work exploits a framework whereby a graph (in the mathematical sense) serves to connect a classical system to a state space that we call `quantum-like' (QL). The QL states comprise arbitrary superpositions of states in a tensor product…
A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretization (vertex…
Quantum cluster states and entangled state analyzers are essential to measurement-based quantum computing. We propose to generate a quantum cluster-state and to make multipartite entanglement analyzer by using noninteracting free electrons…
We analyze the asymptotic states in the partially ordered phase of a system of globally coupled logistic maps. We confirm that, regardless of initial conditions, these states consist of a few clusters, and they properly belong in the…
The linear optical creation of Gaussian cluster states, a potential resource for universal quantum computation, is investigated. We show that for any Gaussian cluster state, the canonical generation scheme in terms of QND-type interactions,…
Most work on causality in machine learning assumes that causal relationships are driven by a constant underlying process. However, the flexibility of agents' actions or tipping points in the environmental process can change the qualitative…
Cluster states, a type of highly entangled state, are essential resources for quantum information processing. Here we demonstrated the generation of a time-domain linear cluster state (t-LCS) using a superconducting quantum circuit…
We introduce and study systems of randomly coupled maps (RCM) where the relevant parameter is the degree of connectivity in the system. Global (almost-) synchronized states are found (equivalent to the synchronization observed in globally…
We study binomiality of the steady state ideals of chemical reaction networks. Considering rate constants as indeterminates, the concept of unconditional binomiality has been introduced and an algorithm based on linear algebra has been…
In this paper we study formulations and algorithms for the cycle clustering problem, a partitioning problem over the vertex set of a directed graph with nonnegative arc weights that is used to identify cyclic behavior in simulation data…
Graph clustering is a central topic in unsupervised learning with a multitude of practical applications. In recent years, multi-view graph clustering has gained a lot of attention for its applicability to real-world instances where one has…
A panoply of multi-view clustering algorithms has been developed to deal with prevalent multi-view data. Among them, spectral clustering-based methods have drawn much attention and demonstrated promising results recently. Despite progress,…
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable…
This work provides a quantum-computing-first derivation of the Unitary Coupled Cluster ansatz, showing that its structure emerges naturally from fermionic algebra under unitary constraints. By explicitly connecting second quantization,…
Graph-based clustering has shown promising performance in many tasks. A key step of graph-based approach is the similarity graph construction. In general, learning graph in kernel space can enhance clustering accuracy due to the…
We consider a reaction-diffusion model incorporating the reactions A -> 0, A -> 2A and 2A -> 3A. Depending on the relative rates for sexual and asexual reproduction of the quantity A, the model exhibits either a continuous or first-order…
The one-dimensional contact process is analyzed by a cluster approximation. In this approach, the hierarchy of rate equations for the densities of finite length empty intervals are truncated under the assumption that adjacent intervals are…
The motion of electrons and nuclei in photochemical events often involve conical intersections, degeneracies between electronic states. They serve as funnels for nuclear relaxation - on the femtosecond scale - in processes where the…
The role of saturation for cluster formation in finite systems such as atomic nuclei is analyzed by considering three length-scale ratios, and performing deformation-constrained self-consistent mean-field calculations. The effect of…