BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Eurandom - ECPv5.1.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Eurandom
X-ORIGINAL-URL:https://www.eurandom.tue.nl
X-WR-CALDESC:Events for Eurandom
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=UTC:20190415T100000
DTEND;TZID=UTC:20190415T143000
DTSTAMP:20200804T000117
CREATED:20190403T114325Z
LAST-MODIFIED:20190410T123323Z
UID:2560-1555322400-1555338600@www.eurandom.tue.nl
SUMMARY:Lecture day on the occasion of visit Ravi Kumar
DESCRIPTION:\nSummary\nRavi Kumar (Google) will visit the Netherlands\, April 15-18. There will be a lecture day to mark this visit. Held at Eurandom on Monday April 15th. \n \nSponsor\n \nSpeakers\n\n\n\nLuca Avena\nLeiden University\n\n\nRemco van der Hofstad\nTU Eindhoven\n\n\nJulia Komjathy\nTU Eindhoven\n\n\nRavi Kumar\nGoogle\n\n\n\n \nProgram \n\n\nTime Schedule Lecture day \n \nMore information\nFor questions please contact Nelly Litvak \n \nAbstracts\nLuca Avena \nNetwork data-sets: randomized decomposition through forests and some related tools \nI will discuss some probabilistic tools and related randomized algorithms to explore the architecture of a data set stored in a network structure (an arbitrary weighted finite graph).\nThe core idea is to decompose the network in a randomized multiscale fashion by using certain spanning rooted forests.\nThese objects are related to fundamental algebraic and probabilistic structures of a given weighted graph (or of the associated adjacency matrix).\nThe applications I will present include:1) a procedure for downsampling sets of well-distributed nodes/vertices 2) coarse-graining or reduction schemes 3) pyramidal wavelets-like algorithms to process signals on graphs.\n(joint work with Fabienne Castell\, Alexandre Gaudilliere and Clothilde Melot) \n \nRemco van der Hofstad \n\nRelating structure and function of complex networks \n\n\nMany phenomena in the real world can be phrased in terms of networks. Examples include the World-Wide Web\, social interactions and Internet\, but also the interaction patterns between proteins\, food webs and citation networks. Many large-scale networks have\, despite their diversity in backgrounds\, surprisingly much in common. Many of these networks are small worlds\, in the sense that one requires few links to hop between pairs of vertices. Also the variability of the number of connections between elements tends to be enormous\, which is related to the scale-free phenomenon.\nWe are interested in the relations between the structure of complex networks and their functionality. Complex networks are generally modeled by random graphs\, while their functionality is described in terms of stochastic processes living on them (such as information diffusion)\, or algorithms acting on them (such as PageRank). There obviously are strong relations between the structure of networks\, such as their degree or community structures\, and the behavior of stochastic processes and algorithms on them.\nIn this lecture\, we describe a few real-world networks and some of their empirical properties\, as well as some of the simple models for them. We then give examples of how the degree distribution determines graph distances in some random graph models\, and the behavior of stochastic processes such as percolation and rumor spread. We also discuss the behavior of two algorithms\, PageRank and assortativity. We speculate on how models can be improved to better describe real-world networks\, and on how this can change their functionality. Time permitting\, we discuss the real-world example of citation networks. \n \n\nJulia Komjathy \nShort weighted distances in scale-free spatial random graphs\nIn the talk we describe the connection between two network models\, and study distances in both models: hyperbolic random graphs (HRG)\, and geometric inhomogeneous random graphs (GIRG). In HRGs\, n=Θ(eR/2) vertices are sampled independently from the hyperbolic disk with radius R and two vertices are connected either when they are within hyperbolic distance R\, or independently with a probability depending on the hyperbolic distance. In GIRGs\, each vertex is given an independent weight and location from an underlying measured metric space and Zd\, respectively\, and two vertices are connected independently with a probability that is a function of their distance and weights. We describe a transformation that maps HRGs to a specific GIRG.\nIn the second part of the talk\, we assign i.i.d. weights to the edges of the random graphs and study the weighted distance between two uniformly chosen vertices.\nIn particular\, we study the case when the parameters are so that the degree distribution in the graph follows a power law with exponent τ∈(2\,3) (infinite variance)\, and the edge-weight distribution is such that it produces an explosive age-dependent branching process with power-law offspring distribution. We show that in both models\, typical distances within the giant component converge in distribution as the number of vertices tends to infinity\, in particular\, they do not tend to infinity with the size of the network.\nThis simplified model can explain why some videos\, memes\, etc can spread very quickly on the internet. \n\n \n\nRavi Kumar \nRandom Walks and Network Properties\nA random walk is a natural way to explore a network. We will study the use of uniform random walks to estimate various properties such as the size of the network\, average degree\, number of triangles\, etc.\nLess obvious random walks can also be designed to do other tasks such as uniformly generating a node or counting network motifs. However\, our perspective is that one has to be careful in using random walks for applications. \n\n \n\nPractical Information\n● Venue\nEurandom\, Mathematics and Computer Science Department\, TU Eindhoven\, \nDe Groene Loper 5\, 5612 AE EINDHOVEN\, The Netherlands \nEurandom is located on the campus of Eindhoven University of Technology\, in the MetaForum building\, 4th floor (more about the building). The university is located at 10 minutes walking distance from Eindhoven main railway station (take the exit north side and walk towards the tall building on the right with the sign TU/e).\nAccessibility TU/e campus and map. \n● Conference facilities \nConference room\, MetaForum Building “MF 11 & 12”.\nThe meeting-room is equipped with a data projector\, an overhead projector\, a projection screen and a blackboard. Please note that speakers and participants giving an oral presentation are kindly requested to bring their own laptop or their presentation on a memory stick. \n● Conference Secretariat\nUpon arrival\, participants should register with the workshop officer\, and collect their name badges. The workshop officer will be present for the duration of the conference\, taking care of the administrative aspects and the day-to-day running of the conference: registration\, issuing certificates and receipts\, etc. \n● Cancellation\nShould you need to cancel your participation\, please contact Patty Koorn\, the Workshop Officer. \n● Contact\nMrs. Patty Koorn\, Workshop Officer\, Eurandom/TU Eindhoven\, koorn@eurandom.tue.nl \n \n \n \n \n \n \n\n
URL:https://www.eurandom.tue.nl/event/lecture-day-on-the-occasion-of-visit-ravi-kumar/
LOCATION:MF 11-12 (4th floor MetaForum Building\, TU/e)
CATEGORIES:Lecture Day
END:VEVENT
END:VCALENDAR