相关论文: The Exclusivity Principle Determines the Correlati…

Unlike classical correlation, quantum entanglement cannot be freely shared among many parties. This restricted shareability of entanglement among multi-party systems is known as monogamy of entanglement, which is one of the most fundamental…

We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a trivial case added for completeness), all sets with minimum 3 that contain an…

A set of graphs is said to be independent if there is no homomorphism between distinct graphs from the set. We consider the existence problems related to the independent sets of countable graphs. While the maximal size of an independent set…

We consider sparse inhomogeneous Erd\H{o}s-R\'enyi random graph ensembles where edges are connected independently with probability $p_{ij}$. We assume that $p_{ij}= \varepsilon_N f(w_i, w_j)$ where $(w_i)_{i\ge 1}$ is a sequence of…

For a graph $G$ let $\gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$\mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a…

Let $F_G(P)$ be a functional defined on the set of all the probability distributions on the vertex set of a graph $G$. We say that $G$ is \emph{symmetric with respect to $F_G(P)$} if the uniform distribution on $V(G)$ maximizes $F_G(P)$.…

Differently from correlation of classical systems, entanglement of quantum systems cannot be distributed at will - if one system A is maximally entangled with another system B, it cannot be entangled at all to a third system C. This…

Graphical models provide a framework for exploration of multivariate dependence patterns. The connection between graph and statistical model is made by identifying the vertices of the graph with the observed variables and translating the…

We investigate monogamy relations and upper bounds for generalized $W$-class states related to the R\'{e}nyi-$\alpha$ entropy. First, we present an analytical formula on R\'{e}nyi-$\alpha$ entanglement (R$\alpha$E) and R\'{e}nyi-$\alpha$…

We study property testing in the \emph{random neighbor oracle} model for graphs, originally introduced by Czumaj and Sohler [STOC 2019]. Specifically, we initiate the study of characterizing the graph families that are $H$-\emph{testable}…

The limitation on the shareability of quantum entanglement over several parties, the so-called monogamy of entanglement, is an issue that has caught considerable attention of quantum informa- tion community over the last decade. A natural…

Two important results of quantum physics are the \textit{no-cloning} theorem and the \textit{monogamy of entanglement}. The former forbids the creation of an independent and identical copy of an arbitrary unknown quantum state and the…

We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…

A biologically motivated individual-based framework for evolution in network-structured populations is developed that can accommodate eco-evolutionary dynamics. This framework is used to construct a network birth and death model. The…

Unlike classical correlations, entanglement cannot be freely shared among multiple parties. This unique feature of quantum systems is known as the monogamy of entanglement. While it holds for all multipartite pure states, its converse --…

Monogamy of entanglement means that an entangled state cannot be shared with many parties. The more parties, the less entanglement between them. In this paper, we give a simple proof of this property and provide an upper bound of the number…

In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for…

We consider events over the probability space generated by the degree sequences of multiple independent Erd\H{o}s-R\'enyi random graphs, and consider an approximation probability space where such degree sequences are deemed to be sequences…

In this paper, we study the independence polynomial $P_G(x)$ of a finite simple graph $G$, with emphasis on the evaluation at $x=-1$, symmetry, and its connection with the $h$-polynomial of the edge ideal of $G$. For big star graphs, we…

In this paper we consider a natural extremal graph theoretic problem of topological sort, concerning the minimization of the (topological) connectedness of the independence complex of graphs in terms of its dimension. We observe that the…