Publications (26)
Maximal Intervals of Decrease and Inflection Points for Node Reliability
Jason Brown
The \textit{node reliability} of a graph is the probability that at least one node is operational and that the operational nodes can all communicate in the subgraph that they i…
The shape of node reliability
Jason Brown, Lucas Mol
Given a graph whose edges are perfectly reliable and whose nodes each operate independently with probability the node reliability of is the probability that at…
On the roots of the node reliability polynomial
Jason Brown, Lucas Mol
Given a graph whose edges are perfectly reliable and whose nodes each operate independently with probability the node reliability of is the probability that at…
GLL: A Differentiable Graph Learning Layer for Neural Networks
Jason Brown, Bohan Chen, Harris Hardiman-Mostow +2
Standard deep learning architectures used for classification generate label predictions with a projection head and softmax activation function. Although successful, these methods f…
Restraints Permitting the Largest Number of Colourings
Jason Brown, Aysel Erey
A \textit{restraint} on is a function which assigns each vertex of a finite set of forbidden colours . A proper colouring of is said to be \textit{per…
On the real roots of -Polynomials
Jason Brown, Aysel Erey
The -polynomial is given by , where is the number of partitions of the vertices of into nonempty independent s…