Iterated Global Models for Complex Networks

02/20/2020
by   Anthony Bonato, et al.
0

We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set S of nodes of a prescribed cardinality, we add a new node that is adjacent to every node in S. We focus on the case where the size of S is approximately half the number of nodes at each time-step, and we refer to this as the half-model. The half-model provably generate graphs that densify over time, have bad spectral expansion, and low diameter. We derive the clique, chromatic, and domination numbers of graphs generated by the model.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/10/2022

Iterative models for complex networks formed by extending cliques

We consider a new model for complex networks whose underlying mechanism ...
research
10/21/2022

A Simple Deterministic Distributed Low-Diameter Clustering

We give a simple, local process for nodes in an undirected graph to form...
research
07/12/2023

Analysis of Half-Duplex Two-Node Slotted ALOHA Network With Asynchronous Traffic

Despite the long history of research on slotted ALOHA, the exact analysi...
research
01/05/2021

Spread and defend infection in graphs

The spread of an infection, a contagion, meme, emotion, message and vari...
research
12/05/2020

Majority Opinion Diffusion in Social Networks: An Adversarial Approach

We introduce and study a novel majority-based opinion diffusion model. C...
research
09/28/2018

Expander Graphs are Non-Malleable Codes

Any d-regular graph on n nodes with spectral expansion λ satisfying n = ...
research
06/13/2023

Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphs

Real-world graphs generally have only one kind of tendency in their conn...

Please sign up or login with your details

Forgot password? Click here to reset