Related papers: Moments of Two-Variable Functions and the Uniquene…
A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
We study the $2k$-th moment at the central point of the family of symmetric square $L$-functions attached to holomorphic Hecke cusp forms of level one, weight $\kappa$. We establish sharp lower bounds for all real $k \geq 1/2$…
Certain notions of convergence of sequences functions such as pointwise convergence and (uniform) convergence on compact or bounded sets come from suitable topological function spaces; see [1]. Under certain conditions these topologies…
We give an asymptotic formula for the $2k$th moment of a sum of multiplicative Steinhaus variables. This was recently computed independently by Harper, Nikeghbali and Radziwi\l\l. We also compute the $2k$th moment of a truncated…
We introduce a statistical mechanics formalism for the study of constrained graph evolution as a Markovian stochastic process, in analogy with that available for spin systems, deriving its basic properties and highlighting the role of the…
The purpose of this paper has twofold. The first is to establish a second main theorem for meromorphic functions on annuli and meromorphic function targets (may not be small functions) with truncated counting functions (truncation level 1)…
We establish a general concentration result for the 1-Wasserstein distance between the empirical measure of a sequence of random variables and its expectation. Unlike standard results that rely on independence (e.g., Sanov's theorem) or…
The functionality of a graph $G$ is the minimum number $k$ such that in every induced subgraph of $G$ there exists a vertex whose neighbourhood is uniquely determined by the neighborhoods of at most $k$ other vertices in the subgraph. The…
In this paper we present a new approach to studying g-measures which is based upon local absolute continuity. We extend the result in [11] that square summability of variations of g-functions ensures uniqueness of g-measures. The first…
Many dynamical systems, including thermal, fluid, and multi-agent systems, can be represented as weighted graphs. In this paper we consider whether the unstable states of such systems can be observed from limited discrete-time measurement,…
We bound the variance and other moments of a random vector based on the range of its realizations, thus generalizing inequalities of Popoviciu (1935) and Bhatia and Davis (2000) concerning measures on the line to several dimensions. This is…
This paper investigates fractional torsional rigidity on compact, connected metric graphs, a novel extension of the classical concept to nonlocal operators. The fractional torsional rigidity is defined as the $L^1$-norm of the fractional…
We show that monochromatic Finsler metrics, i.e., Finsler metrics such that each two tangent spaces are isomorphic as normed spaces, are generalized Berwald metrics, i.e., there exists an affine connection, possibly with torsion, that…
We develop a new approach to recurrence and the existence of non-constant harmonic functions on infinite weighted graphs. The approach is based on the capacity of subsets of metric boundaries with respect to intrinsic metrics. The main tool…
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…
A vertex $w$ in a graph $G$ is said to resolve two vertices $u$ and $v$ if $d(w,u)\neq d(w, v)$. A set $W$ of vertices is a resolving set for $G$ if every pair of distinct vertices is resolved by some vertex in $W$. The metric dimension of…
A simple lemma bounds $\mathrm{s.d.}(T)/\mathbb{E} T$ for hitting times $T$ in Markov chains with a certain strong monotonicity property. We show how this lemma may be applied to several increasing set-valued processes. Our main result…
The median of a graph $G$ with weighted vertices is the set of all vertices $x$ minimizing the sum of weighted distances from $x$ to the vertices of $G$. For any integer $p\ge 2$, we characterize the graphs in which, with respect to any…
We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…