150,619 Hits in 6.5 sec

Measuring the mixing time of social graphs

Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
2010 Proceedings of the 10th annual conference on Internet measurement - IMC '10  
To address this problem, we measure the mixing time of several social graphs, the time that it takes a random walk on the graph to approach the stationary distribution of that graph, using two techniques  ...  Our findings show that the mixing time of social graphs is much larger than anticipated, and being used in literature, and this implies that either the current security systems based on fast mixing have  ...  This research was supported by NSF grant CNS-0917154 and a research grant from Korea Advanced Institute of Science and Technology (KAIST).  ... 
doi:10.1145/1879141.1879191 dblp:conf/imc/MohaisenYK10 fatcat:ls54euclsnfapky7wqupta6o3y

Measuring bias in the mixing time of social graphs due to graph sampling

Abedelaziz Mohaisen, Pengkui Luo, Yanhua Li, Yongdae Kim, Zhi-Li Zhang
2012 MILCOM 2012 - 2012 IEEE Military Communications Conference  
In this paper we consider the bias of sampling algorithms on the mixing time.  ...  We quantitatively show that some existing sampling algorithms, even those which are unbiased to the degree distribution, always produce biased estimation of the mixing time of social graphs.  ...  the mixing time of real-world social graphs.  ... 
doi:10.1109/milcom.2012.6415714 dblp:conf/milcom/MohaisenLLKZ12 fatcat:nzmfb7xd6vfjtniz7ugnyox6zq

Understanding Social Networks Properties for Trustworthy Computing

Abedelaziz Mohaisen, Huy Tran, Nicholas Hopper, Yongdae Kim
2011 2011 31st International Conference on Distributed Computing Systems Workshops  
We relate the mixing time of social graphs to graph degeneracy, which captures cohesiveness of the graph.  ...  We extend our earlier results measuring the mixing time, to investigate a new property used for building Sybil defenses, namely the expansion of social graphs.  ...  Acknowledgement- We would like to thank Nguyen Tran for providing the code of Gatekeeper, and Alan Mislove and Ben Zhao for providing their social graphs used in this work.  ... 
doi:10.1109/icdcsw.2011.48 dblp:conf/icdcsw/MohaisenTHK11 fatcat:3esz42yepzatrpi23w4p5jrnzu

On the mixing time of directed social graphs and security implications

Abedelaziz Mohaisen, Huy Tran, Nicholas Hopper, Yongdae Kim
2012 Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security - ASIACCS '12  
In this paper we measure the mixing time and behavior of several directed graphs and their undirected counterparts.  ...  To relate to the applications suggested in the literature, we measure how directionality of edges in several social graphs impact these applications, and find that evaluation on the undirected graphs always  ...  This work has been supported by NSF grant CNS-0917154, a research grant from Korea Advanced Institute of Science and Technology, and a Doctoral Dissertation Fellowship from the graduate school of the University  ... 
doi:10.1145/2414456.2414476 dblp:conf/ccs/MohaisenTHK12 fatcat:73z4xxhfzvabhkraxk5lbbv7rq

An Analysis of Graph Properties for Detecting Sybil Nodes in Social Networks

Korkiat Kaewking, Sirapat Boonkrong
2018 Journal of ICT Research and Applications  
The results showed that the mixing time does not reflect the difference between honest graphs and Sybil graphs.  ...  This research also investigated the mixing time, which is one of the properties that many existing methods use for detecting Sybil attacks.  ...  This section will discuss the measurement of mixing time in detail. A social network can be expressed in the form of a graph.  ... 
doi:10.5614/itbj.ict.res.appl.2018.12.2.6 fatcat:vnfd3ebbebd4le5orfyqmmb5ny

Designs to account for trust in social network-based sybil defenses

Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
2010 Proceedings of the 17th ACM conference on Computer and communications security - CCS '10  
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs.  ...  While it is natural to think of trust value associated with the social graphs, Sybil defenses have used the social graphs without this consideration.  ...  Acknowledgement: This research was supported by the NSF under grant no. CNS-0917154 and a grant from Korea Advanced Institute of Science and Technology (KAIST). We thank Alan Mislove and Ben Y.  ... 
doi:10.1145/1866307.1866407 dblp:conf/ccs/MohaisenHK10 fatcat:ppfmtypblrf5hco7n7qdoutk4i

Keep your friends close: Incorporating trust into social network-based Sybil defenses

Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
2011 2011 Proceedings IEEE INFOCOM  
Social network-based Sybil defenses exploit the algorithmic properties of social graphs to infer the extent to which an arbitrary node in such a graph should be trusted.  ...  However, previous designs for social network-based Sybil defenses have not considered the inherent trust properties of the graphs they use.  ...  We first measure the mixing time of the social graphs used in this study (in Table I ) and highlight its variable nature among networks with similar size.  ... 
doi:10.1109/infcom.2011.5934998 dblp:conf/infocom/MohaisenHK11 fatcat:z42cyo6jr5fwzf43umnnc7zwsm

Methods and Measures for the Description of Epidemiologic Contact Networks

C. S. Riolo
2001 Journal of urban health  
The new social network measures are designed with an epidemiologic interpretation in mind.  ...  Network measures derived from transmission graphs include "source counts," which are defined as the number of prior relationships that could potentially transmit infection to a particular node or individual  ...  social network analysis measures to these epidemiologic networks  ... 
doi:10.1093/jurban/78.3.446 pmid:11564848 pmcid:PMC3455912 fatcat:s65tqzgpdbbtjarnixk34joj5a

Using Mixed Node Publication Network Graphs for Analyzing Success in Interdisciplinary Teams [chapter]

André Calero Valdez, Anne Kathrin Schaar, Martina Ziefle, Andreas Holzinger, Sabina Jeschke, Christian Brecher
2012 Lecture Notes in Computer Science  
In this paper we demonstrate how using mixed-node publication network graphs can be used in order to get insights into social structures of research groups.  ...  Furthermore we suggest applying the approach to a large research cluster as a method of self-management and enriching the graph with sociometric data to improve intelligibility of the graph.  ...  Ulrich Prahl and Eva Nick for generously supplying us with validated publication data of the CoE. This research was funded by the Excellence Initiative of the German federal and state governments.  ... 
doi:10.1007/978-3-642-35236-2_61 fatcat:cnqzwufmiffkdlw56l3cs2i7yu


Yushan Liu, Shouling Ji, Prateek Mittal
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
Currently, the design of such social security mechanisms is limited to the classical paradigm of using fixed-length random walks for all nodes on a social graph.  ...  We utilize a set of supervised machine learning techniques to predict the necessary random walk length based on the structural characteristics of a social graph.  ...  of the local mixing time in social networks.  ... 
doi:10.1145/2976749.2978319 dblp:conf/ccs/LiuJM16 fatcat:gumslqzrxzalpgq7mfp4cadbju

The Quality of Sampling from Geographic Networks

John Matta, Gunes Ercal, William Stimson
2016 International Journal of Distributed Sensor Networks  
Of independent interest is the measure we propose to evaluate the quality of sampling: the rate of decrease in the area of the largest empty circle remaining.  ...  The motivation for this work is that wireless and other physical networks do in fact have embedding of their nodes in space, although analyses of random walks on such networks often only consider the link  ...  The mixing time of a random walk is the analytical measure of the time it takes for a random walk to reach a truly random sample.  ... 
doi:10.1155/2016/7379030 fatcat:3lfvwxmgg5eyba6idws7yif5cu

Content-driven detection of campaigns in social media

Kyumin Lee, James Caverlee, Zhiyuan Cheng, Daniel Z. Sui
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
One of the salient aspects of the framework is an investigation of graph mining techniques for isolating coherent campaigns from large message-based graphs.  ...  We study the problem of detecting coordinated free text campaigns in large-scale social media.  ...  An edge (mix, mjy) ∈ E exists for every pair of messages (mix, mjy) where corr(mix, mjy) > τ , for a measure of correlation and some parameter τ . Definition 1 (Message Graph).  ... 
doi:10.1145/2063576.2063658 dblp:conf/cikm/LeeCCS11 fatcat:mrxc4xejbbhqrlspe6jtsjnf34

On the Quality of Sampling from Geographic Networks

Gunes Ercal, John Matta, William Stimson, Dominic Eccher
2013 Procedia Computer Science  
We ask in particular what factor most affects the sampling quality: The distribution of the nodes in the space or the connectivity structure of the links?  ...  We consider the problem of randomly sampling information from a network embedded in two-dimensional space, as characteristic of a physical network.  ...  The mixing time of a random walk is the analytical measure of the time it takes for a random walk to reach a truly random sample, technically the worst case time taken to reach the stationary distribution  ... 
doi:10.1016/j.procs.2013.09.313 fatcat:d6t2uqgnlnf3ndhv4km2i2ufs4

Quantifying social network dynamics

Radoslaw Michalski, Piotr Brodka, Przemyslaw Kazienko, Krzysztof Juszczyszyn
2012 2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)  
The following paper focuses on the definition of differences between network snapshots by means of Graph Differential Tuple.  ...  Four separate measures are suggested in the paper with experimental study on real social network data.  ...  ACKNOWLEDGMENT The work was partially supported by fellowship cofinanced by the European Union within the European Social Fund, The Polish Ministry of Science and Higher Education, the research project  ... 
doi:10.1109/cason.2012.6412380 dblp:conf/cason/MichalskiBKJ12 fatcat:peibwrgfy5gcdprjda6dch6i74

Network based models of infectious disease spread

Stephen Eubank
2005 Japanese journal of infectious diseases (Print)  
We describe the process of building a realistic social network, describe several different definitions of the network, each useful for certain purposes.  ...  This paper describes a model of epidemiology on a social network, the Epidemiological Simulation System (EpiSims), and offers general speculation on analyzing disease dynamics on networks.  ...  Yamamoto, and the National Institute of Infectious Diseases for providing us the opportunity to meet with other interesting modelers. This work was supported in part by a MIDAS grant from NIGMS.  ... 
pmid:16377861 fatcat:tx5xizufbvgavf6dmmxkk2f7vm
« Previous Showing results 1 — 15 out of 150,619 results