相关论文: A switching identity for cable-graph loop soups an…
The transfer of quantum information between many-qubit states is a subject of fundamental importance in quantum science and technology. We consider entanglement swapping in critical quantum spin chains, where the entanglement between the…
Recently, Bern, Carrasco and Johansson conjectured dual identities inside the gluon tree scattering amplitudes. In this paper, we use the properties of the heterotic string and open string tree scattering amplitudes to refine and derive…
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between graph theory and quantum information, which we explore in…
Godsil-McKay switching is an operation on graphs that doesn't change the spectrum of the adjacency matrix. Usually (but not always) the obtained graph is non-isomorphic with the original graph. We present a straightforward sufficient…
The transformation of graphs and graph-like structures is ubiquitous in computer science. When a system is described by graph-transformation rules, it is often desirable that the rules are both terminating and confluent so that rule…
The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first…
We study the influence of clustering, more specifically triangles, on cascading failures in interdependent networks or systems, in which we model the dependence between comprising systems using a dependence graph. First, we propose a new…
We present here a study of the clustering and cycles in the graph of Internet at the Autonomous Systems level. We show that,even if the whole structure is changing with time, the statistical distributions of loops of order 3,4,5 remain…
We study quantum phase transitions in transverse-field Ising spin chains in which the couplings are random but hyperuniform, in the sense that their large-scale fluctuations are suppressed. We construct a one-parameter family of disorder…
In a graph, the switching operation reverses adjacencies between a subset of vertices and the others. For a hereditary graph class $\mathcal{G}$, we are concerned with the maximum subclass and the minimum superclass of $\mathcal{G}$ that…
We consider transitions in quantum networks analogous to those in the two-dimensional Ising model. We show that for a network of active components the transition is between the quantum and the classical behaviour of the network, and the…
In a previous article, we introduced the first passage set (FPS) of constant level $-a$ of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be…
We study the random-cluster model on trees and treelike graphs at low temperatures. This is a model of dependent percolation parametrized by an edge probability $p\in (0,1)$ and a clustering weight $q\in [1,\infty)$, generalizing…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
We define a large new class of conformal primary operators in the ensemble of Brownian loops in two dimensions known as the ``Brownian loop soup,'' and compute their correlation functions analytically and in closed form. The loop soup is a…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
This is the first of two papers devoted to the proof of conformal invariance of the critical double random current model on the square lattice. More precisely, we show the convergence of loop ensembles obtained by taking the cluster…
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance. This paper makes two contributions on the guessing number.…
Conditional identity in distribution (Berti et al. (2004)) is a new type of dependence for random variables, which generalizes the well-known notion of exchangeability. In this paper, a class of random sequences, called Generalized Species…
The connectivity index, defined as the number of decoupled components of a separable quantum system, can change under deformations of the Hamiltonian or during the dynamical change of the system under renormalization group flow. Such…