Related papers: A point process describing the component sizes in …

We present general results for the contact process by a method which applies to all transitive graphs of bounded degree, including graphs of exponential growth. The model's infection rates are varied through a control parameter, for which…

We study the point process $W$ in $\mathbb{R}^d$ obtained by adding an independent Gaussian vector to each point in $\mathbb{Z}^d$. Our main concern is the asymptotic size of fluctuations of the linear statistics in the large volume limit,…

Consider the random graph on $n$ vertices $1, ..., n$. Each vertex $i$ is assigned a type $X_i$ with $X_1, ..., X_n$ being independent identically distributed as a nonnegative discrete random variable $X$. We assume that ${\bf E}…

Suppose that you add rigid bars between points in the plane, and suppose that a constant fraction $q$ of the points moves freely in the whole plane; the remaining fraction is constrained to move on fixed lines called sliders. When does a…

Random directed graphs $D(n,p)$ undergo a phase transition around the point $p = 1/n$, and the width of the transition window has been known since the works of Luczak and Seierstad. They have established that as $n \to \infty$ when $p = (1…

Let $\mathcal{C}_1$ be the largest component of the Erd\H{o}s--R\'{e}nyi random graph $\mathcal{G}(n,p)$. The mixing time of random walk on $\mathcal {C}_1$ in the strictly supercritical regime, $p=c/n$ with fixed $c>1$, was shown to have…

In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the…

A joint limit theorem for the point process of the off-diagonal entries of a sample covariance matrix $\mathbf{S}$, constructed from $n$ observations of a $p$-dimensional random vector with iid components, and the Frobenius norm of…

The Moran process is a random process that models the spread of genetic mutations through graphs. If the graph is connected, the process eventually reaches "fixation", where every vertex is a mutant, or "extinction", where no vertex is a…

In this note we study the geometry of the largest component C_1 of critical percolation on a finite graph G which satisfies the finite triangle condition, defined by Borgs et al. There it is shown that this component is of size n^{2/3}, and…

We study the asymptotics of the $p$-mapping model of random mappings on $[n]$ as $n$ gets large, under a large class of asymptotic regimes for the underlying distribution $p$. We encode these random mappings in random walks which are shown…

Affine point processes are a class of simple point processes with self- and mutually-exciting properties, and they have found useful applications in several areas. In this paper, we obtain large-time asymptotic expansions in large…

Growth-fragmentation processes model systems of cells that grow continuously over time and then fragment into smaller pieces. Typically, on average, the number of cells in the system exhibits asynchronous exponential growth and, upon…

A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…

We consider $n$ independent random points uniformly distributed in the $d_n$-dimensional unit cube and study Pareto points, that is, points that do not coordinatewise dominate any other point. We identify the critical growth rate of $d_n$…

Finding the most powerful node in a dynamic random network, the largest set in a partition-valued stochastic process, or the largest family in an evolving population at a given time, can be a very difficult problem. This is particularly the…

We study the distribution of the 'gap time', the first time that a large gap appears, in the spatial birth and death point process on $[0,1]$ in which particles are added uniformly in space at rate $\lambda$ and are removed independently at…

We consider random walks on several classes of graphs and explore the likely structure of the vacant set, i.e. the set of unvisited vertices. Let \Gamma(t) be the subgraph induced by the vacant set of the walk at step t. We show that for…

We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…

The evolution of the largest component has been studied intensely in a variety of random graph processes, starting in 1960 with the Erd\"os-R\'enyi process. It is well known that this process undergoes a phase transition at n/2 edges when,…