ECEdward Crane

Edward Crane

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Edward Crane has a total of 22 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Gaussian consensus processes and their Lyapunov exponents

    by Edward Crane, Stanislav Volkov

    We introduce a simple dynamic model of opinion formation, in which a finite population of individuals hold vector-valued opinions. At each time step, each individual’s opinion moves towards the mean opinion but is then perturbed independently by a centred multivariate Gaussian random variable, with covariance proportional to the covariance matrix of the opinions of the population. We establish precise necessary and sufficient conditions on the parameters of the model, under which all opinions converge to a common limiting value. Asymptotically perfect correlation emerges between opinions on different topics. Our results are rigorous and based on properties of the partial products of an i.i.d. sequence of random matrices. Each matrix is a fixed linear combination of the identity matrix and a real Ginibre matrix. We derive an analytic expression for the maximal Lyapunov exponent of this product sequence. We also analyze a continuous-time analogue of our model.

  • Open Access

    Weak lumping of left-invariant random walks on left cosets of finite groups

    by Edward Crane, Álvaro Gutiérrez, Erin Russell, Mark Wildon

    Let $G$ be a finite group and let $H$ be a subgroup of $G$. The left-invariant random walk driven by a probability measure $w$ on $G$ is the Markov chain in which from any state $x \in G$, the probability of stepping to $xg \in G$ is $w(g)$. The initial state is chosen randomly according to a given distribution. The walk is said to lump weakly on left cosets if the induced process on $G/H$ is a time-homogeneous Markov chain. We characterise all the initial distributions and weights $w$ such that the walk is irreducible and lumps weakly on left cosets, and determine all the possible transition matrices of the induced Markov chain. In the case where $H$ is abelian we refine our main results to give a necessary and sufficient condition for weak lumping by an explicit system of linear equations on $w$, organized by the double cosets $HxH$. As an application we consider shuffles of a deck of $n$ cards such that repeated observations of the top card form a Markov chain. Such shuffles include the random-to-top shuffle, and also, when the deck is started in a uniform random order, the top-to-random shuffle. We give a further family of examples in which our full theory of weak lumping is needed to verify that the top card sequence is Markov.

  • Open Access

    Age evolution in the mean field forest fire model via multitype branching processes

    by Edward Crane, Balazs Rath, Dominic Yeo

    We study the distribution of ages in the mean field forest fire model introduced by R\'ath and T\'oth. This model is an evolving random graph whose dynamics combine Erd\H{o}s-R\'enyi edge-addition with a Poisson rain of lightning strikes. All edges in a connected component are deleted when any of its vertices is struck by lightning. We consider the asymptotic regime of lightning rates for which the model displays self-organized criticality. The age of a vertex increases at unit rate, but it is reset to zero at each burning time. We show that the empirical age distribution converges as a process to a deterministic solution of an autonomous measure-valued differential equation. The main technique is to observe that, conditioned on the vertex ages, the graph is an inhomogeneous random graph in the sense of Bollob\'as, Janson and Riordan. We then study the evolution of the ages via the multitype Galton--Watson trees that arise as the limit in law of the component of an identified vertex at any fixed time. These trees are critical from the gelation time onwards.

  • Open Access

    Diffusion and Superdiffusion in Lattice Models for Colliding Particles with Stored Momentum

    by Edward Crane, Sean Ledger, Bálint Tóth

    We introduce two discrete models of a collection of colliding particles with stored momentum and study the asymptotic growth of the mean-square displacement of an active particle. We prove that the models are superdiffusive in one dimension (with power law correction) and diffusive in three and higher dimensions. In two dimensions we demonstrate superdiffusivity (with logarithmic correction) for certain anisotropic initial conditions.


  • Open Access

    Circle packing with generalized branching

    by James Ashe, Edward Crane, Kenneth Stephenson


  • Open Access

    Cluster growth in the dynamical Erdős-Rényi process with forest fires

    by Edward Crane, Nic Freeman, Bálint Tóth

    We investigate the growth of clusters within the forest fire model of Ráth and Tóth [EJP, vol 14, paper no 45]. The model is a continuous-time Markov process, similar to the dynamical Erdős-Rényi random graph but with the addition of so-called fires. A vertex may catch fire at any moment and, when it does so, causes all edges within its connected cluster to burn, meaning that they instantaneously disappear. Each burned edge may later reappear. We give a precise description of the process $C_t$ of the size of the cluster of a tagged vertex, in the limit as the number of vertices in the model tends to infinity. We show that $C_t$ is an explosive branching process with a time-inhomogeneous offspring distribution and instantaneous return to 1 on each explosion. Additionally, we show that the characteristic curves used to analyse the Smoluchowski-type coagulation equations associated to the model have a probabilistic interpretation in terms of the process $C_t$.


  • Open Access

    Cluster growth in the dynamical Erdős-Rényi process with forest fires

    by Edward Crane, Nic Freeman, Bálint Tóth

    We investigate the growth of clusters within the forest fire model of R\'{a}th and T\'{o}th [22]. The model is a continuous-time Markov process, similar to the dynamical Erd\H{o}s-R\'{e}nyi random graph but with the addition of so-called fires. A vertex may catch fire at any moment and, when it does so, causes all edges within its connected cluster to burn, meaning that they instantaneously disappear. Each burned edge may later reappear. We give a precise description of the process $C_t$ of the size of the cluster of a tagged vertex, in the limit as the number of vertices in the model tends to infinity. We show that $C_t$ is an explosive branching process with a time-inhomogeneous offspring distribution and instantaneous return to $1$ on each explosion. Additionally, we show that the characteristic curves used to analyse the Smoluchowski-type coagulation equations associated to the model have a probabilistic interpretation in terms of the process $C_t$.

  • Open Access

    Intrinsic circle domains

    by Edward Crane

    Using quasiconformal mappings, we prove that any Riemann surface of finite connectivity and finite genus is conformally equivalent to an intrinsic circle domain in a compact Riemann surface . This means that each connected component of is either a point or a closed geometric disc with respect to the complete constant curvature conformal metric of the Riemann surface . Moreover, the pair is unique up to conformal isomorphisms. We give a generalization to countably infinite connectivity. Finally, we show how one can compute numerical approximations to intrinsic circle domains using circle packings and conformal welding.

  • Open Access

    Intrinsic circle domains

    by Edward Crane

    Using quasiconformal mappings, we prove that any Riemann surface of finite connectivity and finite genus is conformally equivalent to an intrinsic circle domain U in a compact Riemann surface S. This means that each connected component B of S \ U is either a point or a closed geometric disc with respect to the complete constant curvature conformal metric of the Riemann surface (U union B). Moreover the pair (U,S) is unique up to conformal isomorphisms. We give a generalization to countably infinite connectivity. Finally we show how one can compute numerical approximations to intrinsic circle domains using circle packings and conformal welding.

  • Open Access

    Relative Riemann mapping criteria and hyperbolic convexity

    by Edward Crane

    Let be a simply-connected Riemann surface with a simply-connected subdomain . We give a criterion in terms of conformal reflections to determine whether can be embedded in the complex plane so that is mapped onto a disc. If it can, then is convex with respect to the hyperbolic metric of , by a theorem of Jørgensen. We discuss the close relationship of our criterion to two generalizations of Jørgensen's theorem by Minda and Solynin. We generalize our criterion to the quasiconformal setting and also give a criterion for the multiply-connected case, where an embedding is sought that maps a given subdomain onto a circle domain.