Related papers: Graphs that predict exciton delocalization
Hypergraph states are multiqubit states whose combinatorial description and entanglement properties generalize the well-studied class of graph states. Graph states are important in applications such as measurement-based quantum computation…
Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…
Interacting particles on graphs are routinely used to study magnetic behaviour in physics, disease spread in epidemiology, and opinion dynamics in social sciences. The literature on mean-field approximations of such systems for large graphs…
We demonstrate strong coupling between molecular excited states and surface plasmon modes of a slit array in a thin metal film. The coupling manifests itself as an anti-crossing behavior of the two newly formed polaritons. As the coupling…
In this paper, the problem of matching pairs of correlated random graphs with multi-valued edge attributes is considered. Graph matching problems of this nature arise in several settings of practical interest including social network…
The apparent disconnection between the microscopic and the macroscopic is a major issue in the understanding of complex systems. To this extend, we study the convergence of repeatedly applying local rules on a network, and touch on the…
A theory of the separation of a system of indirect excitons into a condensed and a gaseous phases with the formation of regular patterns of alternating phases in inhomogeneous external fields is developed. The theory is applied to the study…
We present a fragment-based framework for analyzing exciton couplings within the $GW$-Bethe-Salpeter Equation formalism using localized molecular orbitals, and assess how excitonic states in molecular dimers can be decomposed into local and…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…
Large graphs can be found in a wide array of scientific fields ranging from sociology and biology to scientometrics and computer science. Their analysis is by no means a trivial task due to their sheer size and complex structure. Such…
We present multiscale graph-based reduction algorithms for upscaling heterogeneous and anisotropic diffusion problems. The proposed coarsening approaches begin by constructing a partitioning of the computational domain into a set of…
In this paper we address the graph matching problem. Following the recent works of \cite{zaslavskiy2009path,Vestner2017} we analyze and generalize the idea of concave relaxations. We introduce the concepts of conditionally concave and…
Despite the wide application of Graph Convolutional Network (GCN), one major limitation is that it does not benefit from the increasing depth and suffers from the oversmoothing problem. In this work, we first characterize this phenomenon…
The exponential family of random graphs has been a topic of continued research interest. Despite the relative simplicity, these models capture a variety of interesting features displayed by large-scale networks and allow us to better…
Biomolecular networks have already found great utility in characterizing complex biological systems arising from pair-wise interactions amongst biomolecules. Here, we review how graph theoretical approaches can be applied not only for a…
We suggest an enhancement to structural coding through the use of (a) causally bound codes, (b) basic constructs of graph theory and (c) statistics. As is the norm with structural coding, the codes are collected into categories. The…
We consider long-range correlated disorder and mutual interacting particles according to a dipole-dipole coupling as modifications to the one-dimensional Anderson model. Technically we rely on the (numerical) exact diagonalization of the…
Graph dynamics arise naturally in many contexts. For instance in peer-to-peer networks, a participating peer may replace an existing connection with one neighbour by a new connection with a neighbour's neighbour. Several such local rewiring…
In this paper we propose a class of prior distributions on decomposable graphs, allowing for improved modeling flexibility. While existing methods solely penalize the number of edges, the proposed work empowers practitioners to control…