1 citations · 2 across the 5 of their papers we have counts for
7 papers
Local rewiring algorithms to increase clustering and grow a small world
Jeff Alstott, Christine Klymko, Pamela B. Pyzza +1
Many real-world networks have high clustering among vertices: vertices that share neighbors are often also directly connected to each other. A network's clustering can be a useful…
A proof of the Cycle Double Cover Conjecture
Mary Radcliffe
Given a bridgeless graph , the Cycle Double Cover Conjecture posits that there is a list of cycles of , such that every edge appears in exactly two cycles on the list. This c…
Connectivity and giant component in random distance graphs
Joshua Flynn, Briana Oshiro, Mary Radcliffe
Various different random graph models have been proposed in which the vertices of the graph are seen as members of a metric space, and edges between vertices are determined as a fu…
On expansion of with respect to
Ioana Dumitriu, Mary Radcliffe
In several works, Mendel and Naor have introduced and developed theory surrounding a nonlinear expansion constant similar to the spectral gap for sequences of graphs, in which one…
Bounds on Geometric Eigenvalues of Graphs
Mary Radcliffe, Chris Williamson
The smallest nonzero eigenvalue of the normalized Laplacian matrix of a graph has been extensively studied and shown to have many connections to properties of the graph. We here st…
A linear k-fold Cheeger inequality
Franklin Kenter, Mary Radcliffe
Given an undirected graph , the classical Cheeger constant, , measures the optimal partition of the vertices into 2 parts with relatively few edges between them based upon…
Connectivity and Giant Component of Stochastic Kronecker Graphs
Mary Radcliffe, Stephen J. Young
Stochastic Kronecker graphs are a model for complex networks where each edge is present independently according the Kronecker (tensor) product of a fixed matrix k-by-k matrix P wit…