Online Edge Flow Imputation on Networks

An online algorithm for missing data imputation for networks with signals defined on the edges is presented. Leveraging the prior knowledge intrinsic to real-world networks, we propose a bi-level optimization scheme that exploits the causal dependencies and the flow conservation, respectively via <italic>(i)</italic> a sparse line...

Robustness of complex networks: Theory and application

Failures of networks, such as power outages in power systems, congestions in<br/>transportation networks, paralyse our daily life and introduce a tremendous cascading effect on our society. Networks should be constructed and operated in a robust way against random failures or deliberate attacks.<br/>We study how to add a single link into an...

ILIGRA: An Efficient Inverse Line Graph Algorithm

This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...

Robustness and Optimization of Complex Networks: Reconstructability, Algorithms and Modeling

The infrastructure networks, including the Internet, telecommunication networks, electrical power grids, transportation networks (road, railway, waterway, and airway networks), gas networks and water networks, are becoming more and more complex. The complex infrastructure networks are crucial to our human society, and it has been a hot research ...

Characterizing the Structure of Affiliation Networks

ur society contains all types of organizations, such as companies, research groups and hobby clubs. Affliation networks, as a large and important portion of social networks, consist of individuals and their affiation relations: Two individuals are connected by a link if they belong to the same organization(s). Affliation networks naturally...