activity
20122020
most citedSpontaneous Circulation of Confined Active Suspensions

154 citations · 220 across the 3 of their papers we have counts for

collaborators

13 papers

physics.soc-ph2020

Crowded transport within networked representations of complex geometries

Daniel B. Wilson, Francis G. Woodhouse, Matthew J. Simpson +1

Transport in crowded, complex environments occurs across many spatial scales. Geometric restrictions can hinder the motion of individuals and, combined with crowding between indivi…

cond-mat.soft2019

Reversible signal transmission in an active mechanical metamaterial

Alexander P Browning, Francis G Woodhouse, Matthew J Simpson

Mechanical metamaterials are designed to enable unique functionalities, but are typically limited by an initial energy state and require an independent energy input to function rep…

cond-mat.stat-mech2019

Displacement of transport processes on networked topologies

Daniel B. Wilson, Ruth E. Baker, Francis G. Woodhouse

Consider a particle whose position evolves along the edges of a network. One definition for the displacement of a particle is the length of the shortest path on the network between…

cond-mat.soft2018

Autonomous actuation of zero modes in mechanical networks far from equilibrium

Francis G. Woodhouse, Henrik Ronellenfitsch, Jörn Dunkel

A zero mode, or floppy mode, is a non-trivial coupling of mechanical components yielding a degree of freedom with no resistance to deformation. Engineered zero modes have the poten…

physics.soc-ph2018

Functional control of network dynamics using designed Laplacian spectra

Aden Forrow, Francis G. Woodhouse, Jörn Dunkel

Complex real-world phenomena across a wide range of scales, from aviation and internet traffic to signal propagation in electronic and gene regulatory circuits, can be efficiently…

math.OC2017

Topology-dependent density optima for efficient simultaneous network exploration

Daniel B. Wilson, Ruth E. Baker, Francis G. Woodhouse

A random search process in a networked environment is governed by the time it takes to visit every node, termed the cover time. Often, a networked process does not proceed in isola…