463 citations
- University of OxfordGB12 papers
- University of Massachusetts AmherstUS6 papers
- California Institute of TechnologyUS5 papers
- University of California San DiegoUS2 papers
- École PolytechniqueFR1 paper
- Heidelberg UniversityDE1 paper
- Institut Supérieur de Mécanique de ParisFR1 paper
- Los Alamos National LaboratoryUS1 paper
- National and Kapodistrian University of AthensGR1 paper
- Oxford BioMedica (United Kingdom)GB1 paper
- Stockholm UniversitySE1 paper
- Sungkyunkwan UniversityKR1 paper
12 papers
Exponential asymptotics and problems with coalescing singularities
Philippe H. Trinh, S. Jonathan Chapman
Problems in exponential asymptotics are typically characterized by divergence of the associated asymptotic expansion in the form of a factorial divided by a power. In this paper, w…
Geometric properties of graph layouts optimized for greedy navigation
Sang Hoon Lee, Petter Holme
The graph layouts used for complex network studies have been mainly been developed to improve visualization. If we interpret the layouts in metric spaces such as Euclidean ones, ho…
Dark Solitary Waves in a Class of Collisionally Inhomogeneous Bose-Einstein Condensates
Chang Wang, Kody J. H. Law, Panayotis. G. Kevrekidis +1
We study the structure, stability, and dynamics of dark solitary waves in parabolically trapped, collisionally inhomogeneous Bose-Einstein condensates (BECs) with spatially periodi…
Robust Detection of Dynamic Community Structure in Networks
Danielle S. Bassett, Mason A. Porter, Nicholas F. Wymbs +3
We describe techniques for the robust detection of community structure in some classes of time-dependent networks. Specifically, we consider the use of statistical null models for…
Intrinsic Energy Localization through Discrete Gap Breathers in One-Dimensional Diatomic Granular Crystals
G. Theocharis, N. Boechler, P. G. Kevrekidis +3
We present a systematic study of the existence and stability of discrete breathers that are spatially localized in the bulk of a one-dimensional chain of compressed elastic beads t…
Spectral tripartitioning of networks
Thomas Richardson, Peter J. Mucha, Mason A. Porter
We formulate a spectral graph-partitioning algorithm that uses the two leading eigenvectors of the matrix corresponding to a selected quality function to split a network into three…