Yanhua Li
ABSTRACT
Complex networks are becoming indispensable parts of our lives. The Internet, wireless (cellular) networks, online social networks, and transportation networks are examples of some well-known complex networks around us. These networks generate an immense range of big data: weblogs, social media, the Internet traffic, which have increasingly drawn attentions from the computer science research community to explore and investigate the fundamental properties of, and improve the user experiences on, these complex networks. This work focuses on understanding complex networks based on the graph spectrum, namely, developing and applying spectral graph theories and models for understanding and employing versatile and oblivious network information -- asymmetrical characteristics of the wireless transmission channels, multiplex social relations, e.g., trust and distrust relations, etc -- in solving various application problems, such as estimating transmission cost in wireless networks, Internet traffic engineering, and social influence analysis in social networks.
- D. Aldous and J. A. Fill. Reversible markov chains and random walks on graphs. http://www.stat.berkeley.edu/ Aldous/RWG/book.html.Google Scholar
- D. Boley, G. Ranjan, and Z.-L. Zhang. Commute times for a directed graph using an asymmetric laplacian. Linear Algebra and its Applications, 435(2):224--242, 2011.Google ScholarCross Ref
- C.-K. Chau and P. Basu. Exact analysis of latency of stateless opportunistic forwarding. In INFOCOM 2009, pages 828--836. IEEE, 2009.Google ScholarCross Ref
- K. Chaudhuri, F. C. Graham, and A. Tsiatas. Spectral clustering of graphs with general degrees in the extended planted partition model. In COLT, pages 35--1, 2012.Google Scholar
- F. R. K. Chung. Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics, 9(1):1--19, 2005.Google ScholarCross Ref
- F. R. K. Chung. Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). Cbms Regional Conference Series in Mathematics, 2006.Google Scholar
- L. Hogben. Spectral graph theory and the inverse eigenvalue problem of a graph. Electronic Journal of Linear Algebra, 14(1):3, 2005.Google ScholarCross Ref
- R. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1st edition, 1985. Google ScholarDigital Library
- Y. Li, W. Chen, Y. Wang, and Z.-L. Zhang. Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships. In WSDM, pages 1--10. ACM, 2013. Google ScholarDigital Library
- Y. Li, W. Chen, Y. Wang, and Z.-L. Zhang. Voter model on signed social networks. Internet Mathematics, PP(99):1--50, 2014.Google Scholar
- Y. Li, W. Chen, and Z.-L. Zhang. Optimal forwarder list selection in opportunistic routing. In MeshTech, pages 670--675. IEEE, 2009.Google ScholarCross Ref
- Y. Li and Z.-L. Zhang. Random walks on digraphs: A theoretical framework for estimating transmission costs in wireless routing. In INFOCOM, pages 1--9. IEEE, 2010. Google ScholarDigital Library
- Y. Li and Z.-L. Zhang. Random walks on digraphs, the generalized digraph laplacian and the degree of asymmetry. WAW, pages 74--85, 2010.Google ScholarCross Ref
- Y. Li and Z.-L. Zhang. Digraph laplacian and the degree of asymmetry. Internet Mathematics, 8(4), 2012.Google Scholar
- Y. Li and Z.-L. Zhang. Random walks and green's function on digraphs: A framework for estimating wireless transmission costs. IEEE/ACM Transactions on Networking, PP(99):1--14, 2012. Google ScholarDigital Library
- Y. Li, Z.-L. Zhang, and J. Bao. Mutual or unrequited love: Identifying stable clusters in social networks with uni- and bi-directional links. In WAW, pages 113--125, 2012. Google ScholarDigital Library
- Y. Li, Z.-L. Zhang, and D. Boley. The routing continuum from shortest-path to all-path: A unifying theory. In ICDCS, pages 847--856. IEEE, 2011. Google ScholarDigital Library
- Y. Li, Z.-L. Zhang, and D. Boley. From shortest-path to all-path: The routing continuum theory and its applications. IEEE Transactions on Parallel and Distributed Systems, 25(7):1745--1755, 2014. Google ScholarDigital Library
- L. Lovàsz. Random walks on graphs: A survey. Combinatorics, 2:1--46, 1993.Google Scholar
- D. Zhou, J. Huang, and B. Schölkopf. Learning from labeled and unlabeled data on a directed graph. In ICML, pages 1036--1043, 2005. Google ScholarDigital Library
Index Terms
- Understanding Complex Networks Using Graph Spectrum
Recommendations
The Spectral Zoo of Networks: Embedding and Visualizing Networks with Spectral Moments
KDD '20: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data MiningNetwork embedding methods have been widely and successfully used in network-based applications such as node classification and link prediction. However, an ideal network embedding should not only be useful for machine learning, but interpretable. We ...
Analysis of Annotated Social and Information Networks: Methods and Applications
WIMS '18: Proceedings of the 8th International Conference on Web Intelligence, Mining and SemanticsIn order to understand, control or improve a complex system composed out of a large number of inter-related parts it is necessary to quantify, characterize and comprehend the structure and evolution of underlying complex networks. The last two decades ...
Analysis of Heterogeneous Complex Networks Using the Degree of Diffusion
NBIS '13: Proceedings of the 2013 16th International Conference on Network-Based Information SystemsDiffusion is the process of spreading information throughout a network. The degree of diffusion a has been used to measure the diffusion and the adoption rates of different complex networks. It is defined as the percentage between the adopters and non-...
Comments