Related papers: A Stationary Planar Random Graph with Singular Sta…

The hyperbolicity of a graph, informally, measures how close a graph is (metrically) to a tree. Hence, it is intuitively similar to treewidth, but the measures are formally incomparable. Motivated by the broad study of algorithms and…

The study of matter fields on an ensemble of random geometries is a difficult problem still in need of new methods and ideas. We will follow a point of view inspired by probability theory techniques that relies on an expansion of the two…

The recent detection of the singular diamagnetism of Dirac electrons in a single graphene layer paved a new way of probing 2D quantum materials through the measurement of equilibrium orbital currents which cannot be accessed in usual…

In this paper, we study dual quaternion and dual complex unit gain graphs and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications…

We show that for infinite planar unimodular random rooted maps, many global geometric and probabilistic properties are equivalent, and are determined by a natural, local notion of average curvature. This dichotomy includes properties…

We present those properties of planar doodles, especially when regarded as 4-valent graphs, that enable us to classify them into {\it prime} and {\it super prime} doodles by analogy to a knot sum. We describe a method for partially…

Iterations of odd piecewise continuous maps with two discontinuities, i.e., symmetric discontinuous bimodal maps, are studied. Symbolic dynamics is introduced. The tools of kneading theory are used to study the homology of the discrete…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

Inferring graph structure from observations on the nodes is an important and popular network science task. Departing from the more common inference of a single graph and motivated by social and biological networks, we study the problem of…

In this paper, we consider stationary measures of discrete-time three-state quantum walks including the Fourier and Grover walks in the one-dimensional lattice. We give non-uniform stationary measures by solving the corresponding eigenvalue…

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate…

Here I present a new discrete model of quantum mechanics for relativistic 1-electron systems, in which particle movement is described by a directed space-time graph with attached 4-spinors, but without any continuous wave functions. These…

Many tools from the field of graph signal processing exploit knowledge of the underlying graph's structure (e.g., as encoded in the Laplacian matrix) to process signals on the graph. Therefore, in the case when no graph is available, graph…

The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.

The goal of this paper is to give a conjectural census of complex hyperbolic sporadic groups. We prove that only finitely many of these sporadic groups are lattices. We also give a conjectural list of all lattices among sporadic groups, and…

We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…

Diagrammatic rules are developed for simplifying two-loop QED diagrams with propagators in a constant self-dual background field. This diagrammatic analysis, using dimensional regularization, is used to explain how the fully renormalized…

We study random labelings of graphs conditioned on a small number (typically one or two) peaks, i.e., local maxima. We show that the boundaries of level sets of a random labeling of a square with a single peak have dimension 2, in a…

We study harmonic measure in finite graphs with an emphasis on expanders, that is, positive spectral gap. It is shown that if the spectral gap is positive then for all sets that are not too large the harmonic measure from a uniform starting…