Related papers: Bit threads on hypergraphs
In complex networks, many elements interact with each other in different ways. A hypergraph is a network in which group interactions occur among more than two elements. In this study, first, we propose a method to identify influential…
In this paper we focus on the problem of finding (small) subhypergraphs in a (large) hypergraph. We use this problem to illustrate that reducing hypergraph problems to graph problems by working with the 2-section is not always a reasonable…
Four lectures on holography and the AdS/CFT correspondence applied to condensed matter systems. The first lecture introduces the concept of a quantum phase transition. The second lecture discusses linear response theory and Ward identities.…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…
We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit gates are…
Properties of networks are often characterized in terms of features such as node degree distributions, average path lengths, diameters, or clustering coefficients. Here, we study shortest path length distributions. On the one hand, average…
The aim of this dissertation is to clarify the structure of entanglement, a type of quantum correlations, in various quantum systems with a large number of degrees of freedom for holography between generic quantum systems and spacetimes…
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line) and the union of all these paths is the support graph (metro…
Using holographic entanglement entropy for strip geometry, we construct a candidate for a c-function in arbitrary dimensions. For holographic theories dual to Einstein gravity, this c-function is shown to decrease monotonically along RG…
Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of frequency and connectivity and do not capture subjective…
In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits. Compilation of a quantum circuit into one compliant to such qubit connectivity constraint results in an increase of…
We propose a new holographic dual of conformal field theory defined on a manifold with boundaries, i.e. BCFT. Our proposal can apply to general boundaries and agrees with arXiv:1105.5165 for the special case of a disk and half plane. Using…
Finding dense substructures in a graph is a fundamental graph mining operation, with applications in bioinformatics, social networks, and visualization to name a few. Yet most standard formulations of this problem (like clique, quasiclique,…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
We study the entanglement entropy in 1+1 dimensional conformal field theories in the presence of interfaces from a holographic perspective. Compared with the well-known case of boundary conformal field theories, interfaces allow for several…
The entropy of a graph is an information-theoretic quantity which expresses the complexity of a graph \cite{DM1,M}. After Shannon introduced the definition of entropy to information and communication, many generalizations of the entropy…
Hypergraphs, increasingly utilised for modelling complex and diverse relationships in modern networks, gain much attention representing intricate higher-order interactions. Among various challenges, cohesive subgraph discovery is one of the…
In this paper we solve the problem of finding in a given weighted hypergraph a subhypergraph with a maximum possible density. We introduce the notion of a support matrix and prove that the density of an optimal subhypergraph is equal to…
A holographic dual description of inhomogeneous systems is discussed. Notably, finite temperature results for the entanglement entropy in both the rainbow chain and the SSD model are obtained holographically by choosing appropriate…
We study holographic entanglement entropy in spatially anisotropic field theory. We observe that for the background we consider in this paper, to a good approximation, the holographic entanglement entropy can be decomposed into two terms.…