Abstract
We propose the notion of k-integration as a measure of equality of opportunity in social networks. A social network is k-integrated if there is a path of length at most k between any two individuals, thus guaranteeing that everybody has the same network opportunities to find a job, a romantic partner, or valuable information. We compute the minimum number of bridges (i.e. edges between nodes belonging to different components) or central nodes (those which are endpoints to a bridge) required to ensure k-integration. The answer depends only linearly on the size of each component for k=2, and does not depend on the size of each component for k≥3. Our findings provide a simple and intuitive way to compare the equality of opportunity of real-life social networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
