<--- Back to Details
First PageDocument Content
Social networks / Mathematics / Statistics / Network theory / Barabási–Albert model / Network analysis / Network topology / Bayesian network / Network science / Graph theory / Networks / Random graphs
Date: 2014-09-27 18:37:25
Social networks
Mathematics
Statistics
Network theory
Barabási–Albert model
Network analysis
Network topology
Bayesian network
Network science
Graph theory
Networks
Random graphs

Node discovery problem for a social network

Add to Reading List

Source URL: www.insna.org

Download Document from Source Website

File Size: 490,58 KB

Share Document on Facebook

Similar Documents

Unfolding Crime Scenarios with Variations: A Method for Building a Bayesian Network for Legal Narratives Charlotte S. VLEK a,1 , Henry PRAKKEN b,c , Silja RENOOIJ b and Bart VERHEIJ a,d a Institute of Artificial Intellig

DocID: 1uDKU - View Document

Network Theory III: Bayesian Networks, Information and Entropy John Baez, Brendan Fong, Tobias Fritz, Tom Leinster Given finite sets X and Y , a stochastic map f : X Y assigns a

DocID: 1umlL - View Document

From Arguments to Constraints on a Bayesian Network a Floris BEX a , Silja RENOOIJ a Information and Computing Sciences, Utrecht University, The Netherlands

DocID: 1tDUV - View Document

3.3. Independencies in Graphs Algorithm 3.1 Algorithm for finding nodes reachable from X given Z via active trails Procedure Reachable ( G, // Bayesian network graph X, // Source variable

DocID: 1tiRB - View Document

Bayesian Network Automata for Modelling Unbounded Structures James Henderson Department of Computer Science University of Geneva Geneva, Switzerland

DocID: 1t04K - View Document