The longest path in a random graph

A random graph with (1+ε)n/2 edges contains a path of lengthcn. A random directed graph with (1+ε)n edges contains a directed path of lengthcn. This settles a conjecture of Erdõs.     

Sandwiching random graphs: universality between random graph models

The goal of this paper is to establish a connection between two classical models of random graphs: the random graph G(n,p) and the random regular graph G_d(n). This connection appears to be very useful in deriving properties of one model from the other and explains why many graph invariants are universal. In particular, one obtains one-line proofs of several highly non-trivial and recent results on G_d(n).     

On asymptotics for Vaserstein coupling of Markov chains

We prove that strong ergodicity of a Markov process is linked with a spectral radius of a certain “associated” semigroup operator, although, not a “natural” one. We also give sufficient conditions for weak ergodicity and provide explicit estimates of the convergence rate. To establish these results we construct a modification of the Vaserstein coupling. Some applications including mixing properties are also discussed.     

The chromatic number of random graphs at the double-jump threshold

A crucial step in the Erdös-Rényi (1960) proof that the double-jump threshold is also the planarity threshold for random graphs is shown to be invalid. We prove that whenp=1/n, almost all graphs do not contain a cycle with a diagonal edge, contradicting Theorem 8a of Erdös and Rényi (1960). As a consequence, it is proved that the chromatic number is 3 for almost all graphs whenp=1/n.Research supported U.S. National Science Foundation Grants DMS-8303238 and DMS-8403646. The research was conducted on an exchange visit by Professor Wierman to Poland supported by the national Academy of Sciences of the USA and the Polish Academy of Sciences.     

Potential analysis for positive recurrent Markov chains with asymptotically zero drift: Power-type asymptotics

We consider a positive recurrent Markov chain on R⁺${\mathbb{R}}^{+}$ with asymptotically zero drift which behaves like −_c1/x$-c_1/x$ at infinity; this model was first considered by Lamperti. We are interested in tail asymptotics for the stationary measure. Our analysis is based on construction of a harmonic function which turns out to be regularly varying at infinity. This harmonic function allows us to perform non-exponential change of measure. Under this new measure Markov chain is transient with drift like _c2/x$c_2/x$ at infinity and we compute the asymptotics for its Green function. Applying further the inverse transform of measure we deduce a power-like asymptotic behaviour of the stationary tail distribution. Such a heavy-tailed stationary measure happens even if the jumps of the chain are bounded. This model provides an example where possibly bounded input distributions produce non-exponential output.     

The energy of random graphs

In 1970s, Gutman introduced the concept of the energy E(G) for a simple graph G, which is defined as the sum of the absolute values of the eigenvalues of G. This graph invariant has attracted much attention, and many lower and upper bounds have been established for some classes of graphs among which bipartite graphs are of particular interest. But there are only a few graphs attaining the equalities of those bounds. We however obtain an exact estimate of the energy for almost all graphs by Wigner’s semi-circle law, which generalizes a result of Nikiforov. We further investigate the energy of random multipartite graphs by considering a generalization of Wigner matrix, and obtain some estimates of the energy for random multipartite graphs.     

The diameter of random regular graphs

We give asymptotic upper and lower bounds for the diameter of almost everyr-regular graph onn vertices (n → ∞).     

Some large deviation results for sparse random graphs

Summary. We obtain a large deviation principle (LDP) for the relative size of the largest connected component in a random graph with small edge probability. The rate function, which is not convex in general, is determined explicitly using a new technique. The proof yields an asymptotic formula for the probability that the random graph is connected. We also present an LDP and related result for the number of isolated vertices. Here we make use of a simple but apparently unknown characterisation, which is obtained by embedding the random graph in a random directed graph. The results demonstrate that, at this scaling, the properties `connected' and `contains no isolated vertices' are not asymptotically equivalent. (At the threshold probability they are asymptotically equivalent.) Received: 14 November 1996 / In revised form: 15 August 1997     

Itô’s excursion theory and random trees

We explain how Itô’s excursion theory can be used to understand the asymptotic behavior of large random trees. We provide precise statements showing that the rescaled contour of a large Galton–Watson tree is asymptotically distributed according to Itô’s excursion measure. As an application, we provide a simple derivation of Aldous’ theorem stating that the rescaled contour function of a Galton–Watson tree conditioned to have a fixed large progeny converges to a normalized Brownian excursion. We also establish a similar result for a Galton–Watson tree conditioned to have a fixed large height.     

The concentration of the chromatic number of random graphs

We prove that for every constant >0 the chromatic number of the random graphG(n, p) withp=n ^–1/2– is asymptotically almost surely concentrated in two consecutive values. This implies that for any <1/2 and any integer valued functionr(n)O(n ) there exists a functionp(n) such that the chromatic number ofG(n,p(n)) is preciselyr(n) asymptotically almost surely.Research supported in part by a USA Israeli BSF grant and by a grant from the Israel Science Foundation.Research supported in part by a Charles Clore Fellowship.     

Simulating tail asymptotics of a Markov chain

This paper develops a rare event simulation algorithm for a discrete-time Markov chain in the first orthant. The algorithm gives a very good estimate of the stationary distribution along one of the axes and it is shown to be efficient. A key idea is to study an associated time reversed Markov chain that starts at the rare event. We will apply the algorithm to a Markov chain related to a Jackson network with two stations.     

Limit laws for UGROW random graphs

Representations are found for a limit law L(Z(k,p))$L\left(Z(k,p)\right)$ obtained from an expanding sequence of random forests containing n$n$ nodes with p∈(0,1]$p\in (0,1]$ a probability controlling bond formation. One implies that Z(k,p)$Z(k,p)$ is stochastically decreasing as k$k$ increases and that norming gives an exponential limit law. Limit theorems are given for the order of component trees. The proofs exploit properties of the gamma function.     

Long paths in sparse random graphs

We consider random graphs withn labelled vertices in which edges are chosen independently and with probabilityc/n. We prove that almost every random graph of this kind contains a path of length ≧(1 −α(c))n where α(c) is an exponentially decreasing function ofc. Dedicated to Tibor Gallai on his seventieth birthday     

Automorphisms of random graphs with specified vertices

Conditions are found under which the expected number of automorphisms of a large random labelled graph with a given degree sequence is close to 1. These conditions involve the probability that such a graph has a given subgraph. One implication is that the probability that a random unlabelledk-regular simple graph onn vertices has only the trivial group of automorphisms is asymptotic to 1 asn → ∞ with 3≦k=O(n ^1/2−c). In combination with previously known results, this produces an asymptotic formula for the number of unlabelledk-regular simple graphs onn vertices, as well as various asymptotic results on the probable connectivity and girth of such graphs. Corresponding results for graphs with more arbitrary degree sequences are obtained. The main results apply equally well to graphs in which multiple edges and loops are permitted, and also to bicoloured graphs. Research of the second author supported by U. S. National Science Foundation Grant MCS-8101555, and by the Australian Department of Science and Technology under the Queen Elizabeth II Fellowships Scheme. Current address: Mathematics Department, University of Auckland, Auckland, New Zealand.     

Rates of convergence of random walk on distance regular graphs

When run on any non-bipartite q-distance regular graph from a family containing graphs of arbitrarily large diameter d, we show that d steps are necessary and sufficient to drive simple random walk to the uniform distribution in total variation distance, and that a sharp cutoff phenomenon occurs. For most examples, we determine the set on which the variation distance is achieved, and the precise rate at which it decays. The upper bound argument uses spectral methods – combining the usual Cauchy-Schwarz bound on variation distance with a bound on the tail probability of a first-hitting time, derived from its generating function. Received: 2 April 1997 / Revised version: 10 May 1998     

The forest associated with the record process on a Lévy tree

We perform a pruning procedure on a Lévy tree and instead of throwing away the removed sub-tree, we regraft it on a given branch (not related to the Lévy tree). We prove that the tree constructed by regrafting is distributed as the original Lévy tree, generalizing a result of Addario-Berry, Broutin and Holmgren where only Aldous’s tree is considered. As a consequence, we obtain that the “average pruning time” of a leaf is distributed as the height of a leaf picked at random in the Lévy tree.     

Upper escape rate of Markov chains on weighted graphs

We obtain an upper escape rate function for a continuous time minimal symmetric Markov chain defined on a locally finite weighted graph. This upper rate function, which has the same form as the manifold setting, is given in terms of the volume growth with respect to an adapted path metric. Our approach also gives a weak form of Folz’s theorem on the conservativeness as a consequence.     

OnK 4-free subgraphs of random graphs

For 0<1 and graphsG andH, writeGH if any -proportion of the edges ofG spans at least one copy ofH inG. As customary, writeK ^r for the complete graph onr vertices. We show that for every fixed real >0 there exists a constantC=C() such that almost every random graphG _n,p withp=p(n)Cn ^–2/5 satisfiesG _{n,p 2/3+} K ⁴. The proof makes use of a variant of Szemerédi's regularity lemma for sparse graphs and is based on a certain superexponential estimate for the number of pseudo-random tripartite graphs whose triangles are not too well distributed. Related results and a general conjecture concerningH-free subgraphs of random graphs in the spirit of the Erds-Stone theorem are discussed.The first author was partially supported by FAPESP (Proc. 93/0603-1) and by CNPq (Proc. 300334/93-1 and ProTeM-CC-II Project ProComb). Part of this work was done while the second author was visiting the University of São Paulo, supported by FAPESP (Proc. 94/4276-8). The third author was partially supported by the NSF grant DMS-9401559.     

Edge disjoint spanning trees in random graphs

We show that almost everyG _m-out containsm edge disjoint spanning trees.