Research of Edge Centrality Based on the Algebraic Connectivity

En Jun Xing; Fu Qiang Zhao; Shuo Zhang; Xin Yu Ge

doi:10.4028/www.scientific.net/AMM.543-547.3636

Paper Titles

An Improved Naive Bayesian Classification Algorithm for Sentiment Classification of Microblogs
p.3614

Algorithms Randomly Extracting Questions Based on Paperless Network Test
p.3621

Research on Parallel Association Rules Mining Algorithm Based on Hadoop
p.3625

Shamir's Threshold Scheme to Ensure Security in Cloud Computing Services
p.3632

Research of Edge Centrality Based on the Algebraic Connectivity
p.3636

The Grid Task Attemper Layer Model Based on Agent Role
p.3641

Generalization Privacy Protection Method for Alarm Data
p.3646

Simulation and Algorithm of Network Public Opinion Based on a New Wavelet Threshold
p.3650

A Multiple Ring Fast Computing Method Based on MapReduce in Digraph
p.3655

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 543-547Research of Edge Centrality Based on the Algebraic...

Research of Edge Centrality Based on the Algebraic Connectivity

Abstract:

In connected graph, edge centrality represents the importance of edge and loading degree in the process of information transmission. The second eigenvalue of Laplacian matrix decides connectivity of complex networks. We propose edge centrality model and cut model based on minimization model of the algebraic connectivity. Edge centrality function is derived in order to calculate edge centrality. Cut model deletes k edges at an iteration whose algebraic connectivity of complex networks decreased fastest. Choice of k is based on edge sparse degree of complex networks. By empirical analysis of real network, the implications of edge with higher centrality and its vertex coincide with the fact. The model can be used in medium-size networks with lower time complexity and higher efficiency.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 543-547)

Pages:

3636-3640

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.543-547.3636

Citation:

Cite this paper

Online since:

March 2014

Authors:

En Jun Xing*, Fu Qiang Zhao, Shuo Zhang, Xin Yu Ge

Keywords:

Algebraic Connectivity, Complex Network, Edge Centrality, Fiedler Vector, Laplacian Matrix, Matrix Spectrum

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Aggarwal C C: An introduction to social network data analytics(Springer, US 2011).

Google Scholar

[2] Freeman, Linton C: Centrality in social networks conceptual clarification. Social networks Vol. 1-3 (1979) , pp.215-239.

DOI: 10.1016/0378-8733(78)90021-7

Google Scholar

[3] Merris, Russell. Laplacian matrices of graphs: a survey. Linear algebra and its applications Vol. 197 (1994), pp.143-176.

DOI: 10.1016/0024-3795(94)90486-3

Google Scholar

[4] Ghosh, Arpita, and Stephen Boyd: Growing well-connected graphs. Decision and Control, 2006 45th IEEE Conference on. IEEE (2006), pp.6605-6611.

DOI: 10.1109/cdc.2006.377282

Google Scholar

[5] Mohar, Bojan, and Y. Alavi: The Laplacian spectrum of graphs. Graph theory, combinatorics, and applications Vol. 2 (1991), pp.871-898.

Google Scholar

[6] Adamic, Lada A., and Natalie Glance: The political blogosphere and the 2004 US election: divided they blog. Proceedings of the 3rd international workshop on Link discovery. ACM(2005), pp.36-43.

DOI: 10.1145/1134271.1134277

Google Scholar

[7] Girvan, Michelle, and Mark EJ Newman: Community structure in social and biological networks. Proceedings of the National Academy of Sciences Vol. 99-12 (2002), pp.7821-7826.

DOI: 10.1073/pnas.122653799

Google Scholar