Edge- and vertex-reinforced random walks with super-linear reinforcement on infinite graphs

Add to your list(s) Download to your calendar using vCal

• Codina Cotar (University College London)
• Friday 16 December 2016, 11:45-12:30
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

SNAW04 - Dynamic networks

Co-author: Debleena Thacker (Lund University)

In this talk we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of vertex, traversals. The technique relies on upper bound estimates for the number of edge traversals, proved in a different context by Cotar and Limic [Ann. Appl. Probab. (2009)] for finite graphs with edge reinforcement. We apply our new method both to edge- and to vertex-reinforced random walks with super-linear reinforcement on arbitrary infinite connected graphs of bounded degree. We stress that, unlike all previous results for processes with super-linear reinforcement, we make no other assumption on the graphs.

For edge-reinforced random walks, we complete the results of Limic and Tarres [Ann. Probab. (2007)] and we settle a conjecture of Sellke [Technical Report 94-26, Purdue University (1994)] by showing that for any reciprocally summable reinforcement weight function w, the walk traverses a random attracting edge at all large times.

For vertex-reinforced random walks, we extend results previously obtained on Z by Volkov [Ann. Probab. (2001)] and by Basdevant, Schapira and Singh [Ann. Probab. (2014)], and on complete graphs by Benaim, Raimond and Schapira [ALEA (2013)]. We show that on any infinite connected graph of bounded degree, with reinforcement weight function w taken from a general class of reciprocally summable reinforcement weight functions, the walk traverses two random neighbouring attracting vertices at all large times.

Related Links

• https://arxiv.org/abs/1509.00807 - Webpage where the paper can be found

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Featured lists
• INI info aggregator
• Interested Talks
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.