Related papers: Weighted prime geodesic theorems
We provide a selected overview of methodology and theory for estimation and inference on the edge weights in high-dimensional directed and undirected Gaussian graphical models. For undirected graphical models, two main explicit…
In this note we extend the concept height on projective spaces to that of weighted height on weighted projective spaces and show how such a height can be computed. We prove some of the basic properties of the weighted height and show how it…
Mathematical methods of analysis of data and of predicting growth are discussed. The starting point is the analysis of the growth rates, which can be expressed as a function of time or as a function of the size of the growing entity.…
The evolution operator for states of gauge theories in the graph representation (closely related to the loop representation of Gambini and Trias, and Rovelli and Smolin) is formulated as a weighted sum over worldsheets interpolating between…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to vertex weighted rooted forests and oriented cycles. As some consequences, we give some exact formulas for the depth of…
We give exact formulas for the transmission (i.e. the sum of all distances between vertices) of perfect trees and rooted powers of (connected finite) graphs.
Chung-Langlands established a matrix-tree theorem for positive-real valued vertex-weighted graphs, and Wu-Feng-Sato developed a theory of Ihara zeta functions for those graphs. In this paper, generalizing and refining these previous works,…
Many real systems possess accelerating statistics where the total number of edges grows faster than the network size. In this paper, we propose a simple weighted network model with accelerating growth. We derive analytical expressions for…
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density. Our results imply several new bounds for classical problems in graph Ramsey theory and improve…
In this note we give exact formulas (and asymptotics) for the number of rational points of bounded height on weighted projective stacks over global function fields.
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
We present a careful approximation of the geodesics in trees of hyperbolic or relatively hyperbolic groups. As an application we prove a combination theorem for finite graphs of relatively hyperbolic groups, with both Farb's and Gromov's…
We study the undirected divisibility graph in which the vertex set is a finite subset of consecutive natural numbers up to N.We derive analytical expressions for measures of the graph like degree, clustering, geodesic distance and…
In this paper, we derive cumulant bounds for subgraph counts and power-weighted edge length in a class of spatial random networks known as weighted random connection models. This involves dealing with long-range spatial correlations induced…
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Let $A$ be a subset of positive relative upper density of $\PP^d$, the $d$-tuples of primes. We prove that $A$ contains an affine copy of any finite set $F\subs\Z^d$, which provides a natural multi-dimensional extension of the theorem of…
This survey on graphs of large girth consists of two parts. The first deals with some aspects of algebraic and extremal graph theory loosely related to the Moore bound. Our point of departure for the second, Ramsey theoretic, part are some…
In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…
The expected value for the weighted crossing number of a randomly weighted graph is studied. A variation of the Crossing Lemma for expectations is proved. We focus on the case where the edge-weights are independent random variables that are…