Computing Dynamic User Equilibrium on Large-Scale Networks Without Knowing Global Parameters

AbstractDynamic user equilibrium (DUE) is a Nash-like solution concept describing an equilibrium in dynamic traffic systems over a fixed planning period. DUE is a challenging class of equilibrium problems, connecting network loading models and notions of system equilibrium in one concise mathematical framework. Recently, Friesz and Han introduced an integrated framework for DUE computation on large-scale networks, featuring a basic fixed-point algorithm for the effective computation of DUE. In the same work, they present an open-source MATLAB toolbox which allows researchers to test and validate new numerical solvers. This paper builds on this seminal contribution, and extends it in several important ways. At a conceptual level, we provide new strongly convergent algorithms designed to compute a DUE directly in the infinite-dimensional space of path flows. An important feature of our algorithms is that they give provable convergence guarantees without knowledge of global parameters. In fact, the algorithms we propose are adaptive, in the sense that they do not need a priori knowledge of global parameters of the delay operator, and which are provable convergent even for delay operators which are non-monotone. We implement our numerical schemes on standard test instances, and compare them with the numerical solution strategy employed by Friesz and Han.

Download Full-text

Using mobile phone data to reveal risk flow networks underlying the HIV epidemic in Namibia

Nature Communications ◽

10.1038/s41467-021-23051-w ◽

2021 ◽

Vol 12 (1) ◽

Author(s):

Eugenio Valdano ◽

Justin T. Okano ◽

Vittoria Colizza ◽

Honore K. Mitonga ◽

Sally Blower

Keyword(s):

Large Scale ◽

Control Strategies ◽

Sub Saharan Africa ◽

Mobile Phone Data ◽

Mathematical Framework ◽

Sub Saharan ◽

Administrative Units ◽

Large Scale Networks ◽

Living With Hiv ◽

Very High

AbstractTwenty-six million people are living with HIV in sub-Saharan Africa; epidemics are widely dispersed, due to high levels of mobility. However, global elimination strategies do not consider mobility. We use Call Detail Records from 9 billion calls/texts to model mobility in Namibia; we quantify the epidemic-level impact by using a mathematical framework based on spatial networks. We find complex networks of risk flows dispersed risk countrywide: increasing the risk of acquiring HIV in some areas, decreasing it in others. Overall, 40% of risk was mobility-driven. Networks contained multiple risk hubs. All constituencies (administrative units) imported and exported risk, to varying degrees. A few exported very high levels of risk: their residents infected many residents of other constituencies. Notably, prevalence in the constituency exporting the most risk was below average. Large-scale networks of mobility-driven risk flows underlie generalized HIV epidemics in sub-Saharan Africa. In order to eliminate HIV, it is likely to become increasingly important to implement innovative control strategies that focus on disrupting risk flows.

Download Full-text

A Generalized Single-Level Formulation for Origin–Destination Estimation under Stochastic User Equilibrium

Transportation Research Record Journal of the Transportation Research Board ◽

10.1177/0361198118782041 ◽

2018 ◽

Vol 2672 (48) ◽

pp. 58-68 ◽

Cited By ~ 1

Author(s):

Wei Ma ◽

Zhen (Sean) Qian

Keyword(s):

Large Scale ◽

User Equilibrium ◽

Estimation Methods ◽

Optimization Approach ◽

Large Network ◽

Equilibrium Constraints ◽

Stochastic User Equilibrium ◽

Single Level ◽

Solution Algorithms ◽

Large Scale Networks

Origin–destination (OD) demand is an indispensable component for modeling transportation networks, and the prevailing approach to estimating OD demand using traffic data is through bi-level optimization. A bi-level optimization approach considering equilibrium constraints is computationally challenging for large-scale networks, which prevents the OD estimation (ODE) being scalable. To solve for ODE in large-scale networks, this paper develops a generalized single-level formulation for ODE incorporating stochastic user equilibrium (SUE) constraints. Two single-level ODE models are specifically discussed and tested. One employs a SUE based on the satisfaction function, and the other is based on the Logit model. Analytical properties of the new formulation are analyzed. The estimation methods are proven to be unbiased. Gradient-based algorithms are proposed to solve for this formulation. Numerical experiments are conducted on a small network and a large network, along with sensitivity analysis on sensor locations, historical OD information and measurement error. Results indicate that the new single-level formulation, in conjunction with the proposed solution algorithms, can achieve accuracy comparable with the bi-level formulation, while being much more computationally efficient for large networks.

Download Full-text

Community Detection Based on DeepWalk Model in Large-Scale Networks

Security and Communication Networks ◽

10.1155/2020/8845942 ◽

2020 ◽

Vol 2020 ◽

pp. 1-13

Author(s):

Yunfang Chen ◽

Li Wang ◽

Dehao Qi ◽

Tinghuai Ma ◽

Wei Zhang

Keyword(s):

Community Structure ◽

Community Detection ◽

Large Scale ◽

Dimensional Space ◽

Complex Structure ◽

Gaussian Mixture ◽

Detection Algorithm ◽

Detection Methods ◽

Large Scale Networks ◽

Low Dimensional

The large-scale and complex structure of real networks brings enormous challenges to traditional community detection methods. In order to detect community structure in large-scale networks more accurately and efficiently, we propose a community detection algorithm based on the network embedding representation method. Firstly, in order to solve the scarce problem of network data, this paper uses the DeepWalk model to embed a high-dimensional network into low-dimensional space with topology information. Then, low-dimensional data are processed, with each node treated as a sample and each dimension of the node as a feature. Finally, samples are fed into a Gaussian mixture model (GMM), and in order to automatically learn the number of communities, variational inference is introduced into GMM. Experimental results on the DBLP dataset show that the model method of this paper can more effectively discover the communities in large-scale networks. By further analyzing the excavated community structure, the organizational characteristics within the community are better revealed.

Download Full-text

of Brain Cells & Circuits “Camillo Golgi”: The Neural Bases of Action – from cellular microcircuits to large-scale networks and modelling

School of Brain Cells & Circuits “Camillo Golgi”: The Neural Bases of Action – from cellular microcircuits to large-scale networks and modelling ◽

10.3389/978-2-88963-087-5 ◽

2019 ◽

Keyword(s):

Large Scale ◽

Brain Cells ◽

Neural Bases ◽

Large Scale Networks ◽

Camillo Golgi

Download Full-text

Contribution of Ionotropic Glutamatergic Receptors to Excitability and Attentional Signals in Macaque Frontal Eye Field

Cerebral Cortex ◽

10.1093/cercor/bhab007 ◽

2021 ◽

Author(s):

Miguel Dasilva ◽

Christian Brandt ◽

Marc Alwin Gieselmann ◽

Claudia Distler ◽

Alexander Thiele

Keyword(s):

Attentional Control ◽

Large Scale ◽

Neuronal Excitability ◽

Cell Types ◽

Receptor Activation ◽

Frontal Eye Field ◽

Control Signals ◽

Cognitive Operations ◽

Eye Field ◽

Large Scale Networks

Abstract Top-down attention, controlled by frontal cortical areas, is a key component of cognitive operations. How different neurotransmitters and neuromodulators flexibly change the cellular and network interactions with attention demands remains poorly understood. While acetylcholine and dopamine are critically involved, glutamatergic receptors have been proposed to play important roles. To understand their contribution to attentional signals, we investigated how ionotropic glutamatergic receptors in the frontal eye field (FEF) of male macaques contribute to neuronal excitability and attentional control signals in different cell types. Broad-spiking and narrow-spiking cells both required N-methyl-D-aspartic acid and α-amino-3-hydroxy-5-methyl-4-isoxazolepropionic acid receptor activation for normal excitability, thereby affecting ongoing or stimulus-driven activity. However, attentional control signals were not dependent on either glutamatergic receptor type in broad- or narrow-spiking cells. A further subdivision of cell types into different functional types using cluster-analysis based on spike waveforms and spiking characteristics did not change the conclusions. This can be explained by a model where local blockade of specific ionotropic receptors is compensated by cell embedding in large-scale networks. It sets the glutamatergic system apart from the cholinergic system in FEF and demonstrates that a reduction in excitability is not sufficient to induce a reduction in attentional control signals.

Download Full-text

Controllable and decomposable multidirectional synchronizations

Software & Systems Modeling ◽

10.1007/s10270-021-00879-w ◽

2021 ◽

Author(s):

Gábor Bergmann

Keyword(s):

Systems Engineering ◽

Large Scale ◽

Mathematical Framework ◽

Collaborative Systems ◽

Consistency Constraints ◽

Restoration Mechanism ◽

Common Goals ◽

Access Privileges ◽

Novel Concept ◽

Engineering Projects

AbstractStudying large-scale collaborative systems engineering projects across teams with differing intellectual property clearances, or healthcare solutions where sensitive patient data needs to be partially shared, or similar multi-user information systems over databases, all boils down to a common mathematical framework. Updateable views (lenses) and more generally bidirectional transformations are abstractions to study the challenge of exchanging information between participants with different read access privileges. The view provided to each participant must be different due to access control or other limitations, yet also consistent in a certain sense, to enable collaboration towards common goals. A collaboration system must apply bidirectional synchronization to ensure that after a participant modifies their view, the views of other participants are updated so that they are consistent again. While bidirectional transformations (synchronizations) have been extensively studied, there are new challenges that are unique to the multidirectional case. If complex consistency constraints have to be maintained, synchronizations that work fine in isolation may not compose well. We demonstrate and characterize a failure mode of the emergent behaviour, where a consistency restoration mechanism undoes the work of other participants. On the other end of the spectrum, we study the case where synchronizations work especially well together: we characterize very well-behaved multidirectional transformations, a non-trivial generalization from the bidirectional case. For the former challenge, we introduce a novel concept of controllability, while for the latter one, we propose a novel formal notion of faithful decomposition. Additionally, the paper proposes several novel properties of multidirectional transformations.

Download Full-text

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling

Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD '15 ◽

10.1145/2783258.2783385 ◽

2015 ◽

Cited By ~ 26

Author(s):

Michael Mitzenmacher ◽

Jakub Pachocki ◽

Richard Peng ◽

Charalampos Tsourakakis ◽

Shen Chen Xu

Keyword(s):

Large Scale ◽

Large Scale Networks

Download Full-text

How does the position of firms in the supply chain affect their performance? An empirical study

Applied Network Science ◽

10.1007/s41109-021-00364-9 ◽

2021 ◽

Vol 6 (1) ◽

Author(s):

Siddharth Arora ◽

Alexandra Brintrup

Keyword(s):

Supply Chain ◽

Empirical Data ◽

Large Scale ◽

Individual Performance ◽

Supply Network ◽

Supply Chain Networks ◽

Focal Firm ◽

Cooperative Competition ◽

Large Scale Networks ◽

The Relationship

AbstractThe relationship between a firm and its supply chain has been well studied, however, the association between the position of firms in complex supply chain networks and their performance has not been adequately investigated. This is primarily due to insufficient availability of empirical data on large-scale networks. To addresses this gap in the literature, we investigate the relationship between embeddedness patterns of individual firms in a supply network and their performance using empirical data from the automotive industry. In this study, we devise three measures that characterize the embeddedness of individual firms in a supply network. These are namely: centrality, tier position, and triads. Our findings caution us that centrality impacts individual performance through a diminishing returns relationship. The second measure, tier position, allows us to investigate the concept of tiers in supply networks because we find that as networks emerge, the boundaries between tiers become unclear. Performance of suppliers degrade as they move away from the focal firm (i.e., Toyota). The final measure, triads, investigates the effect of buying and selling to firms that supply the same customer, portraying the level of competition and cooperation in a supplier’s network. We find that increased coopetition (i.e., cooperative competition) is a performance enhancer, however, excessive complexity resulting from being involved in both upstream and downstream coopetition results in diminishing performance. These original insights help understand the drivers of firm performance from a network perspective and provide a basis for further research.

Download Full-text