BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:US/Eastern
BEGIN:DAYLIGHT
DTSTART:20170312T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20171105T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20170427T131724Z
UID:9937E031-2B4B-11E7-8752-0050568D2FB3
DTSTART;TZID=US/Eastern:20170516T173000
DTEND;TZID=US/Eastern:20170516T190000
DESCRIPTION: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 distributio
 ns coincide asymptotically. Somewhat surprisingly\, we show that this assu
 mption may fail to hold\, even in strongly homogeneous random networks. Th
 is counterexample can be found in the class of random threshold graphs. An
  interesting implication of this finding is that random threshold graphs c
 annot be used as a substitute for the Barab\\'asi-Albert model\, a claim m
 ade in the literature.\n\nSpeaker(s): Dr. Armand M. Makowski \, \, Dr. Arm
 and M. Makowski \, \n\nAgenda: \n5:30 Social 6:00 Presentation\n\nRoom: Co
 nference Room\, Bldg: National Electronics Museum\, 1745 W. Nursery Road\,
  Linthicum\, Maryland\, United States\, 21090 
LOCATION:Room: Conference Room\, Bldg: National Electronics Museum\, 1745 W
 . Nursery Road\, Linthicum\, Maryland\, United States\, 21090 
ORGANIZER:steven.dambrosio@jhuapl.edu
SEQUENCE:1
SUMMARY:Degree distributions in large networks: A little theory and a count
 erexample
URL;VALUE=URI:https://events.vtools.ieee.org/m/45275
X-ALT-DESC:Description: <br /><p>In random graph models\, the&nbsp\;degree&
 nbsp\;distribution of individual nodes should be contrasted with the&nbsp\
 ;degree&nbsp\;distribution of the graph\,&nbsp\;i.e.\, the usual fractions
  of nodes with given&nbsp\;degree.&nbsp\;A general framework is introduced
  to discuss conditions under which these two &nbsp\;degree&nbsp\;distribut
 ions coincide asymptotically.&nbsp\;Somewhat surprisingly\, we show that t
 his assumption may fail to hold\, even in strongly homogeneous random netw
 orks.&nbsp\;This counterexample can be found &nbsp\;in the class of random
  threshold graphs.&nbsp\;An interesting implication of this finding is tha
 t random threshold graphs cannot be used as a substitute for the Barab\\'a
 si-Albert model\,&nbsp\;a claim made in the literature.</p><br /><br />Age
 nda: <br /><p>5:30 Social 6:00 Presentation</p>
END:VEVENT
END:VCALENDAR