相关论文: One-dimensional central measures on numberings of …
We define a class of continuous graded graphs similar to the graph of Gelfand--Tsetlin patterns, and describe the set of all ergodic central measures of discrete type on the path spaces of such graphs. The main observation is that an…
We introduce a quantitative method to compare arbitrary pairs of graph centrality measures, based on the ordering of vertices induced by them. The proposed method is conceptually simple, mathematically elegant, and allows for a quantitative…
Starting with the work of Preiss on the geometry of measures, the classification of uniform measures in $\mathbb R^d$ has remained open, except for $d=1$ and for compactly supported measures in $d=2$, and for codimension $1$. In this paper…
We show that prominent centrality measures in network analysis are all based on additively separable and linear treatments of statistics that capture a node's position in the network. This enables us to provide a taxonomy of centrality…
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…
We introduce a new notion of a harmonic measure for a $d$-dimensional set in $\R^n$ with $d<n-1$, that is, when the codimension is strictly bigger than 1. Our measure is associated to a degenerate elliptic PDE, it gives rise to a…
The dimension of a partially ordered set $P$ (poset for short) is the least positive integer $d$ such that $P$ is isomorphic to a subposet of $\mathbb{R}^d$ with the natural product order. Dimension is arguably the most widely studied…
The calculation of centrality measures is common practice in the study of networks, as they attempt to quantify the importance of individual vertices, edges, or other components. Different centralities attempt to measure importance in…
In graph-based applications, a common task is to pinpoint the most important or ``central'' vertex in a (directed or undirected) graph, or rank the vertices of a graph according to their importance. To this end, a plethora of so-called…
We consider a class of non-conformal expanding maps on the $d$-dimensional torus. For an equilibrium measure of an H\"older potential, we prove an analogue of the Central Limit Theorem for the fluctuations of the logarithm of the measure of…
We consider a Random Graph Model on $\mathbb{Z}^{d}$ that incorporates the interplay between the statistics of the graph and the underlying space where the vertices are located. Based on a graphical construction of the model as the…
We formulate a general statement of the problem of defining invariant measures with certain properties and suggest an ergodic method of perturbations for describing such measures.
Given a social network, which of its nodes are more central? This question has been asked many times in sociology, psychology and computer science, and a whole plethora of centrality measures (a.k.a. centrality indices, or rankings) were…
Among central measures on the path space of the Young--Fibonacci lattice the so-called Plancherel measure has a special role. Its ergodicity was proved by Kerov and Gnedin. The goal of this cycle of two articles is to prove that remaining…
In the present paper, we study a set that can be treated as a generalised set of subsums for a geometric series. This object was discovered independently in various mathematical aspects. For instance, it is closely related to various…
As relational datasets modeled as graphs keep increasing in size and their data-acquisition is permeated by uncertainty, graph-based analysis techniques can become computationally and conceptually challenging. In particular, node centrality…
For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
We consider partially hyperbolic diffeomorphisms $f$ with a one-dimensional central direction such that the unstable entropy exceeds the stable entropy. Our main result proves that such maps have a finite number of ergodic measures of…
The goal of this paper is to present a centrality measurement for the nodes of a hypergraph, by using existing literature which extends eigenvector centrality from a graph to a hypergraph, and literature which give a general centrality…