• Corpus ID: 239998214

Pattern Formation in Random Networks Using Graphons

@inproceedings{Bramburger2021PatternFI,
  title={Pattern Formation in Random Networks Using Graphons},
  author={Jason J. Bramburger and Matt Holzer},
  year={2021}
}
We study Turing bifurcations on one-dimensional random ring networks where the probability of a connection between two nodes depends on the distance between the two nodes. Our approach uses the theory of graphons to approximate the graph Laplacian in the limit as the number of nodes tends to infinity by a nonlocal operator – the graphon Laplacian. For the ring networks considered here, we employ center manifold theory to characterize Turing bifurcations in the continuum limit in a manner… 

Figures from this paper

References

SHOWING 1-10 OF 48 REFERENCES
The Nonlinear Heat Equation on Dense Graphs and Graph Limits
  • G. Medvedev
  • Mathematics, Physics
    SIAM J. Math. Anal.
  • 2014
TLDR
For dynamical networks on convergent sequences of simple and weighted graphs, it is proved that convergence of solutions of the initial-value problems for discrete models to those of the limiting continuous equations.
Bifurcations in the Kuramoto model on graphs.
TLDR
This work studies several model problems illustrating the link between network topology and synchronization in coupled dynamical systems, and identifies several families of graphs for which the transition to synchronization in the Kuramoto model starts at the same critical value of the coupling strength and proceeds in a similar manner.
Turing instability in reaction–diffusion models on complex networks
The mean field analysis of the kuramoto model on graphs Ⅱ. asymptotic stability of the incoherent state, center manifold reduction, and bifurcations
In our previous work [Chiba, Medvedev, arXiv:1612.06493], we initiated a mathematical investigation of the onset of synchronization in the Kuramoto model (KM) of coupled phase oscillators on
Concentration of the adjacency matrix and of the Laplacian in random graphs with independent edges
Consider any random graph model where potential edges appear independently, with possibly different probabilities, and assume that the minimum expected degree is !(lnn). We prove that the adjacency
The Semilinear Heat Equation on Sparse Random Graphs
TLDR
It is shown that the solutions of the initial value problems for the discrete models can be approximated by those of an appropriate nonlocal diffusion equation for the coupled dynamical systems on power law graphs.
Pattern Formation on Networks: from Localised Activity to Turing Patterns
TLDR
Through the application of a generalisation of dynamical systems analysis this work reveals a fundamental connection between small-scale modes of activity on networks and localised pattern formation seen throughout science, such as solitons, breathers andLocalised buckling.
The Turing bifurcation in network systems: Collective patterns and single differentiated nodes
Abstract We study the emergence of patterns in a diffusively coupled network that undergoes a Turing instability. Our main focus is the emergence of stable solutions with a single differentiated node
Large Networks and Graph Limits
The book Large Networks and Graph Limits, xiv + 475 pp., published in late 2012, comprises five parts, the first an illuminating introduction and the last a tantalizing taste of how the scope of the
The Nonlinear Heat Equation on W-Random Graphs
For systems of coupled differential equations on a sequence of W-random graphs, we derive the continuum limit in the form of an evolution integral equation. We prove that solutions of the initial
...
1
2
3
4
5
...