Related papers: On finite approximations of transitive graphs
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
Various connections between the theory of permutation groups and the theory of topological groups are described. These connections are applied in permutation group theory and in the structure theory of topological groups. The first draft of…
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…
A travel groupoid is an algebraic system related with graphs. In this paper, we give an algorithm to construct smooth travel groupoids for any finite graph. This algorithm gives an answer of L.~Nebesk$\acute{\mbox{y}}$'s question, "Does…
We present a novel framework based on optimal transport for the challenging problem of comparing graphs. Specifically, we exploit the probabilistic distribution of smooth graph signals defined with respect to the graph topology. This allows…
We show that there is a deterministic local algorithm (constant-time distributed graph algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs. We show there is no such algorithm that finds a…
The asymptotic study of percolation on finite transitive graphs is considered. Several questions and very few answers regarding percolation on finite graphs are presented.
We prove a flatness result for entire nonlocal minimal graphs having some partial derivatives bounded from either above or below. This result generalizes fractional versions of classical theorems due to Bernstein and Moser. Our arguments…
This paper completes the classification of triply-transitive strongly regular graphs, a program recently initiated by Herman, Maleki, and Razafimahatratra. By proving that the collinearity graph of the polar space $\mathcal{Q}^{-}(5,q)$ and…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
Let $\Gamma =(V,E)$ be a point-transitive reflexive relation. Let $v\in V$ and put $r=|\Gamma (v)|.$ Also assume $\Gamma ^j(v)\cap \Gamma ^{-}(v)=\{v\}$. Then $$ |\Gamma ^{j} (v)\setminus \Gamma ^{j-1} (v)| \ge r-1.$$ In particular we have…
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.
In this note we continue the study of nonlocal interaction dynamics on a sequence of infinite graphs, extending the results of [Esposito et. al 2023+] to an arbitrary number of species. Our analysis relies on the observation that the graph…
We observe that the nonstandard finite cardinality of a definable set in a strongly minimal pseudofinite structure D is a polynomial over the integers in the nonstandard finite cardinality of D. We conclude that D is unimodular, hence also…
Local complement is a graph operation formalized by Bouchet which replaces the neighborhood of a chosen vertex with its edge-complement. This operation induces an equivalence relation on graphs; determining the size of the resulting…
We propose a new functional analytic approach to Stein's method of exchangeable pairs that does not require the pair at hand to satisfy any approximate linear regression property. We make use of this theory in order to derive abstract…
Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
Hybrid logic is a modal logic with additional operators specifying nominals and is highly expressive. For example, there is no formula corresponding to the irreflexivity of Kripke frames in basic modal logic, but there is in hybrid logic.…