Papers by Andrew Michaelson
Physica A: Statistical Mechanics and its Applications, 2016
Evaluation of link prediction methods is a hard task in very large complex networks because of th... more Evaluation of link prediction methods is a hard task in very large complex networks because of the inhibitive computational cost. By setting a lower bound of the number of common neighbors (CN), we propose a new framework to efficiently and precisely evaluate the performances of CN-based similarity indices in link prediction for very large heterogeneous networks. Specifically, we propose a fast algorithm based on the parallel computing scheme to obtain all the node pairs with CN values larger than the lower bound. Furthermore, we propose a new measurement, called selfpredictability, to quantify the performance of the CN-based similarity indices in link prediction, which on the other side can indicate the link predictability of a network.
Physics Letters A, 2015
We investigate a path-attack process on model networks and real-world networks. Based on the loca... more We investigate a path-attack process on model networks and real-world networks. Based on the local topological structure of a path, we propose an attack centrality measure with a control parameter α for quantifying the influence of a path. In the path-attack process, we iteratively remove the path with the largest attack centrality from a network. Results demonstrate that, for a specific network, there is an optimal α which results in maximum attack efficiency. The denser and more homogeneous the networks, the more robust the networks are against iterative path attacks. Our work helps to explain the vulnerability of networks and provides some clues about the protection and design of real complex systems.
Physica A: Statistical Mechanics and its Applications, 2012
Structural controllability, which is an interesting property of complex networks, attracts many r... more Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös-Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure.
Acta biomaterialia, Jan 24, 2015
Tissue decellularization strategies have enabled engineering of scaffolds that preserve native ex... more Tissue decellularization strategies have enabled engineering of scaffolds that preserve native extracellular matrix (ECM) structure and composition. In this study, we developed decellularized retina (decell-retina) thin films. We hypothesized that these films, mimicking the retina niche, would promote human retinal progenitor cell (hRPC) attachment, proliferation and differentiation. Retinas isolated from bovine eyes were decellularized using 1% w/v sodium dodecyl sulfate (SDS) and pepsin digested. The resulting decell-retina was biochemically assayed for composition and cast dried to develop thin films. Attachment, viability, morphology, proliferation and gene expression of hRPC cultured on the films were studied in vitro. Biochemical analyses of decell-retina compared to native retina indicated the bulk of DNA (94%) was removed, while the majority of sulfated GAGs (55%), collagen (83%), hyaluronic acid (87%), and key growth factors were retained. The decell-retina films supported ...
Uploads
Papers by Andrew Michaelson