Abstract
Our aim here is to address the problem of decomposing a whole network into a minimal number of ego–centered subnetworks. For this purpose, the network egos are picked out as the members of a minimum dominating set of the network. However, to find such an efficient dominating ego–centered construction, we need to be able to detect all the minimum dominating sets and to compare all the corresponding dominating ego–centered decompositions of the network. To find all the minimum dominating sets of the network, we are developing a computational heuristic, which is based on the partition of the set of nodes of a graph into three subsets, the always dominant vertices, the possible dominant vertices and the never dominant vertices, when the domination number of the network is known. To compare the ensuing dominating ego–centered decompositions of the network, we are introducing a number of structural measures that count the number of nodes and links inside and across the ego–centered subnetworks. Furthermore, we are applying the techniques of graph domination and ego–centered decomposition for six empirical social networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P.V. Marsden, in Models and Methods in Social Network Analysis, edited by P.J. Carrington, J. Scott, S. Wasserman (Cambridge University Press, New York, 2005)
S. Wasserman, K. Faust, Social Network Analysis: Methods and Applications (Cambridge University Press, Cambridge, UK, 1994)
N , Crossley, E. Bellotti, G. Edwards, M.G. Everett, J. Koskinen, M. Tranmer, Social Network Analysis for Ego-Nets (Sage Publications, London, 2015)
T.W. Smith, P.V. Marsden, M. Hout, J. Kim, in General social surveys, 19722010: cumulative codebook (National Opinion Research Center, Chicago, IL., 2011)
P.V. Marsden, in The Sage Handbook of Social Network Analysis, edited by J. Scott, P.J. Carrington (Sage Publications, London, 2011)
P.V. Marsden, Soc. Networks 24, 407 (2002)
D.M. Kirke, Soc. Networks 18, 333 (1996)
S.P. Borgatti, Comput. Math. Organiz. Theor. 12, 21 (2006)
D.S. Johnson, J. Comput. Syst. Sci. 9, 256 (1974)
T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs (Marcel Dekker, New York, 1998)
C. Berge, Graphs and Hypergraphs (North–Holland, Amsterdam, 1973)
O. Ore, Theory of Graphs Amer. Math. Soc. Colloq. Publ., 38 (Amer. Math. Soc., Providence, R.I., 1962)
G. Gunther, B. Hartnell, I.R. Markus, D. Rall, Congr. Numer. 101, 55 (1994)
W.A. Stein and others, Sage Mathematics Software, version 6.3 (The Sage Developers, 2011, http://www.sagemath.org)
P. Hage, F. Harary, Island Networks: Communication, Kinship, and Classification Structures in Oceania (Cambridge University Press, Cambridge, UK, 1996)
D. Krackhardt, Admin. Sci. Quart. 35, 342 (1990)
R. Breiger, P. Pattison, Soc. Networks 8, 215 (1986)
W.A. Zachary, J. Anthropol. Res. 33, 452 (1977)
A. Davis, B.B. Gardner, M.R. Gardner, Deep South (The University of Chicago Press, Chicago, 1941)
D.E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing (Addison-Wesley, Reading, MA., 1993)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Boudourides, M., Lenis, S. Dominating sets and ego–centered decompositions in social networks. Eur. Phys. J. Spec. Top. 225, 1293–1310 (2016). https://doi.org/10.1140/epjst/e2016-02673-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1140/epjst/e2016-02673-0