Related papers: Boundary Measurement Matrices for Directed Network…
We consider $L^q$-spectra of planar graph-directed self-affine measures generated by diagonal or anti-diagonal matrices. Assuming the directed graph is strongly connected and the system satisfies the rectangular open set condition, we…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
Using geometric landmarks like lines and planes can increase navigation accuracy and decrease map storage requirements compared to commonly-used LiDAR point cloud maps. However, landmark-based registration for applications like loop closure…
Consider the boundary $\partial \mathbb D$ of the Brownian disk $\mathbb D$ as a metric space by endowing it with the (restriction of the) metric of $\mathbb D$. We show that the uniform measure on $\partial \mathbb D$ coincides with the…
This paper proposes a simple procedure to decide whether the empirically-observed adjacency or weights matrix, which characterizes the graph underlying a socio-economic network, is sufficiently symmetric (respectively, asymmetric) to…
The Gaussian curvature of a two-dimensional Riemannian manifold is uniquely determined by the choice of the metric. The formulas for computing the curvature in terms of components of the metric, in isothermal coordinates, involve the…
Given only a collection of points sampled from a Riemannian manifold embedded in a Euclidean space, in this paper we propose a new method to solve elliptic partial differential equations (PDEs) supplemented with boundary conditions. Notice…
We define two generalizations of the totally nonnegative Grassmannian and determine their topology in the case of real projective space. We find the spaces to be PL manifolds with boundary which are homotopy equivalent to another real…
In this paper, we will construct formulas and bounds for Neighborhood Degree-based indices of graphs and describe graphs that attain the bounds. Furthermore, we will establish a lower bound for the spectral radius of any graph.
For Paley-Wiener functions on weighted combinatorial finite or infinite graphs we develop a weighted sampling theory in which samples are defined as inner products with weight functions (measuring devices). Three reconstruction methods are…
The diameter of a graph is among its most basic parameters. Since a few years, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones…
We describe an efficient algorithm to compute a conformally equivalent metric for a discrete surface, possibly with boundary, exhibiting prescribed Gaussian curvature at all interior vertices and prescribed geodesic curvature along the…
Postnikov gave a parametrization for the totally non-negative Grassmannian using the matroid decomposition and associating a network with \reflectbox{L}-diagrams. Talaska and Williams extend this result to the entire Grassmannian by using…
A new measure to assess the centrality of vertices in an undirected and connected graph is proposed. The proposed measure, L1 centrality, can adequately handle graphs with weights assigned to vertices and edges. The study provides tools for…
Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…
We provide general formulae for the configurational exponents of an arbitrary polymer network connected to the surface of an arbitrary wedge of the two-dimensional plane, where the surface is allowed to assume a general mixture of boundary…
Here we study what we call bounded rough Riemannian metrics $(M,g)$, which are positive definite, symmetric tensors on each tangent space, $T_pM$, which are bounded and measurable as functions in coordinates. This is enough structure to…
We study the image of $\textrm{SU}(n)$ under the diagonal product map. Using only elementary tools of linear algebra, analysis and general topology, we find the analytical formula for the boundary of this image and find all special unitary…
In this paper, we defined three kinds of measures depending on the given finite directed graphs. For the given finite directed graph, we can construct the free semigroupoid, the diagram set and the reduced diagram set, as algebraic…
In graph signal processing, many studies assume that the underlying network is undirected. Although the digraph model is rarely adopted, it is more appropriate for many applications, especially for real world networks. In this paper, we…