Related papers: Depth of vertices with high degree in random recur…

The convergence of a sequence of point processes with dependent points, defined by a symmetric function of iid high-dimensional random vectors, to a Poisson random measure is proved. This also implies the convergence of the joint…

Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…

We study a continuous-time simple random walk on a regular rooted tree of depth $n$ in two settings: either the walk is started from a leaf vertex and run until the tree root is first hit or it is started from the root and run until it has…

Let $b$ be an integer greater than 1 and let $W^{\ee}=(W^{\ee}_n; n\geq 0)$ be a random walk on the $b$-ary rooted tree $\U_b$, starting at the root, going up (resp. down) with probability $1/2+\epsilon$ (resp. $1/2 -\epsilon$), $\epsilon…

Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…

A well-known open problem on the behavior of optimal paths in random graphs in the strong disorder regime, formulated by statistical physicists, and supported by a large amount of numerical evidence over the last decade [31,32,38,70] is as…

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

Consider~\(n\) nodes~\(\{X_i\}_{1 \leq i \leq n}\) independently distributed in the unit square~\(S,\) each according to a distribution~\(f.\) Nodes~\(X_i\) and~\(X_j\) are joined by an edge if the Euclidean distance~\(d(X_i,X_j)\) is less…

We study random unrooted plane trees with $n$ vertices sampled according to the weights corresponding to the vertex-degrees. Our main result shows that if the generating series of the weights has positive radius of convergence, then this…

In this paper we address the problem of testing whether two observed trees $(t,t')$ are sampled either independently or from a joint distribution under which they are correlated. This problem, which we refer to as correlation detection in…

We comment on old and new results related to the destruction of a random recursive tree (RRT), in which its edges are cut one after the other in a uniform random order. In particular, we study the number of steps needed to isolate or…

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…

We derive large- and moderate-deviation results in random networks given as planar directed navigations on homogeneous Poisson point processes. In this non-Markovian routing scheme, starting from the origin, at each consecutive step a…

We study level statistics in ensembles of integrable $N\times N$ matrices linear in a real parameter $x$. The matrix $H(x)$ is considered integrable if it has a prescribed number $n>1$ of linearly independent commuting partners $H^i(x)$…

We consider fully connected and feedforward deep neural networks with dependent and possibly heavy-tailed weights, as introduced in [26], to address limitations of the standard Gaussian prior. It has been proved in [26] that, as the number…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

It has been shown by Ibragimov and Zaporozhets [In Prokhorov and Contemporary Probability Theory (2013) Springer] that the complex roots of a random polynomial $G_n(z)=\sum_{k=0}^n\xi_kz^k$ with i.i.d. coefficients $\xi_0,\ldots,\xi_n$…