D. Cranston

activity

20152019

collaborators

4 papers

cs.SI2019

The Iterated Local Directed Transitivity Model for Social Networks

Anthony Bonato, Daniel W. Cranston, Melissa Huggan +2

We introduce a new directed graph model for social networks, based on the transitivity of triads. In the Iterated Local Directed Transitivity (ILDT) model, new nodes are born over…

math.CO2018

Circular Flows in Planar Graphs

Daniel W. Cranston, Jiaao Li

For integers $a \geq 2 b > 0$ , a \emph{circular $a / b$ -flow} is a flow that takes values from ${\pm b, \pm (b + 1), \dots, \pm (a - b)}$ . The Planar Circular Flow Conjecture states that ever…

math.CO2018

A Note on Bootstrap Percolation Thresholds in Plane Tilings using Regular Polygons

Neal Bushaw, Daniel W. Cranston

In \emph{ $k$ -bootstrap percolation}, we fix $p \in (0, 1)$ , an integer $k$ , and a plane graph $G$ . Initially, we infect each face of $G$ independently with probability $p$ . Infected…

math.CO2015

List-coloring the Square of a Subcubic Graph

Daniel W. Cranston, Seog-Jin Kim

The {\em square} $G^{2}$ of a graph $G$ is the graph with the same vertex set as $G$ and with two vertices adjacent if their distance in $G$ is at most 2. Thomassen showed that every…