Related papers: A Stationary Planar Random Graph with Singular Sta…
The unit distance embeddability of a graph, like planarity, involves a mix of constraints that are combinatorial and geometric. We construct a unit distance embedding for $H-e$ in the hope that it will lead to an embedding for $H$. We then…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some…
In the context of spaces of homogeneous type, we develop a method to deterministically construct dyadic grids, specifically adapted to a given combinatorial situation. This method is used to estimate vector-valued operators rearranging…
Spectral properties of Coupled Map Lattices are described. Conditions for the stability of spatially homogeneous chaotic solutions are derived using linear stability analysis. Global stability analysis results are also presented. The…
We initiate the study of random iteration of automorphisms of real and complex projective surfaces, or more generally compact K{\"a}hler surfaces, focusing on the fundamental problem of classification of stationary measures. We show that,…
The space of unit flows on a directed acyclic graph (DAG) with one source and one sink is known to admit regular unimodular triangulations induced by framings of the DAG. The dual graph of any of these triangulations may be given the…
A nearly platonic graph is a k-regular simple planar graph in which all but a small number of the faces have the same degree. We show that it is impossible for a finite graph to have exactly one disparate face, and offer some conjectures,…
This paper is concerned with inference in the linear model with dyadic data. Dyadic data is data that is indexed by pairs of "units", for example trade data between pairs of countries. Because of the potential for observations with a unit…
Given a hyperbolic surface, the set of all closed geodesics whose length is minimal form a graph on the surface, in fact a so-called fat graph, which we call the systolic graph. We study which fat graphs are systolic graphs for some surface…
The regularity of monotone transport maps plays an important role in several applications to PDE and geometry. Unfortunately, the classical statements on this subject are restricted to the case when the measures are compactly supported. In…
Consider two planar graphs which are subject to edge insertions and deletions. We show that whether the two graphs are isomorphic can be maintained with first-order logic formulas and auxiliary data of polynomial size. This places the…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
This paper is concerned with long-time interest of us, especially, the author, in realizing graphs as Reeb graphs of real algebraic functions of certain nice classes. The Reeb graph of a differentiable function is the set consisting of all…
We investigate the existence of invariant measures for self-stabilizing diffusions. These stochastic processes represent roughly the behavior of some Brownian particle moving in a double-well landscape and attracted by its own law. This…
A matchstick graph is a plane graph with edges drawn as unit distance line segments. This class of graphs was introduced by Harborth who conjectured that a matchstick graph on $n$ vertices can have at most $\lfloor 3n - \sqrt{12n -…
The aim of this note is to describe a geometric relation between simple plane curve singularities classified by simply laced Cartan matrices and cluster varieties of finite type also classified by the simply laced Cartan matrices. We…
We study general linear transport-reaction systems on an arbitrary dimensional hypercube with periodic boundary conditions. Transport-reaction systems are often used to model the finite speed movement and interaction of particles, bacteria…
The study of locally s-distance transitive graphs initiated by the authors in previous work, identified that graphs with a star quotient are of particular interest. This paper shows that the study of locally s-distance transitive graphs…
A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…