Related papers: Logarithmic corrections to scaling in the four-dim…

We simulate loop-erased random walks on simple (hyper-)cubic lattices of dimensions 2,3, and 4. These simulations were mainly motivated to test recent two loop renormalization group predictions for logarithmic corrections in $d=4$,…

We establish both the $\limsup$ and the $\liminf$ law of the iterated logarithm (LIL), for the capacity of the range of a simple random walk in any dimension $d\ge 3$. While for $d \ge 4$, the order of growth in $n$ of such LIL at dimension…

We study numerically the dynamical properties of the BTW model on a square lattice for various dimensions. The aim of this investigation is to determine the value of the upper critical dimension where the avalanche distributions are…

We study the trace of the incipient infinite oriented branching random walk in $\mathbb{Z}^d \times \mathbb{Z}_+$ when the dimension is $d = 6$. Under suitable moment assumptions, we show that the electrical resistance between the root and…

Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…

We examine self-avoiding walks in dimensions 4 to 8 using high-precision Monte-Carlo simulations up to length N=16384, providing the first such results in dimensions $d > 4$ on which we concentrate our analysis. We analyse the scaling…

Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…

We show that $(n,d,\lambda)$-graphs with $\lambda=O(d/\log^3 n)$ are universal with respect to all bounded degree spanning trees. This significantly improves upon the previous best bound due to Han and Yang of the form…

The average node-to-node distance of scale-free graphs depends logarithmically on N, the number of nodes, while the probability distribution function (pdf) of the distances may take various forms. Here we analyze these by considering…

For a complete graph of size $n$, assign each edge an i.i.d. exponential variable with mean $n$. For $\lambda>0$, consider the length of the longest path whose average weight is at most $\lambda$. It was shown by Aldous (1998) that the…

The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…

For the last passage percolation (LPP) on $\mathbb{Z}^2$ with exponential passage times, let $T_{n}$ denote the passage time from $(1,1)$ to $(n,n)$. We investigate the law of iterated logarithm of the sequence $\{T_{n}\}_{n\geq 1}$; we…

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

Let x and y be chosen uniformly in a graph G. We find the limiting distribution of the length of a loop-erased random walk from x to y on a large class of graphs that include the discrete torus in dimensions 5 and above. Moreover, on this…

We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for uniform spanning trees on every finite Sierpinski graph and…

Phylogenetic trees constitute an interesting class of objects for stochastic processes due to the non-standard nature of the space they inhabit. In particular, many statistical applications require the construction of Markov processes on…

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

We consider the branching capacity of the range of a simple random walk on $\mathbb Z^d$, with $d \ge 5$, and show that it falls in the same universality class as the volume and the capacity of the range of simple random walks and branching…

We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…

We use a discrete worldline representation in order to study the continuum limit of the one-loop expectation value of dimension two and four local operators in a background field. We illustrate this technique in the case of a scalar field…