相关论文: On a random graph related to quantum theory

We propose a power-law $m$-uniform random hypergraph on $n$ vertexes. In this hypergraph, each vertex is independently assigned a random weight from a power-law distribution with exponent $\alpha\in(0,\infty)$ and the hyperedge…

We initiate the study of approximate quantum fractional revival in graphs, a generalization of pretty good quantum state transfer in graphs. We give a complete characterization of approximate fractional revival in a graph in terms of the…

We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…

Studying inequalities between subgraph- or homomorphism-densities is an important topic in graph theory. Sums of squares techniques have proven useful in dealing with such questions. Using an approach from real algebraic geometry, we…

This work deals with quantum transport in open quantum graphs. We consider the case of complete graphs on $n$ vertices with an edge removed and attached to two leads, to represent the entrance and exit channels, from where we calculate the…

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…

We introduce a new approach to confusability in a quantum channel, namely quantum confusability multigraph, which incorporates the output information into the graphical structure. By``counting" the edges between two vertices of this…

Vindicating a sophisticated but non-rigorous physics approach called the cavity method, we establish a formula for the mutual information in statistical inference problems induced by random graphs and we show that the mutual information…

We revisit a simple model class for machine learning on graphs, where a random walk on a graph produces a machine-readable record, and this record is processed by a deep neural network to directly make vertex-level or graph-level…

We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem.…

We identify a (pseudo) relativistic spin-dependent analogue of the celebrated quantum phase transition driven by the formation of a bright soliton in attractive one-dimensional bosonic gases. In this new scenario, due to the simultaneous…

The paper is concerned with the number of open gaps in spectra of periodic quantum graphs. The well-known conjecture by Bethe and Sommerfeld (1933) says that the number of open spectral gaps for a system periodic in more than one direction…

Random geometric graphs (RGG) can be formalized as hidden-variables models where the hidden variables are the coordinates of the nodes. Here we develop a general approach to extract the typical configurations of a generic hidden-variables…

We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…

We introduce a class of random graphs that we argue meets many of the desiderata one would demand of a model to serve as the foundation for a statistical analysis of real-world networks. The class of random graphs is defined by a…

A theorem of Hoffman gives an upper bound on the independence ratio of regular graphs in terms of the minimum $\lambda_{\min}$ of the spectrum of the adjacency matrix. To complement this result we use random eigenvectors to gain lower…

We review the understanding of the random constraint satisfaction problems, focusing on the q-coloring of large random graphs, that has been achieved using the cavity method of the physicists. We also discuss the properties of the phase…

We propose a new approach to study quantum phase transitions in low-dimensional fermionic or spin models that go from uniform to spatially inhomogeneous phases such as dimerized, trimerized, or incommensurate phases. It is based on studying…

The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…

We study the Hamiltonicity of the following model of a random graph. Suppose that we partition [n] into V_1,V_2,...,V_k and add edge {x,y} to our graph with probability p if there exists i such that x,y\in V_i. Otherwise, we add the edge…