Related papers: The structure of random automorphisms of the rando…

In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…

We advance superselection theory of pure states on a $C^*$-algebra $\mathfrak{A}$ outside of the conventional (DHR) setting. First, we canonically define conjugate and second conjugate classes of such states with respect to a given…

The class, denoted by $\mathscr{S}$, of totally disconnected locally compact groups which are non-discrete, compactly generated, and topologically simple contains many compelling examples. In recent years, a general theory for these groups,…

For a graph G, we define a small automorphism as one that maps some vertex into its neighbour. We investigate the edge colourings of G that break every small automorphism of G. We show that such a colouring can be chosen from any set of…

We show that the topology of uniform convergence on bounded sets is compatible with the group law of the automorphism group of a large class of spaces that are endowed with both a uniform structure and a bornology, thus yielding numerous…

We show that there is a system of 14 non-trivial finitary functions on the random graph with the following properties: Any non-trivial function on the random graph generates one of the functions of this system by means of composition with…

We study the properties of the giant connected component in random graphs with arbitrary degree distribution. We concentrate on the degree-degree correlations. We show that the adjoining nodes in the giant connected component are correlated…

Let \(G\) be a non-discrete, locally compact group with Haar measure \(m\). We prove that there exists a compact set \(K \subset G\) with \(m(K)=0\) such that \(KK^{-1}\) contains a neighborhood of the identity. Moreover, such a set may be…

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly…

In this paper, generalising the idea of the Rokhlin property, we explore the concept of the twisted Rokhlin property of topological groups. A topological group is said to exhibit the twisted Rokhlin property if, for each automorphism $\phi$…

For finite connected graphs $\Gamma$ and $G$, with $\Gamma$ admitting a free involution $\tau$, we characterize the based homotopy classes $\alpha\in[\Gamma,G]$ for which the Borsuk-Ulam property holds in the sense of Gon\c{c}alves, Guaschi…

In the past two decades, significant advances have been made in understanding the structural and functional properties of biological networks, via graph-theoretic analysis. In general, most graph-theoretic studies are conducted in the…

A class K of finite structures is said to have the extension property for automorphisms (EP) if for every A in K there exists an extension B in K such that every partial isomorphism on the structure A extends to an automorphism of B.…

We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…

Let $\mathrm{XY_{L,T}}$ denote the class of countably infinite $L$-structures that satisfy the axioms $T$ and in which all homomorphisms of type X (these could be homomorphisms, monomorphisms, or isomorphisms) between finite substructures…

This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…

Barbieri recently showed that the finite graphs realising any given finite automorphism group have unbounded genus, answering a question of Cornwell et al. In this note we give a short proof of a stronger result: they have unbounded clique…