Related papers: Extremal Paths on a Random Cayley Tree
Random walk on changing graphs is considered. For sequences of finite graphs increasing monotonically towards a limiting infinite graph, we establish transition probability upper bounds. It yields sufficient transience criteria for simple…
An index of uniformity is developed as an alternative to the maximum-entropy principle for selecting continuous, differentiable probability distributions $\mathcal{P}$ subject to constraints $C$. The uniformity index developed in this paper…
Motivated by low energy consumption in geographic routing in wireless networks, there has been recent interest in determining bounds on the length of edges in the Delaunay graph of randomly distributed points. Asymptotic results are known…
We consider a random walk on a Galton-Watson tree whose offspring distribution has a regular varying tail of order $\kappa\in (1,2)$. We prove the convergence of the renormalised height function of the walk towards the continuous-time…
The article studies the almost surely asymptotics of extreme values $\bar{\xi}_n = \max_{1\leq i \leq n} \xi_i$, where $ \xi , \xi_1 , \xi_2 , \ldots$ are discrete identically distributed random variables. One of the main results on this…
An electrical network with the structure of a random tree is considered: starting from a root vertex, in one iteration each leaf (a vertex with zero or one adjacent edges) of the tree is extended by either a single edge with probability $p$…
We consider a random walk in an i.i.d. non-negative potential on the d-dimensional integer lattice. The walk starts at the origin and is conditioned to hit a remote location y on the lattice. We prove that the expected time under the…
We study a natural analogue of Ulam's problem for random rooted trees distributed according to a Plancherel-type measure. This probability measure is closely related to the classical Plancherel measure on integer partitions. For a…
We study the random m-ary search tree model (where m stands for the number of branches of a search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain…
We prove almost sure convergence of the maximum degree in an evolving tree model combining local choice and preferential attachment. At each step in the growth of the graph, a new vertex is introduced. A fixed, finite number of possible…
The Levy-type distributions are derived using the principle of maximum Tsallis nonextensive entropy both in the full and half spaces. The rates of convergence to the exact Levy stable distributions are determined by taking the N-fold…
The Eulerian extension number of any graph~\(H\) (i.e. the minimum number of edges needed to be added to make~\(H\) Eulerian) is at least~\(t(H),\) half the number of odd degree vertices of~\(H.\) In this paper we consider an inhomogenous…
We study the arboricity A and the maximum number T of edge-disjoint spanning trees of the Erdos-Renyi random graph G(n,p). For all p(n) in [0,1], we show that, with high probability, T is precisely the minimum between delta and…
In this article, we consider a branching random walk on the real-line where displacements coming from the same parent have jointly regularly varying tails. The genealogical structure is assumed to be a supercritical Galton-Watson tree,…
We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…
Random forests construct each tree with a different, randomised representation of the feature space. Their uniform voting cannot correct errors in regions where trees with incorrect representations probabilistically outnumber correct ones,…
We study first passage percolation on the configuration model (CM) having power-law degrees with exponent $\tau\in [1,2)$. To this end we equip the edges with exponential weights. We derive the distributional limit of the minimal weight of…
Let F be a distribution function with negative mean and regularly varying right tail. Under a mild smoothness condition we derive higher order asymptotic expansions for the tail distribution of the maxima of the random walk generated by F.…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…