Related papers: Weighted prime geodesic theorems
Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most the sum of weights of the edges in M\N. We prove that if w…
This article presents a survey of work on lifted graphical models. We review a general form for a lifted graphical model, a par-factor graph, and show how a number of existing statistical relational representations map to this formalism. We…
We establish a weighted version of the $H^p$-theory of quasiconformal mappings.
In this paper, we define several measures induced by a finite directed graph. The study themselves is interesting ont only in the noncommutative probability point of view but also in the algebraic structure point of view, since to define…
We address the prime geodesic theorem in arithmetic progressions, and resolve conjectures of Golovchanski\u{\i}-Smotrov (1999). In particular, we prove that the traces of closed geodesics on the modular surface do not equidistribute in the…
We consider the infinite directed graph with vertices the set of integers ...,-2,-1,0,1,2,... . Let v be a random variable taking either finite values or value "minus infinity". Consider random weights v(j,k), indexed by pairs (j,k) of…
It was studied the growth of Temperley-Lieb type algebras with orthogonal and commutative relations associated with 2-colored edges graphs. Depending on the structure of the graphs they can be finite-dimensional or to have linear or…
A famous theorem of Szemer\'edi asserts that any set of integers of positive upper density will contain arbitrarily long arithmetic progressions. In its full generality, we know of four types of arguments that can prove this theorem: the…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
The growing complexity of wireless systems has accelerated the move from traditional methods to learning-based solutions. Graph Neural Networks (GNNs) are especially well-suited here, since wireless networks can be naturally represented as…
Semi-invertible multiplicative ergodic theorems establish the existence of an Oseledets splitting for cocycles of non-invertible linear operators (such as transfer operators) over an invertible base. Using a constructive approach, we…
We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by…
The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.
Watersheds have been defined both for node and edge weighted graphs. We show that they are identical: for each edge (resp.\ node) weighted graph exists a node (resp. edge) weighted graph with the same minima and catchment basin.
Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks, exponential random graph models are a…
We consider the problem of determining the maximum induced density of a graph H in any graph on n vertices. The limit of this density as n tends to infinity is called the inducibility of H. The exact value of this quantity is known only for…
We introduce the weighted greatest common divisor of a tuple of integers and explore some of it basic properties. Furthermore, for a set of heights $\mathfrak w=(q_0, \ldots , q_n)$, we use the concept of the weighted greatest common…
This paper provides an overview of results, concerning longest or heaviest paths, in the area of random directed graphs on the integers along with some extensions. We study first-order asymptotics of heaviest paths allowing weights both on…
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynamics and generates weighted directed graphs exhibiting the…
Under suitable hypotheses we establish a quantitative pointwise ergodic theorem which applies to trimmed Birkhoff sums of weakly integrable functions.