# Upper tails of self-intersection local times of random walks: survey of proof techniques

Source: [Upper tails of self-intersection local times of random walks: survey of proof techniques](<https://www.sota2.com/research/paper/68fa4eee1e209131ce95f4ef>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T10:02:54.686Z

Authors: Wolfgang K\\"onig

Published: 2010-11-13T11:08:04.000Z

## Abstract

The asymptotics of the probability that the self-intersection local time of a random walk on $\\Z^d$ exceeds its expectation by a large amount is a fascinating subject because of its relation to some models from Statistical Mechanics, to large-deviation theory and variational analysis and because of the variety of the effects that can be observed. However, the proof of the upper bound is notoriously difficult and requires various sophisticated techniques. We survey some heuristics and some recently elaborated techniques and results. This is an extended summary of a talk held on the CIRM-conference on {\\it Excess self-intersection local times, and related topics} in Luminy, 6-10 Dec., 2010.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1011.3125>)

[PDF](<https://arxiv.org/pdf/1011.3125.pdf>)
