Related papers: Potential Theory on Trees, Graphs and Ahlfors Regu…
We propose a possible relation between complex networks and gravity. Our guide in our proposal is the power-law distribution of the node degree in network theory and the information approach to gravity. The established bridge may allow us…
We propose the following model of a random graph on n vertices. Let F be a distribution in R_+^{n(n-1)/2} with a coordinate for every pair i$ with 1 \le i,j \le n. Then G_{F,p} is the distribution on graphs with n vertices obtained by…
This thesis covers several developments performed in metric-affine gravity. This alternative framework extends General Relativity by considering a more general connection than the one induced by the metric (i.e., arbitrary torsion and…
We discuss scalar field theories with potentials V({\phi})=\k{appa}({\phi}^2)^{{\nu}} for generic {\nu}. We conjecture that these models evade various no-go theorems for scalar fields in four spacetime dimensions.
We expand the results of arXiv:1105.5165, where a holographic description of a conformal field theory defined on a manifold with boundaries (so called BCFT) was proposed, based on AdS/CFT. We construct gravity duals of conformal field…
We prove a general width duality theorem for combinatorial structures with well-defined notions of cohesion and separation. These might be graphs and matroids, but can be much more general or quite different. The theorem asserts a duality…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…
Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian…
The connection between contextuality and graph theory has led to many developments in the field. In particular, the sets of probability distributions in many contextuality scenarios can be described using well known convex sets from graph…
For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{i}$ the degree of vertex $v_{i}$. Let $f(x, y)>0$ be a real symmetric function in $x$ and $y$. The weighted adjacency matrix $A_{f}(G)$ of a graph $G$ is a square matrix, where the…
Properties of steady compressible flow for which geometric constraints have been placed on the potential function are derived, under hypotheses on the flow density and the singular set. Some related unconstrained problems are also…
A graph $H^{\prime}$ is $(H, G)$-saturated if it is $G$-free and the addition of any edge of $H$ not in $H^{\prime}$ creates a copy of $G$. The saturation number $sat(H, G)$ is the minimum number of edges in a $(H, G)$-saturated graph. We…
Fixed parameter tractable (FPT) algorithms run in time f(p(x)) poly(|x|), where f is an arbitrary function of some parameter p of the input x and poly is some polynomial function. Treewidth, branchwidth, cliquewidth, NLC-width, rankwidth,…
For any graph $G$, let $t(G)$ be the number of spanning trees of $G$, $L(G)$ be the line graph of $G$ and for any non-negative integer $r$, $S_r(G)$ be the graph obtained from $G$ by replacing each edge $e$ by a path of length $r+1$…
Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…
We study the family of network models derived by requiring the expected properties of a graph ensemble to match a given set of measurements of a real-world network, while maximizing the entropy of the ensemble. Models of this type play the…
Many interesting problems are obtained by attempting to generalize classical results on convexity in Euclidean spaces to other convexity spaces, in particular to convexity spaces on graphs. In this paper we consider $P_3$-convexity on…
A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the unnormalized distances. Here we investigate the limits of the…
We analyze the brane content and charges in all of the orientifold string theories on space-times of the form E x R^8, where E is an elliptic curve with holomorphic or anti-holomorphic involution. Many of these theories involve "twistings"…
A new method is proposed for analyzing complexity and studying the information in random geometric networks using Tsallis entropy tool. Tsallis entropy of the ensemble of random geometric networks is calculated based on the components of…