Competing edge networks
We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the others growth and encourage the others demise. These nonlinear sto...
Main Authors: | Parsons, M, Grindrod, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2012
|
Similar Items
-
Social networks: Evolving graphs with memory dependent edges
by: Grindrod, P, et al.
Published: (2011) -
Communicability across evolving networks.
by: Grindrod, P, et al.
Published: (2011) -
Communicability across evolving networks
by: Grindrod, P, et al.
Published: (2011) -
Modeling proteome networks with range-dependent graphs.
by: Grindrod, P
Published: (2003) -
Bistability through Triadic Closure.
by: Grindrod, P, et al.
Published: (2012)