Jonathan Jordan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jonathan Jordan has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Andrew R. Wade
Durham University
1 shared publicationB. M. Hambly
University of Oxford
1 shared publicationBen Andrews
School of Mathematics and Statistics, University of Sheffield, Sheffield, United Kingdom
1 shared publication- Ben Andrews
School of Mathematics and Statistics University of Sheffield S3 7RH Sheffield
1 shared publication - C. R. Jordan
The Open University in Yorkshire , 2 Trevelyan Square, Boar Lane , Leeds , LS1 6ED , UK
1 shared publication - David A. Jordan
School of Mathematics and Statistics, University of Sheffield, Hicks Building, Sheffield S3 7RH, United Kingdom
1 shared publication
Latest Publications
- Open Access
Phase transitions in non-linear urns with interacting types
We investigate reinforced non-linear urns with interacting types, and show that where there are three interacting types there are phenomena which do not occur with two types. In a model with three types where the interactions between the types are symmetric, we show the existence of a double phase transition with three phases: as well as a phase with an almost sure limit where each of the three colours is equally represented and a phase with almost sure convergence to an asymmetric limit, which both occur with two types, there is also an intermediate phase where both symmetric and asymmetric limits are possible. In a model with anti-symmetric interactions between the types, we show the existence of a phase where the proportions of the three colours cycle and do not converge to a limit, alongside a phase where the proportions of the three colours can converge to a limit where each of the three is equally represented.
Open AccessPhase transitions in non-linear urns with interacting types
We investigate reinforced non-linear urns with interacting types, and show that where there are three interacting types there are phenomena which do not occur with two types. In a model with three types where the interactions between the types are symmetric, we show the existence of a double phase transition with three phases: as well as a phase with an almost sure limit where each of the three colours is equally represented and a phase with almost sure convergence to an asymmetric limit, which both occur with two types, there is also an intermediate phase where both symmetric and asymmetric limits are possible. In a model with anti-symmetric interactions between the types, we show the existence of a phase where the proportions of the three colours cycle and do not converge to a limit, alongside a phase where the proportions of the three colours can converge to a limit where each of the three is equally represented.
- Open Access
Fragility of non-convergence in preferential attachment graphs with three types
Preferential attachment networks are a type of random network where new nodes are connected to existing ones at random, and are more likely to connect to those that already have many connections. We investigate further a family of models introduced by Antunovi\'{c}, Mossel and R\'{a}cz where each vertex in a preferential attachment graph is assigned a type, based on the types of its neighbours. Instances of this type of process where the proportions of each type present do not converge over time seem to be rare. Previous work found that a "rock-paper-scissors" setup where each new node's type was determined by a rock-paper-scissors contest between its two neighbours does not converge. Here, two cases similar to that are considered, one which is like the above but with an arbitrarily small chance of picking a random type and one where there are four neighbours which perform a knockout tournament to determine the new type. These two new setups, despite seeming very similar to the rock-paper-scissors model, do in fact converge, perhaps surprisingly.
Open AccessFragility of non-convergence in preferential attachment graphs with three types
Preferential attachment networks are a type of random network where new nodes are connected to existing ones at random, and are more likely to connect to those that already have many connections. We investigate further a family of models introduced by Antunovi\'{c}, Mossel and R\'{a}cz where each vertex in a preferential attachment graph is assigned a type, based on the types of its neighbours. Instances of this type of process where the proportions of each type present do not converge over time seem to be rare. Previous work found that a "rock-paper-scissors" setup where each new node's type was determined by a rock-paper-scissors contest between its two neighbours does not converge. Here, two cases similar to that are considered, one which is like the above but with an arbitrarily small chance of picking a random type and one where there are four neighbours which perform a knockout tournament to determine the new type. These two new setups, despite seeming very similar to the rock-paper-scissors model, do in fact converge, perhaps surprisingly.
- 1 January 2021
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 14 (3) , 531-540
Fragility of nonconvergence in preferential attachment graphs with three types
- 1 January 2021
- Published by Mathematical Sciences Publishers in Involve, a Journal of Mathematics
- Vol. 14 (3) , 531-540
Fragility of nonconvergence in preferential attachment graphs with three types
- 2 October 2019
- Published by Wiley in Random Structures & Algorithms
- Vol. 56 (3) , 775-795
Condensation in preferential attachment models with location‐based choice
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model evolves in discrete time by selecting r vertices from the graph with replacement, with probabilities proportional to their degrees plus a constant α. A new vertex joins the network and attaches to one of these vertices according to a given probability associated to the ranking of their locations. We give conditions for the occurrence of condensation, showing the existence of phase transitions in α below which condensation occurs. The condensation in our model differs from that in preferential attachment models with fitness in that the condensation can occur at a random location, that it can be due to a persistent hub, and that there can be more than one point of condensation.
- 2 October 2019
- Published by Wiley in Random Structures & Algorithms
- Vol. 56 (3) , 775-795
Condensation in preferential attachment models with location‐based choice
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model evolves in discrete time by selecting r vertices from the graph with replacement, with probabilities proportional to their degrees plus a constant α. A new vertex joins the network and attaches to one of these vertices according to a given probability associated to the ranking of their locations. We give conditions for the occurrence of condensation, showing the existence of phase transitions in α below which condensation occurs. The condensation in our model differs from that in preferential attachment models with fitness in that the condensation can occur at a random location, that it can be due to a persistent hub, and that there can be more than one point of condensation.
- Open Access
Condensation in preferential attachment models with location-based choice
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model evolves in discrete time by selecting $r$ vertices from the graph with replacement, with probabilities proportional to their degrees plus a constant $\alpha$. A new vertex joins the network and attaches to one of these vertices according to a given probability associated to the ranking of their locations. We give conditions for the occurrence of condensation, showing the existence of phase transitions in $\alpha$ below which condensation occurs. The condensation in our model differs from that in preferential attachment models with fitness in that the condensation can occur at a random location, that it can be due to a persistent hub, and that there can be more than one point of condensation.Open AccessCondensation in preferential attachment models with location-based choice
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model evolves in discrete time by selecting $r$ vertices from the graph with replacement, with probabilities proportional to their degrees plus a constant $\alpha$. A new vertex joins the network and attaches to one of these vertices according to a given probability associated to the ranking of their locations. We give conditions for the occurrence of condensation, showing the existence of phase transitions in $\alpha$ below which condensation occurs. The condensation in our model differs from that in preferential attachment models with fitness in that the condensation can occur at a random location, that it can be due to a persistent hub, and that there can be more than one point of condensation. - 1 June 2018
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 55 (4) , 1211-1227
Preferential attachment graphs with co-existing types of different fitnesses
We extend the work of Antunović et al. (2016) on competing types in preferential attachment models to include cases where the types have different fitnesses, which may be either multiplicative or additive. We show that, depending on the values of the parameters of the models, there are different possible limiting behaviours depending on the zeros of a certain function. In particular, we show the existence of choices of the parameters where one type is favoured both by having higher fitness and by the type of attachment mechanism, but the other type has a positive probability of dominating the network in the limit.
- 1 June 2018
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 55 (4) , 1211-1227
Preferential attachment graphs with co-existing types of different fitnesses
We extend the work of Antunović et al. (2016) on competing types in preferential attachment models to include cases where the types have different fitnesses, which may be either multiplicative or additive. We show that, depending on the values of the parameters of the models, there are different possible limiting behaviours depending on the zeros of a certain function. In particular, we show the existence of choices of the parameters where one type is favoured both by having higher fitness and by the type of attachment mechanism, but the other type has a positive probability of dominating the network in the limit.
- 1 January 2018
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 15 (2) , 1431-1445
The connected component of the partial duplication graph
- 1 January 2018
- Published by Institute for Applied and Pure Mathematics (IMPA) in Latin American Journal of Probability and Mathematical Statistics
- Vol. 15 (2) , 1431-1445
The connected component of the partial duplication graph
- 1 March 2015
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 47 (02) , 565-588
Phase Transitions for Random Geometric Preferential Attachment Graphs
Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the resulting graph as the relative strengths of these two components of the attachment rule are varied. Previous work of one of the authors showed that when the geometric component is weak, the limiting degree sequence mimics the standard Barabási-Albert preferential attachment model. We show that at the other extreme, in the case of a sufficiently strong geometric component, the limiting degree sequence mimics a purely geometric model, the on-line nearest-neighbour graph, for which we prove some extensions of known results. We also show the presence of an intermediate regime, with behaviour distinct from both the on-line nearest-neighbour graph and the Barabási-Albert model; in this regime, we obtain a stretched exponential upper bound on the degree sequence.
- 1 March 2015
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 47 (02) , 565-588
Phase Transitions for Random Geometric Preferential Attachment Graphs
Vertices arrive sequentially in space and are joined to existing vertices at random according to a preferential rule combining degree and spatial proximity. We investigate phase transitions in the resulting graph as the relative strengths of these two components of the attachment rule are varied. Previous work of one of the authors showed that when the geometric component is weak, the limiting degree sequence mimics the standard Barabási-Albert preferential attachment model. We show that at the other extreme, in the case of a sufficiently strong geometric component, the limiting degree sequence mimics a purely geometric model, the on-line nearest-neighbour graph, for which we prove some extensions of known results. We also show the presence of an intermediate regime, with behaviour distinct from both the on-line nearest-neighbour graph and the Barabási-Albert model; in this regime, we obtain a stretched exponential upper bound on the degree sequence.
- 1 September 2004
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 36 (03) , 824-838
A random hierarchical lattice: the series-parallel graph and its properties
We consider a sequence of random graphs constructed by a hierarchical procedure. The construction replaces existing edges by pairs of edges in series or parallel with probability p. We investigate the effective resistance across the graphs, first-passage percolation on the graphs and the Cheeger constants of the graphs as the number of edges tends to infinity. In each case we find a phase transition at
- 1 September 2004
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 36 (03) , 824-838
A random hierarchical lattice: the series-parallel graph and its properties
We consider a sequence of random graphs constructed by a hierarchical procedure. The construction replaces existing edges by pairs of edges in series or parallel with probability p. We investigate the effective resistance across the graphs, first-passage percolation on the graphs and the Cheeger constants of the graphs as the number of edges tends to infinity. In each case we find a phase transition at
- 1 January 2002
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 11 (3) , 339-347
Reversible Complex Hénon Maps
We identify and investigate a class of complex Hénon maps H : (C2 → C2 that are reversible, that is, each H can be factorized as RU where R 2 = U 2 = IdC2 . Fixed points and periodic points of order two or three are classified in terms of symmetry, with respect to R or U, and as either elliptic or saddle points. We report on experimental investigation, using a Java applet, of the bounded orbits of H.
- 1 January 2002
- Published by Taylor & Francis in Experimental Mathematics
- Vol. 11 (3) , 339-347
Reversible Complex Hénon Maps
We identify and investigate a class of complex Hénon maps H : (C2 → C2 that are reversible, that is, each H can be factorized as RU where R 2 = U 2 = IdC2 . Fixed points and periodic points of order two or three are classified in terms of symmetry, with respect to R or U, and as either elliptic or saddle points. We report on experimental investigation, using a Java applet, of the bounded orbits of H.