DiskNet#

class DiskNet(pars=None, key_dict=None, **kwargs)[source]#

Bases: Network

Disk graph in which edges are made between agents located within a user-defined radius.

Interactions take place within a square with edge length of 1. Agents are initialized to have a random position and orientation within this square. On each time step, agents advance v*dt in the direction they are pointed. When encountering a wall, agents are reflected.

Edges are formed between two agents if they are within r distance of each other.

Attributes

beta

Relative transmission on each network edge

members

Return sorted array of all members

now

Shortcut to self.t.now()

p1

The first half of a network edge (person 1)

p2

The second half of a network edge (person 2)

states

Return a flat list of all states

statesdict

Return a flat dictionary (objdict) of all states

ti

Get the current module timestep

timevec

Shortcut to self.t.timevec

Methods

add_pairs()[source]#

Generate contacts