Related papers: One-dimensional central measures on numberings of …
The Chermak-Delgado measure of a finite group is a function which assigns to each subgroup a positive integer. In this paper, we give necessary and sufficient conditions for when the Chermak-Delgado measure of a group is actually a map of…
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…
For every nonempty compact convex subset $K$ of a normed linear space a (unique) point $c_K \in K$, called the generalized Chebyshev center, is distinguished. It is shown that $c_K$ is a common fixed point for the isometry group of the…
We introduce a class of continuous maps f of a compact metric space I admitting inducing schemes and describe the tower constructions associated with them. We then establish a thermodynamical formalism, i.e., describe a class of real-valued…
A new measure to assess the centrality of vertices in an undirected and connected graph is proposed. The proposed measure, L1 centrality, can adequately handle graphs with weights assigned to vertices and edges. The study provides tools for…
We study thermodynamic formalism for topologically transitive partially hyperbolic systems in which the center-stable bundle satisfies a bounded expansion property, and show that every potential function satisfying the Bowen property has a…
What is the ergodic behaviour of numerically computed segments of orbits of a diffeomorphism? In this paper, we try to answer this question for a generic conservative $C^1$-diffeomorphism, and segments of orbits of Baire-generic points. The…
In this work, we define the notion of unimodular random measured metric spaces as a common generalization of various other notions. This includes the discrete cases like unimodular graphs and stationary point processes, as well as the…
We define a general notion of a smooth invariant (central) ergodic measure on the space of paths of an $N$-graded graph (Bratteli diagram). It is based on the notion of standardness of the tail filtration in the space of paths, and the…
Identifying central entities and interactions is a fundamental problem in network science. While well-studied for graphs (pairwise relations), many biological and social systems exhibit higher-order interactions best modeled by hypergraphs.…
This paper introduces some tools from graph theory and distributed consensus algorithms to construct an optimal, yet robust, hierarchical information sharing structure for large-scale decision making and control problems. The proposed…
We study $C^1$-robustly transitive and nonhyperbolic diffeomorphisms having a partially hyperbolic splitting with one-dimensional central bundle whose strong un-/stable foliations are both minimal. {In dimension $3$, an important class of…
Centrality describes the importance of nodes in a graph and is modeled by various measures. Its global analogue, called centralization, is a general formula for calculating a graph-level centrality score based on the node-level centrality…
We study the space of ergodic measures of the map $$f:\mathbb{T}^2\to \mathbb{T}^2, \ f(x, y)=(x, \ x+y)(\text{mod}\, 1),$$ and show that its structure is similar to the graph of Thomae's function.
A centrality measure of the cut-edges of an undirected graph, given in [Altafini et al.~SIMAX 2023] and based on Kemeny's constant, is revisited. A numerically more stable expression is given to compute this measure, and an explicit…
We consider diffusion on discrete measure spaces as encoded by Markovian semigroups arising from weighted graphs. We study whether the graph is uniquely determined if the diffusion is given up to order isomorphism. If the graph is recurrent…
Complex systems that consist of different kinds of entities that interact in different ways can be modeled by multilayer networks. This paper uses the tensor formalism with the Einstein tensor product to model this type of networks. Several…
The concentration of measure phenomena were discovered as the mathematical background of statistical mechanics at the end of the XIX - beginning of the XX century and were then explored in mathematics of the XX-XXI centuries. At the…
Using the notion of higher-order Fourier dimension introduced in \cite{M2} (which was a sort of psuedorandomness condition stemming from the Gowers norms of Additive Combinatorics), we prove a maximal theorem and corresponding…
Given a set $S$ consisting of $n$ points in $\mathbb{R}^d$ and one or two vantage points, we study the number of orderings of $S$ induced by measuring the distance (for one vantage point) or the average distance (for two vantage points)…