@inproceedings{b2c3dad5e8b44f5b80104d20b3899312,

title = "Doubly threshold graphs for social network modeling",

abstract = "Threshold graphs are recursive deterministic network models that capture properties of certain social and economic interactions. One drawback of these graph families is that they they have limited constrained generative attachment rules. To mitigate this problem, we introduce a new class of graphs termed Doubly Threshold (DT) graphs which may be succinctly described through vertex weights that govern the existence of edges via two inequalities. One inequality imposes the constraint that the sum of weights of adjacent vertices has to exceed a specified threshold. The second inequality ensures that adjacent vertices have a bounded difference of their weights. We provide a succinct characterization and decomposition of DT graphs and analyze their forbidden induced subgraphs which we compare to those of known social networks. We also present a method for performing vertex weight assignments on DT graphs that satisfy the defining constraints.",

author = "Vida Ravanmehr and Sadegh Bolouki and Puleo, {Gregory J.} and Olgica Milenkovic",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 2016 IEEE Information Theory Workshop, ITW 2016 ; Conference date: 11-09-2016 Through 14-09-2016",

year = "2016",

month = oct,

day = "21",

doi = "10.1109/ITW.2016.7606830",

language = "English (US)",

series = "2016 IEEE Information Theory Workshop, ITW 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "231--235",

booktitle = "2016 IEEE Information Theory Workshop, ITW 2016",

address = "United States",

}