相关论文: Bounding the joint numerical range of Pauli string…
The gravitational wave (GW) signals emitted by a network of cosmic strings are reexamined in view of the possible formation of a network of cosmic superstrings at the end of brane inflation. The reconnection probability $p$ of intersecting…
We introduce a new string-inspired approach to the subject of grand unification which allows the GUT scale to be small, \lesssim 200 TeV, so that it is within the reach of {\em conceivable} laboratory accelerated colliding beam devices. The…
Graphs are fundamental mathematical structures used in various fields to represent data, signals and processes. In this paper, we propose a novel framework for learning/estimating graphs from data. The proposed framework includes (i)…
For a square matrix, the range of its Rayleigh quotients is known as the numerical range, which is a compact and convex set by the Toeplitz-Hausdorff theorem. The largest value and the smallest boundary value (in magnitude) of this convex…
The state of a system in classical mechanics can be uniquely reconstructed if we know the positions and the momenta of all its parts. In 1958 Pauli has conjectured that the same holds for quantum mechanical systems. The conjecture turned…
The topology and geometry of random fields - in terms of the Euler characteristic and the Minkowski functionals - has received a lot of attention in the context of the Cosmic Microwave Background (CMB), as the detection of primordial…
For a given graph $H$, its subdivisions carry the same topological structure. The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of…
In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…
We consider Catalan-pair graphs, a family of graphs that can be viewed as representing certain interactions between pairs of objects which are enumerated by the Catalan numbers. In this paper we study random Catalan-pair graphs and deduce…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
A growing set of on-line applications are generating data that can be viewed as very large collections of small, dense social graphs -- these range from sets of social groups, events, or collaboration projects to the vast collection of…
The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…
A complex unit gain graph (or $\mathbb{T}$-gain graph) is a triple $\Phi=(G, \mathbb{T}, \varphi)$ ($(G, \varphi)$ for short) consisting of a graph $G$ as the underlying graph of $(G, \varphi)$, $\mathbb{T}= \{ z \in C:|z|=1 \} $ is a…
A well-defined distance on the parameter space is key to evaluating estimators, ensuring consistency, and building confidence sets. While there are typically standard distances to adopt in a continuous space, this is not the case for…
We examine the metrics that arise when a finite set of points is embedded in the real line, in such a way that the distance between each pair of points is at least 1. These metrics are closely related to some other known metrics in the…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
Beginning in abstract space and dislodging the representational form paves a way to formulate a version of a quantum physical measurement scheme. With materiality playing sustainment roles with respect to q-states, these latter control…
In this work, we study the problem of computing a maximum common contraction of two vertex-labeled graphs, i.e. how to make them identical by contracting as little edges as possible in the two graphs. We study the problem from a…
We analyze composed quantum systems consisting of $k$ subsystems, each described by states in the $n$-dimensional Hilbert space. Interaction between subsystems can be represented by a graph, with vertices corresponding to individual…