Dr. Armand M. Makowski of the Department of Electrical and Computer Engineering, and Institute for Systems Research, University of Maryland

In random graph models, the degree distribution of individual nodes should be contrasted with the degree distribution of the graph, i.e., the usual fractions of nodes with given degree. A general framework is introduced to discuss conditions under which these two  degree distributions coincide asymptotically. Somewhat surprisingly, we show that this assumption may fail to hold, even in strongly homogeneous random networks. This counterexample can be found  in the class of random threshold graphs. An interesting implication of this finding is that random threshold graphs cannot be used as a substitute for the Barab\'asi-Albert model, a claim made in the literature.

Biography:

Armand M. Makowski received the Licence en Sciences Mathematiques from the Universite Libre de Bruxelles in 1975, the M.S. degree in Engineering-Systems Science from U.C.L.A. in 1976 and the Ph.D. degree in Applied Mathematics from the University of Kentucky in 1981. In August 1981, he joined the faculty of the Electrical Engineering Department at the University of Maryland College Park, where he is Professor of Electrical and Computer Engineering. He has held a joint appointment with the Institute for Systems Research since its establishment in 1985.

Armand Makowski was a C.R.B. Fellow of the Belgian-American Educational Foundation (BAEF) for the academic year 1975-76; he is also a 1984 recipient of the NSF Presidential Young Investigator Award. He became an IEEE Fellow in 2006, and received a Lady Davis Trust Fellowship in Fall 2014. His research interests lie in applying advanced methods from the theory of stochastic processes to the modeling, design and performance evaluation of engineering systems, with particular emphasis on communication systems and networks. This includes: Asymptotic methods for the performance evaluation of switching systems, long-range traffic modeling for multimedia applications in high-speed networks, many-flow asymptotics for TCP modeling, modeling locality of reference in caching systems, applications of swarm intelligence to networking, and resource allocation issues in wireless networks (e.g., handoffs and paging). His more recent work has focused on random graph modeling for random key pre-distribution in wireless sensor networks.

Address:National Electronics Museum, , United States

Dr. Armand M. Makowski of the Department of Electrical and Computer Engineering, and Institute for Systems Research, University of Maryland

Biography:

Address:United States