17 research outputs found

    Counting Hamilton cycles in sparse random directed graphs

    Full text link
    Let D(n,p) be the random directed graph on n vertices where each of the n(n-1) possible arcs is present independently with probability p. A celebrated result of Frieze shows that if p≄(log⁥n+ω(1))/np\ge(\log n+\omega(1))/n then D(n,p) typically has a directed Hamilton cycle, and this is best possible. In this paper, we obtain a strengthening of this result, showing that under the same condition, the number of directed Hamilton cycles in D(n,p) is typically n!(p(1+o(1)))nn!(p(1+o(1)))^{n}. We also prove a hitting-time version of this statement, showing that in the random directed graph process, as soon as every vertex has in-/out-degrees at least 1, there are typically n!(log⁥n/n(1+o(1)))nn!(\log n/n(1+o(1)))^{n} directed Hamilton cycles

    Strong games played on random graphs

    Get PDF
    In a strong game played on the edge set of a graph G there are two players, Red and Blue, alternating turns in claiming previously unclaimed edges of G (with Red playing first). The winner is the first one to claim all the edges of some target structure (such as a clique, a perfect matching, a Hamilton cycle, etc.). It is well known that Red can always ensure at least a draw in any strong game, but finding explicit winning strategies is a difficult and a quite rare task. We consider strong games played on the edge set of a random graph G ~ G(n,p) on n vertices. We prove, for sufficiently large nn and a fixed constant 0 < p < 1, that Red can w.h.p win the perfect matching game on a random graph G ~ G(n,p)

    Predicting collapse of adaptive networked systems without knowing the network

    Get PDF
    The collapse of ecosystems, the extinction of species, and the breakdown of economic and financial networks usually hinges on topological properties of the underlying networks, such as the existence of self-sustaining (or autocatalytic) feedback cycles. Such collapses can be understood as a massive change of network topology, usually accompanied by the extinction of a macroscopic fraction of nodes and links. It is often related to the breakdown of the last relevant directed catalytic cycle within a dynamical system. Without detailed structural information it seems impossible to state, whether a network is robust or if it is likely to collapse in the near future. Here we show that it is nevertheless possible to predict collapse for a large class of systems that are governed by a linear (or linearized) dynamics. To compute the corresponding early warning signal, we require only non-structural information about the nodes’ states such as species abundances in ecosystems, or company revenues in economic networks. It is shown that the existence of a single directed cycle in the network can be detected by a “quantization effect” of node states, that exists as a direct consequence of a corollary of the Perron–Frobenius theorem. The proposed early warning signal for the collapse of networked systems captures their structural instability without relying on structural information. We illustrate the validity of the approach in a transparent model of co-evolutionary ecosystems and show this quantization in systems of species evolution, epidemiology, and population dynamics

    Packing, counting and covering Hamilton cycles in random directed graphs

    Get PDF
    A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this is that there is no general tool for finding Hamilton cycles in directed graphs comparable to the so-called Posá ‘rotation-extension’ technique for the undirected analogue. Let D(n, p) denote the random digraph on vertex set [n], obtained by adding each directed edge independently with probability p. Here we present a general and a very simple method, using known results, to attack problems of packing and counting Hamilton cycles in random directed graphs, for every edge-probability p &gt; logC(n)/n. Our results are asymptotically optimal with respect to all parameters and apply equally well to the undirected case
    corecore