Search arXivSearch

arXiv · 2312.12906

Emerge of scaling in project schedules

Abstract

A project schedule contains a network of activities, the activity durations, the early and late finish dates for each activity, and the associated total float or slack times, the difference between the late and early dates. Here I show that the distribution of activity durations and total floats of construction project schedules exhibit a power law scaling. The power law scaling of the activity durations is explained by a historical process of specialization fragmenting old activities into new activities with shorter duration. In contrast, the power law scaling of the total floats distribution across activities is determined by the activity network. I demonstrate that the power law scaling of the activity duration distribution is essential to obtain a good estimate of the project delay distribution, while the actual total float distribution is less relevant. Finally, using extreme value theory and scaling arguments, I provide a mathematical proof for reference class forecasting for the project delay distribution. The project delay cumulative distribution function is $G(z) = \exp( - (z_c/z)^{1/s})$, where $s>0$ and $z_c>0$ are shape and scale parameters. Furthermore, if activity delays follow a lognormal distribution, as the empirical data suggests, then $s=1$ and $z_c \sim N^{0.20}d_{\max}^{1+0.20(1-γ_d)}$, where $N$ is the number of activities, $d_{\max}$ the maximum activity duration in units of days and $γ_d$ the power law exponent of the activity duration distribution. These results offer new insights about project schedules, reference class forecasting and delay risk analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexei Vazquez. 2023-12-20. Emerge of scaling in project schedules. https://doi.org/10.1140/epjb%2Fs10051-024-00676-6

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Self-Reference in Large Language Models: The Introspection Threshold for Recursive Self-Improvement

The pursuit of self-evolving AI raises a critical question: when is autonomous self-improvement sustainable rather than degenerative? Drawing an analogy to von Neumann's complexity threshold for self-reproducing automata, we argue that sustainable recursive self-improvement in Large Language Models (LLMs) requires a functional analogue: introspection -- the system's capacity to simulate its own operations and target modifications. Grounded in Kleene's Second Recursion Theorem, we demonstrate the theoretical existence of such introspective programs. However, an empirical review reveals that while current LLMs exhibit quasi-introspection (e.g., partial metacognition), they fall short of true introspection due to structural bottlenecks: a lack of complete self-access, the feedforward nature of the Transformer, and computational class constraints that prevent fixed-point iteration. We conclude by outlining architectural paths to cross this complexity threshold and discussing the associated safety implications.

physics.soc-ph

Multilayer Analysis of the Global Trade Network

Global trade is more than a single network of aggregate flows. Beneath the observable exchange of products among economies lies a complex multilayer structure, formed by thousands of product-specific trade relationships that differ in their similarity, interdependence, and temporal evolution. Using the CEPII's BACI database, which records bilateral product-level trade flows between economies, we represent the global trade network from 1995 to 2024 as a temporal multilayer network, with economies as nodes and directed weighted trade flows as edges. To investigate product-level organisation and cross-layer similarity, temporal structural change, and the structural role of individual economies, we introduce a random-walk-based similarity measure that provides a unified framework for comparing weighted and directed trade layers. Our results show that the global trade network remains relatively stable over short periods but undergoes gradual structural change over longer timescales. We also find that similarity-based product communities only partially align with the official product taxonomy, indicating that products assigned to the same official category do not necessarily exhibit similar trade-network structures. Finally, we show that an economy's structural influence is not always determined by its trade volume. These results highlight the value of multilayer network analysis for revealing patterns in global trade that remain hidden at the aggregate level.

physics.soc-ph

Detectability limits of scaling laws

Power law scaling relations between size and output are central to quantitative theories of cities, organisms, and other complex systems. Competing theories predict scaling exponents that differ by small fractions, but there is no existing theory for verifying whether a given dataset can even distinguish exponents at the required resolution to address such discrepancies. Here we derive a resolution limit for scaling exponents, giving the smallest exponent difference that any method of analysis can detect. We find that the Hurst exponents governing the evolution of systems' sizes and deviations from the scaling law determine how long a record of growing systems must be before it can separate competing scaling theories. Empirical results suggest that many available data panels are insufficient for reliable scaling model selection.

physics.soc-ph