NDLI: Communication and security in random intersection graphs models

Content Provider	IEEE Xplore Digital Library
Author	Nikoletseas, S. Raptopoulos, C. Spirakis, P.G.
Copyright Year	2011
Description	Author affiliation: R.& A. Computer Technology Institute and University of Patras, Greece (Nikoletseas, S.; Spirakis, P.G.) \|\| R.& A. Computer Technology Institute, Patras, Greece (Raptopoulos, C.)
Abstract	In this work, we overview some results concerning communication combinatorial properties in random intersection graphs and uniform random intersection graphs. These properties relate crucially to algorithmic design for important problems (like secure communication and frequency assignment) in distributed networks characterized by dense, local interactions and resource limitations, such as sensor networks. In particular, we present and discuss results concerning the existence of large independent sets of vertices whp in random instances of each of these models. As the main contribution of our paper, we introduce a new, general model, which we denote G(V, χ, ƒ). In this model, V is a set of vertices and χ is a set of m vectors in $ℝ^{m}.$ Furthermore, ƒ is a probability distribution over the powerset $2^{χ}$ of subsets of χ. Every vertex selects a random subset of vectors according to the probability ƒ and two vertices are connected according to a general intersection rule depending on their assigned set of vectors. Apparently, this new general model seems to be able to simulate other known random graph models, by carefully describing its intersection rule.
Starting Page	1
Ending Page	6
File Size	245194
Page Count	6
File Format	PDF
ISBN	9781457703522
e-ISBN	9781457703515
e-ISBN	9781457703508
DOI	10.1109/WoWMoM.2011.5986170
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-06-20
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Social network services Euclidean distance Probabilistic logic Probability distribution Security Mathematical model Equations
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

LinkProbe: Probabilistic inference on large-scale social networks

A New Model for Probabilistic Polling on Social Network

Learning the Strength of the Factors Influencing User Behavior in Online Social Networks

Probabilistic Model Based Large-Scale Social Network Community Discovery Algorithm

Information security system survivability assessment method based on logical-probabilistic models

Social learning with bounded confidence and probabilistic neighbors

A Bayesian Hierarchical Approach for Exploratory Analysis of Communities and Roles in Social Networks

Predicting missing links in social networks with hierarchical dirichlet processes

A nonlinear programming model for a multi-facility location problem with a probabilistic line barrier

Communication and security in random intersection graphs models

Similar Documents

LinkProbe: Probabilistic inference on large-scale social networks

A New Model for Probabilistic Polling on Social Network

Learning the Strength of the Factors Influencing User Behavior in Online Social Networks

Probabilistic Model Based Large-Scale Social Network Community Discovery Algorithm

Information security system survivability assessment method based on logical-probabilistic models

Social learning with bounded confidence and probabilistic neighbors

A Bayesian Hierarchical Approach for Exploratory Analysis of Communities and Roles in Social Networks

Predicting missing links in social networks with hierarchical dirichlet processes

A nonlinear programming model for a multi-facility location problem with a probabilistic line barrier

Communication and security in random intersection graphs models