相关论文: Central Measures of Continuous Graded Graphs:\\ th…
We describe the spectrum of an ergodic invariant measure by examining the behaviour of its generic points. We define regular Wiener--Wintner generic points for a measure to generalise the characterisation of generic points for discrete…
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…
We describe one-dimensional central measures on numberings (tableaux) of ideals of partially ordered sets (posets). As the main example, we study the poset ${\Bbb Z}_+^d$ and the graph of its finite ideals, multidimensional Young tableaux;…
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…
Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters vary. Recent work has considered the relationship between…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
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…
A monitoring edge-geodetic set, or simply an MEG-set, of a graph $G$ is a vertex subset $M \subseteq V(G)$ such that given any edge $e$ of $G$, $e$ lies on every shortest $u$-$v$ path of $G$, for some $u,v \in M$. The monitoring…
We suggest a new method of describing invariant measures on Markov compacta and path spaces of graphs, and thus of describing characters of some groups and traces of AF-algebras. The method relies on properties of filtrations associated…
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…
Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…
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 give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…
We present a novel graph embedding space (i.e., a set of measures on graphs) for performing statistical analyses of networks. Key improvements over existing approaches include discovery of "motif-hubs" (multiple overlapping significant…
We consider a non-uniquely ergodic dynamical system given by a $\mathbb{Z}^{l}$-action (or $(\N\cup\{0\})^l$-action) $\tau$ on a non-empty compact metrisable space $\Omega$, for some $l\in\N$. Let (D) denote the following property: The…
We consider Bratteli diagrams of finite rank (not necessarily simple) and ergodic invariant measures with respect to the cofinal equivalence relation on their path spaces. It is shown that every ergodic invariant measure (finite or…
A new measure $c(e)$ of the centrality of an edge $e$ in an undirected graph $G$ is introduced. It is based on the variation of the Kemeny constant of the graph after removing the edge $e$. The new measure is designed in such a way that the…
We associate to a graphon $\gamma$ the sequence of $W$-random graphs $(G_n(\gamma))_{n \geq 1}$. We say that the graphon is singular if, for any finite graph $F$, the homomorphism density $t(F,G_n(\gamma))$ has a variance of order…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We endow the set of all invariant measures of a topological dynamical system with a metric $\bar{\rho}$, which induces a topology stronger than the the weak$^*$-topology. Then, we study the closedness of ergodic measures within a…