Zobrazeno 1 - 10
of 126
pro vyhledávání: '"Makowski, Armand M."'
Autor:
Makowski, Armand M., Pal, Siddharth
We discuss several limiting degree distributions for a class of random threshold graphs in the many node regime. This analysis is carried out under a weak assumption on the distribution of the underlying fitness variable. This assumption, which is sa
Externí odkaz:
http://arxiv.org/abs/1908.07066
Autor:
Qu, Sikai, Makowski, Armand M.
The multiplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model of certain classes of real-world networks. It is an instance of hidden graph models, and implements the plausible idea that network
Externí odkaz:
http://arxiv.org/abs/1901.09698
Autor:
Qu, Sikai, Makowski, Armand M.
The muliplicative attribute graph (MAG) model was introduced by Kim and Leskovec as a mathematically tractable model for networks where network structure is believed to be shaped by features or attributes associated with individual nodes. For large h
Externí odkaz:
http://arxiv.org/abs/1810.10114
Autor:
Pal, Siddharth, Makowski, Armand M.
In random graph models, the degree distribution of an individual node should be distinguished from the (empirical) degree distribution of the graph that records the fractions of nodes with given degree. We introduce a general framework to explore whe
Externí odkaz:
http://arxiv.org/abs/1710.11064
Autor:
Izagirre, Ane, Makowski, Armand M.
We consider a multi-server queueing system under the power-of-two policy with Poisson job arrivals, heterogeneous servers and a general job requirement distribution; each server operates under the first-come first-serve policy and there are no buffer
Externí odkaz:
http://arxiv.org/abs/1701.06004
Autor:
Yağan, Osman, Makowski, Armand M.
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse as recommen
Externí odkaz:
http://arxiv.org/abs/1701.03758
Autor:
Makowski, Armand M., Yağan, Osman
We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key graph and
Externí odkaz:
http://arxiv.org/abs/1510.02939
Autor:
Yagan, Osman, Makowski, Armand M.
In the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, this offline pairwise key dist
Externí odkaz:
http://arxiv.org/abs/1103.4401
Autor:
Yagan, Osman, Makowski, Armand M.
Publikováno v:
IEEE Transactions on Information Theory, Volume: 59, Issue: 3, Pages: 1740-1760, March 2013
We investigate the secure connectivity of wireless sensor networks under the pairwise key distribution scheme of Chan et al.. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communicatio
Externí odkaz:
http://arxiv.org/abs/1102.2250
Autor:
Yagan, Osman, Makowski, Armand M.
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of trian
Externí odkaz:
http://arxiv.org/abs/0910.0499