Clearchus on Love

White, Stephen

doi:10.2139/ssrn.1310728

Cited by 2 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We point the interested reader back to [16] and [27], where the important role of structural cohesion in the temporally-aggregated graph is demonstrated. We note that the structural cohesion calculated [31] for these two networks are 18.3 (High School) and 28.5 (Conference), quantifying the large number of node-independent paths typically available in these networks. In contrast, the structural cohesion of the DNC email network is 1.28, directly quantifying that it is much more tree-like, and as such there are typically few (or in many cases no) available detours between nodes.…”

Section: Reachability With Concurrencymentioning

confidence: 96%

Exploring Concurrency and Reachability in the Presence of High Temporal Resolution

Lee¹,

Moody

Mucha³

2019

Computational Social Sciences

View full text Add to dashboard Cite

Network properties govern the rate and extent of spreading processes on networks, from simple contagions to complex cascades. Recent advances have extended the study of spreading processes from static networks to temporal networks, where nodes and links appear and disappear. We review previous studies on the effects of temporal connectivity for understanding the spreading rate and outbreak size of model infection processes. We focus on the effects of accessibility, whether there is a temporally consistent path from one node to another, and reachability, the density of the corresponding accessibility graph representation of the temporal network. We study reachability in terms of the overall level of temporal concurrency between edges, quantifying the overlap of edges in time. We explore the role of temporal resolution of contacts by calculating reachability with the full temporal information as well as with a simplified interval representation approximation that demands less computation. We demonstrate the extent to which the computed reachability changes due to this simplified interval representation.

show abstract

Section: Reachability With Concurrencymentioning

confidence: 96%

Exploring Concurrency and Reachability in the Presence of High Temporal Resolution

Lee¹,

Moody

Mucha³

2019

Computational Social Sciences

View full text Add to dashboard Cite

show abstract

“…Within the aggregated network, we seek the number of nodeindependent paths, κ(i, j), available between nodes i and j. We employ the shortest path approximation of [19] to numerically calculate κ(i, j) and then average over all pairs of nodes:…”

Section: A Structural Cohesion and Temporal Concurrencymentioning

confidence: 99%

“…That is, given the computation [19] that separately identifies the number and length of node-independent shortest paths for each node pair (i, j) in the aggregated network, equation (7) gives us the probability of accessibility between the pair, as restricted along these node-independent paths. In other words, the corresponding R(i, j) element of the accessibility matrix becomes 1 with probability ρ(i, j).…”

Section: A Consideration Of Node-independent Pathsmentioning

confidence: 99%

Concurrency and reachability in treelike temporal networks

et al. 2019

View full text Add to dashboard Cite

Network properties govern the rate and extent of various spreading processes, from simple contagions to complex cascades. Recently, the analysis of spreading processes has been extended from static networks to temporal networks, where nodes and links appear and disappear. We focus on the effects of "accessibility", whether there is a temporally consistent path from one node to another, and "reachability", the density of the corresponding "accessibility graph" representation of the temporal network. The level of reachability thus inherently limits the possible extent of any spreading process on the temporal network. We study reachability in terms of the overall levels of temporal concurrency between edges and the structural cohesion of the network agglomerating over all edges. We use simulation results and develop heterogeneous mean field model predictions for random networks to better quantify how the properties of the underlying temporal network regulate reachability.

show abstract

Clearchus on Love

Cited by 2 publications

References 0 publications

Exploring Concurrency and Reachability in the Presence of High Temporal Resolution

Exploring Concurrency and Reachability in the Presence of High Temporal Resolution

Concurrency and reachability in treelike temporal networks

Contact Info

Product

Resources

About