Related papers: Graph Reconstruction and Quantum Statistical Mecha…
Understanding the large-scale physics is crucial for the spin foam approach to quantum gravity. We tackle this challenge from a statistical physics perspective using simplified, yet feature-rich models. In particular, this allows us to…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
Let $a, b$ and $n$ be nonnegative integers $(b \geq a, \ b > 0, \ n \geq 1)$, $\mathcal{G}_n(a,b)$ be a multigraph on $n$ vertices in which any pair of vertices is connected with at least $a$ and at most $b$ edges and \textbf{v =} $(v_1,…
We provide the first approximation quality guarantees for the Cuthull-McKee heuristic for reordering symmetric matrices to have low bandwidth, and we provide an algorithm for reconstructing bounded-bandwidth graphs from distance oracles…
Curve reconstruction from unstructured points in a plane is a fundamental problem with many applications that has generated research interest for decades. Involved aspects like handling open, sharp, multiple and non-manifold outlines,…
The edge-reconstruction number of graph $G$, denoted $ern(G)$,is the size of the smallest multiset of edge-deleted, unlabeled subgraphs of $G$, from which the structure of $G$ can be uniquely determined. That there was some connection…
We construct a locally finite graph and a bounded geometry metric space which do not admit a quasi-isometric embedding into any uniformly convex Banach space. Connections with the geometry of $c_0$ and superreflexivity are discussed.
The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges…
In this paper, we discuss a refinement of quantum data processing inequality for the sandwiched quasi-relative entropy $\mathcal{S}_2$ on a tracial von-Neumann algebra. The main result is a universal recoverability bound with the Petz…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
The Lipschitz space of an infinite (locally-finite) graph is defined as the set of functions on the vertices of the graph such that the differences of the values between adjacent vertices remain bounded. In this paper we prove that this set…
The degree-constrained subgraph problem asks for a subgraph of a given graph such that the degree of each vertex is within some specified bounds. We study the following reconfiguration variant of this problem: Given two solutions to a…
The Harary reconstruction conjecture states that any graph with more than four edges can be uniquely reconstructed from its set of maximal edge-deleted subgraphs. In 1977, M\"uller verified the conjecture for graphs with $n$ vertices and $n…
In the Graph Reconstruction (GR) problem, the goal is to recover a hidden graph by utilizing some oracle that provides limited access to the structure of the graph. The interest is in characterizing how strong different oracles are when the…
In canonical quantum gravity, the presence of spatial boundaries naturally leads to a boundary quantum states, representing quantum boundary conditions for the bulk fields. As a consequence, quantum states of the bulk geometry needs to be…
In this paper we extend M. Lyubich's recent results on the global hyperbolicity of renormalization of quadratic-like germs to the space of C^r unimodal maps with quadratic critical point. We show that in this space the bounded-type limit…
Classical graph algorithms work well for combinatorial problems that can be thoroughly formalized and abstracted. Once the algorithm is derived, it generalizes to instances of any size. However, developing an algorithm that handles complex…
The objective of this paper is to introduce the notion of generalized almost statistical (briefly, GAS) convergence of bounded real sequences, which generalizes the notion of almost convergence as well as statistical convergence of bounded…
In this dissertation I establish that a broad class of Banach *-algebras of infinite integral operators, defined by the property that the kernels of the elements of the algebras possess subexponential off-diagonal decay, is inverse closed…
We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators by means of self-ortho-gonal subspaces. By orthogonality…