Related papers: Boundary Measurement Matrices for Directed Network…
We establish mathematical bounds on the chain, ABCD and immittance matrices of a multiconductor transmission line, based on the Telegrapher's equation. Closed-form expressions for those matrices are also presented. Existing results that…
The degree of the Grassmannian with respect to the Pl\"ucker embedding is well-known. However, the Pl\"ucker embedding, while ubiquitous in pure mathematics, is almost never used in applied mathematics. In applied mathematics, the…
Let $G$ be a connected graph. Given an ordered set $W = \{w_1, w_2,\dots w_k\}\subseteq V(G)$ and a vertex $u\in V(G)$, the representation of $u$ with respect to $W$ is the ordered $k$-tuple $(d(u,w_1), d(u,w_2),\dots,$ $d(u,w_k))$, where…
We define a weighted multiplicity function for closed geodesics of given length on a finite area Riemann surface. These weighted multiplicities appear naturally in the Selberg trace formula, and in particular their mean square plays an…
In this thesis, the main objects of study are probability measures on the isomorphism classes of countable, connected rooted graphs. An important class of such measures is formed by unimodular measures, which satisfy a certain equation,…
We consider the Calder\'on problem with partial data in certain admissible geometries, that is, on compact Riemannian manifolds with boundary which are conformally embedded in a product of the Euclidean line and a simple manifold. We show…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We have recently introduced Forman's discretization of Ricci curvature to the realm of complex networks. Forman curvature is an edge-based measure whose mathematical definition elegantly encapsulates the weights of nodes and edges in a…
The existence of kinematic formulas for area measures with respect to any connected, closed subgroup of the orthogonal group acting transitively on the unit sphere is established. In particular, the kinematic operator for area measures is…
The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…
Directed mixed graphs permit directed and bidirected edges between any two vertices. They were first considered in the path analysis developed by Sewall Wright and play an essential role in statistical modeling. We introduce a matrix…
Kemeny's constant quantifies a graph's connectivity by measuring the average time for a random walker to reach any other vertex. We introduce two concepts of the directional derivative of Kemeny's constant with respect to an edge and use…
A graphon is a limiting object used to describe the behaviour of large networks through a function that captures the probability of edge formation between nodes. Although the merits of graphons to describe large and unlabelled networks are…
We consider an embedding of planar maps into an equilateral triangle $\Delta$ which we call the Cardy embedding. The embedding is a discrete approximation of a conformal map based on percolation observables that are used in Smirnov's proof…
We define multideterminantal probability measures, a family of probability measures on $[k]^n$ where $[k]=\{1,2,\dots,k\}$, generalizing determinantal measures (which correspond to the case $k=2$). We give examples coming from the positive…
This work studies certain aspects of graphs embedded on surfaces. Initially, a colored graph model for a map of a graph on a surface is developed. Then, a concept analogous to (and extending) planar graph is introduced in the same spirit as…
We have characterized the structure of 176 different single-layer graphene grain boundaries using $>$1000 experimental HRTEM images using a semi-automated structure processing routine. We introduce a new algorithm for generating grain…
In this article we derive an explicit diameter bound for graphs satisfying the so-called curvature dimension conditions $CD(K,n)$. This refines a recent result due to Liu, M\"unch and Peyerimhoff when the dimension $n$ is finite.
The magnetic Dirichlet-to-Neumann map encodes the voltage-to-current measurements under the influence of a magnetic field. In the case of surfaces, we provide precise spectral asymptotics expansion (up to arbitrary polynomial power) for the…