Related papers: The Pascal automorphism has a purely continuous sp…
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…
We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…
The following questions are germane to our understanding of gauge-(in)variant quantities and physical possibility: how are gauge transformations and spacetime diffeomorphisms understood as symmetries, in which ways are they similar, and in…
We study the automorphisms of a Cayley graph that preserve its natural edge-colouring. More precisely, we are interested in groups G, such that every such automorphism of every connected Cayley graph on G has a very simple form: the…
We describe an explicit method for constructing pseudo-automorphisms of a space $X$ which is obtained by blowing up points of $P^k$ (or a product $P^k \times \cdots \times P^k$). The centers of blowup are chosen to lie on an elliptic normal…
We define a random walk adic transformation associated to an aperiodic random walk on $G=\mathbb{Z}^{k}\times\mathbb{R}^{D-k}$ driven by a $\beta$-transformation and study its ergodic properties. In particular, this transformation is…
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method of spectral analysis on self-similar graphs. We give an…
Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…
One-vertex maps (a type of dessin d'enfant) give a uniform characterization of certain well-known algebraic curves, including those of Klein, Wiman, Accola-Maclachlan and Kulkarni. The characterization depends on a new classification of…
In this paper we study the complementarity spectrum of digraphs, with special attention to the problem of digraph characterization through this complementarity spectrum. That is, whether two non-isomorphic digraphs with the same number of…
We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix theory. We also define a classical phase space for the…
A complete list of all connected arc-transitive asymmetric digraphs of in-valence and out-valence 2 on up to 1000 vertices is presented. As a byproduct, a complete list of all connected 4-valent graphs admitting a half-arc-transitive group…
We consider self-adjoint unbounded Jacobi matrices with diagonal q_n=n and weights \lambda_n=c_n n, where c_n is a 2-periodical sequence of real numbers. The parameter space is decomposed into several separate regions, where the spectrum is…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
In this paper we classify all topological vector spaces with linear topology with the property that all algebraic automorphisms are continuous. Moreover, we prove some properties of these spaces.
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds to learning a graph's labeling, knowing its structure and…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…