Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,261 records · Page 70

Reliability processing of remote direct memory access

Methods and systems for monitoring remote transmissions of messages among a plurality of nodes are described. A processing element in a first node may allocate a sequence number to a request to read and/or update data in a second node. The processing element may be different from main processors of the first node. The processing element may send the message and the sequence number to the second node. The processing element may modify a status of the sequence number to an active state, indicating a transmission of the message is pending. The processing element may, in response to a response from the second node, modify the status of the sequence number to an inactive state, indicating a completed transmission of the message. The processing element may, in response to no response from the second node within a time period, resend the message and the sequence number to the second node.

Kumar, Sameer↗

I/O routing in a multidimensional torus network

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

Chen, Dong↗

Obfuscation for high-performance computing systems

An example technique includes initializing, by an obfuscation computing system, communications with nodes in a distributed computing platform. The nodes include compute nodes that provide resources in the distributed computing platform and a controller node that performs resource management of the resources. The obfuscation computing system serves as an intermediary between the controller node and the compute nodes. The technique further includes outputting an interactive user interface (UI) providing a selection between a first privilege level and a second privilege level, and performing one of: based on the selection being for the first privilege level, a first obfuscation mechanism for the distributed computing platform to obfuscate digital traffic between a user computing system and the nodes, or based on the selection being for the second privilege level, a second obfuscation mechanism for the distributed computing platform to obfuscate digital traffic between the user computing system and the nodes.

Aloisio, Scott↗

Obfuscation for high-performance computing systems

An example method includes initializing, by an obfuscation computing system, communications with nodes in a distributed computing platform, the nodes including one or more compute nodes and a controller node, and performing at least one of: (a) code-level obfuscation for the distributed computing platform to obfuscate interactions between an external user computing system and the nodes, wherein performing the code-level obfuscation comprises obfuscating data associated with one or more commands provided by the user computing system and sending one or more obfuscated commands to at least one of the nodes in the distributed computing platform; or (b) system-level obfuscation for the distributed computing platform, wherein performing the system-level obfuscation comprises at least one of obfuscating system management tasks that are performed to manage the nodes or obfuscating network traffic data that is exchanged between the nodes.

Powers, Judson↗

Pushing sensor network computation to the edge

Sensor Networks consist of multiple devices equipped with some sensing apparatus. The devices in the network may be homogeneous or heterogeneous, yet they will coordinate in order to accomplish a pre-defined task. With the rising interest in the use of Sensor Networks in various applications, the sensor nodes need to subsist in a dynamic environment and react in a timely fashion to environmental stimuli. Unfortunately, the current paradigm in Sensor Network relies on static tasking of the nodes to support a common task; which ultimately leads to deployment of various networks to cover a common area so long as the tasks and owners of these networks differ. Straying away from this paradigm, our work introduces a framework to enable nodes to support dynamic tasking in a dynamic environment by pushing computation to the edge through FPGA-based reconfigurable nodes with increased processing power. Furthermore, we contend that the sensing apparatus available on the nodes limits the range of applications that such nodes will support. As such, reconfigurability of the nodes can yield the most efficient and responsive hardware implementation of algorithms to support common tasks of applications. The benefits of our approach are highlighted through the introduction of a target-tracking node that is reconfigurable and provides increased response time to stimuli.

47 OTHER INSTRUMENTATION↗

In Vivo{sup 1}H Magnetic Resonance Spectroscopy of Lactate in Patients With Stage IV Head and Neck Squamous Cell Carcinoma

Purpose: To investigate in vivo{sup 1}H magnetic resonance spectroscopy imaging of lactate for assessing tumor hypoxia in head and neck cancers and to determine its utility in predicting the response and outcomes. Methods and Materials: Volume-localized lactate-edited {sup 1}H magnetic resonance spectroscopy at 1.5 T was performed in vivo on involved neck nodes and control subcutaneous tissues in 36 patients with Stage IV head and neck cancer. The signal intensities (SIs) of lactate, choline, and creatine and the choline/creatine ratio were measured. The tumor partial pressure of oxygen (pO{sub 2}) was obtained in the same lymph node before MRS. Patients were treated with either two cycles of induction chemotherapy (tirapazamine, cisplatin, 5-fluorouracil) followed by simultaneous chemoradiotherapy or the same regimen without tirapazamine. The lactate SI and the choline/creatine ratio correlated with the tumor pO{sub 2}, nodal response, and locoregional control. Results: The lactate SI was greater for the involved nodes (median, 0.25) than for the subcutaneous tissue (median, 0.04; p = 0.07). No significant correlation was found between the lactate SI and tumor pO{sub 2} (mean, 0.46 {+-} 0.10 for hypoxic nodes [pO{sub 2} {<=}10 mm Hg, n = 15] vs. 0.36 {+-} 0.07 for nonhypoxic nodes [pO{sub 2} >10 mm Hg, n = 21], p = 0.44). A significant correlation was found between the choline/creatine ratios and tumor pO{sub 2} (mean, 2.74 {+-} 0.34 for hypoxic nodes vs. 1.78 {+-} 0.31 for nonhypoxic nodes, p = 0.02). No correlation was found between the lactate SI and the complete nodal response (p = 0.52) or locoregional control rates. Conclusions: The lactate SI did not correlate with tumor pO{sub 2}, treatment response, or locoregional control. Additional research is needed to refine this technique.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Effect of {sup 18}F-FDG PET/CT Imaging in Patients With Clinical Stage II and III Breast Cancer

Purpose: To investigate the potential effect of using {sup 18}F-fluorodeoxyglucose positron emission tomography/computed tomography (PET/CT) in the initial assessment of patients with clinical Stage II or III breast cancer. Methods and Materials: During 14 consecutive months, 39 patients (40 tumors) who presented with Stage II or III breast cancer on the basis of a routine extension assessment were prospectively included in this study. PET/CT was performed in addition to the initial assessment. Results: In 3 cases, PET/CT showed extra-axillary lymph node involvement that had not been demonstrated with conventional techniques. Two of these patients had hypermetabolic lymph nodes in the subpectoral and infraclavicular regions, and the third had a hypermetabolic internal mammary node. PET/CT showed distant uptake in 4 women. Of these 4 women, 1 had pleural involvement and 3 had bone metastasis. Overall, of the 39 women, the PET/CT results modified the initial stage in 7 (18%). The modified staging altered the treatment plan for 5 patients (13%). It led to radiotherapy in 4 patients (bone metastasis, pleural lesion, subpectoral lymph nodes, and internal mammary nodes) and excision of, and radiotherapy to, the infraclavicular lymph nodes in 1 patient. Conclusions: PET/CT can provide information on extra-axillary lymph node involvement and can uncover occult distant metastases in a significant percentage of patients. Therefore, initial PET/CT could enable better treatment planning for patients with Stage II and III breast cancer.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Nanoparticle-Enhanced MRI to Evaluate Radiation Delivery to the Regional Lymphatics for Patients With Breast Cancer

Purpose: At present, radiation (RT) fields are based largely, and often solely, on bony anatomy. Recent efforts have been taken to better define lymphatic regions for RT planning. Lymphotrophic nanoparticle-enhanced MRI (LN-MRI) allows for accurate identification of malignant and benign lymph nodes. We sought to evaluate RT delivery to lymphatics for breast cancer using LN-MRI. Methods and Materials: Twenty-three patients with breast cancer underwent LN-MRI. MRIs were anatomically registered to a reference CT; benign and malignant lymph nodes were contoured. Standard RT fields were planned and dose calculated to prescribe 45-50 Gy. Lymphatic regions were contoured on CT. Coverage of LN-MRI lymph nodes by RT fields and contoured lymphatics were assessed. Results: Eighty-one percent of all lymph nodes defined by LN-MRI were covered by the 45-Gy isodose line; 82% of malignant and 79% of benign. The 50-Gy isodose line only encompassed 60% of LN-MRI defined lymph nodes-64% of malignant and 59% of benign. For nodal volumes contoured in the absence of a margin, 86% of actual lymph nodes were within contoured volumes. When a 5-mm expansion was added, 99% were included. Conclusions: LN-MRI is a useful tool to delineate the location of breast regional lymphatics. These results suggest less than desired coverage of lymph nodes using standard RT fields and that a margin may be advisable when defining nodal volumes by CT. The use of IMRT and RT in lieu of surgery makes accurate definition of the location of breast regional lymphatics of paramount importance.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Role of Positron Emission Tomography-Computed Tomography in the Management of Anal Cancer

Purpose: Pre- and post-treatment staging of anal cancer are often inaccurate. The role of positron emission tomograpy-computed tomography (PET-CT) in anal cancer is yet to be defined. The aim of the study was to compare PET-CT with CT scan, sentinel node biopsy results of inguinal lymph nodes, and anal biopsy results in staging and in follow-up of anal cancer. Methods and Materials: Fifty-three consecutive patients diagnosed with anal cancer underwent PET-CT. Results were compared with computed tomography (CT), performed in 40 patients, and with sentinel node biopsy (SNB) (41 patients) at pretreatment workup. Early follow-up consisted of a digital rectal examination, an anoscopy, a PET-CT scan, and anal biopsies performed at 1 and 3 months after the end of treatment. Data sets were then compared. Results: At pretreatment assessment, anal cancer was identified by PET-CT in 47 patients (88.7%) and by CT in 30 patients (75%). The detection rates rose to 97.9% with PET-CT and to 82.9% with CT (P=.042) when the 5 patients who had undergone surgery prior to this assessment and whose margins were positive at histological examination were censored. Perirectal and/or pelvic nodes were considered metastatic by PET-CT in 14 of 53 patients (26.4%) and by CT in 7 of 40 patients (17.5%). SNB was superior to both PET-CT and CT in detecting inguinal lymph nodes. PET-CT upstaged 37.5% of patients and downstaged 25% of patients. Radiation fields were changed in 12.6% of patients. PET-CT at 3 months was more accurate than PET-CT at 1 month in evaluating outcomes after chemoradiation therapy treatment: sensitivity was 100% vs 66.6%, and specificity was 97.4% vs 92.5%, respectively. Median follow-up was 20.3 months. Conclusions: In this series, PET-CT detected the primary tumor more often than CT. Staging of perirectal/pelvic or inguinal lymph nodes was better with PET-CT. SNB was more accurate in staging inguinal lymph nodes.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Isolation and Connectivity in Random Geometric Graphs with Self-similar Intensity Measures

Random geometric graphs consist of randomly distributed nodes (points), with pairs of nodes within a given mutual distance linked. In the usual model the distribution of nodes is uniform on a square, and in the limit of infinitely many nodes and shrinking linking range, the number of isolated nodes is Poisson distributed, and the probability of no isolated nodes is equal to the probability the whole graph is connected. Here we examine these properties for several self-similar node distributions, including smooth and fractal, uniform and nonuniform, and finitely ramified or otherwise. We show that nonuniformity can break the Poisson distribution property, but it strengthens the link between isolation and connectivity. It also stretches out the connectivity transition. Finite ramification is another mechanism for lack of connectivity. The same considerations apply to fractal distributions as smooth, with some technical differences in evaluation of the integrals and analytical arguments.

97 MATHEMATICS AND COMPUTING↗

A Hybrid MPI/OpenMP Approach for Parallel Groundwater Model Calibration on Multicore Computers

Groundwater model calibration is becoming increasingly computationally time intensive. We describe a hybrid MPI/OpenMP approach to exploit two levels of parallelism in software and hardware to reduce calibration time on multicore computers with minimal parallelization effort. At first, HydroGeoChem 5.0 (HGC5) is parallelized using OpenMP for a uranium transport model with over a hundred species involving nearly a hundred reactions, and a field scale coupled flow and transport model. In the first application, a single parallelizable loop is identified to consume over 97% of the total computational time. With a few lines of OpenMP compiler directives inserted into the code, the computational time reduces about ten times on a compute node with 16 cores. The performance is further improved by selectively parallelizing a few more loops. For the field scale application, parallelizable loops in 15 of the 174 subroutines in HGC5 are identified to take more than 99% of the execution time. By adding the preconditioned conjugate gradient solver and BICGSTAB, and using a coloring scheme to separate the elements, nodes, and boundary sides, the subroutines for finite element assembly, soil property update, and boundary condition application are parallelized, resulting in a speedup of about 10 on a 16-core compute node. The Levenberg-Marquardt (LM) algorithm is added into HGC5 with the Jacobian calculation and lambda search parallelized using MPI. With this hybrid approach, compute nodes at the number of adjustable parameters (when the forward difference is used for Jacobian approximation), or twice that number (if the center difference is used), are used to reduce the calibration time from days and weeks to a few hours for the two applications. This approach can be extended to global optimization scheme and Monte Carol analysis where thousands of compute nodes can be efficiently utilized.

54 ENVIRONMENTAL SCIENCES↗

Investigating the Influence of Hexanuclear Clusters in Isostructural Metal–Organic Frameworks on Toxic Gas Adsorption

The efficient capture of toxic gases, such as ammonia (NH 3 ) and sulfur dioxide (SO 2 ), can protect the general population and mitigate widespread air pollution. Metal–organic frameworks (MOFs) comprise a tunable class of adsorbents with high surface areas that can meet this challenge by selectively capturing these gases at low concentrations. In this work, we explored how modifying the metal ions in the node of an isostructural MOF series from a transition metal to a lanthanide or actinide influences the electronic environment of the node-based active site. Next, we investigated the adsorption properties of each MOF toward the relatively basic NH 3 and relatively acidic SO 2 gases. Within the NU-907 family of MOFs, we found that Zr 6 -NU-907 exhibits the best uptake toward NH 3 at low pressures, while Th 6 -NU-907 demonstrates the best low-pressure performance for SO 2 adsorption. Here, tracking the infrared (IR) stretching frequency of the node-based μ 3 -OH groups provides insights into the electronegativity of the metal ion and suggests that the most electronegative metal ion (Zr) affords the node with the best NH 3 uptake at low pressures. In contrast, the Th 6 node contains additional coordinated water groups relative to the other M 6 nodes, which appears to yield the MOF with the greatest affinity for SO 2 uptake that occurs predominately through reversible physisorption interactions. Finally, in situ NH3 IR spectroscopic studies indicate that both NH 4 + and Lewis-bound NH 3 species form during adsorption. Combined, these results suggest that tuning the electronic properties and structure of the node-based active site in an MOF presents a viable strategy to change the affinity of an MOF toward toxic gases.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bismuth-Polyoxocation Coordination Networks: Controlling Nuclearity and Dimension-Dependent Photocatalysis

Bismuth-oxocluster nodes for metal–organic frameworks (MOFs) and coordination networks/polymers are less prolific than other families featuring zinc, zirconium, titanium, lanthanides, etc. However, Bi 3+ is non-toxic, it readily forms polyoxocations, and its oxides are exploited in photocatalysis. This family of compounds provides opportunity in medicinal and energy applications. Here, we show that Bi node nuclearity depends on solvent polarity, leading to a family of Bi x -sulfonate/carboxylate coordination networks with x = 1–38. Larger nuclearity-node networks were obtained from polar and strongly coordinating solvents, and we attribute the solvent’s ability to stabilize larger species in solution. Here, the strong role of the solvent and the lesser role of the linker in defining node topologies differ from other MOF syntheses, and this is due to the Bi 3+ intrinsic lone pair that leads to weak node–linker interactions. We describe this family by single-crystal X-ray diffraction (eleven structures), obtained in pure forms and high yields. Ditopic linkers include NDS (1,5-naphthalenedisulfonate), DDBS (2,2'-[biphenyl-4,4'-diylchethane-2,1-diyl] dibenzenesulphonate), and NH 2 -benzendicarboxylate (BDC). While the BDC and NDS linkers yield more open-framework topologies that resemble those obtained by carboxylate linkers, topologies with DDBS linkers appear to be in part driven by association between DDBS molecules. An in situ small-angle X-ray scattering study of Bi 38 -DDBS reveals stepwise formation, including Bi 38 -assembly, pre-organization in solution, followed by crystallization, confirming the less important role of the linker. We demonstrate photocatalytic hydrogen (H 2 ) generation with select members of the synthesized materials without the benefit of a co-catalyst. Band gap determination from X-ray photoelectron spectroscopy (XPS) and UV–vis data suggest the DDBS linker effectively absorbs in the visible range with ligand-to-Bi-node charge transfer. In addition, materials containing more Bi (larger Bi 38 -nodes or Bi 6 inorganic chains) exhibit strong UV absorption, also contributing to effective photocatalysis by a different mechanism. All tested materials became black with extensive UV–vis exposure, and XPS, transmission electron microscopy, and X-ray scattering of the black Bi 38 -framework suggest that Bi o is formed in situ, without phase segregation. This evolution leads to enhanced photocatalytic performance, perhaps due to increased light absorption.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Versatile feature learning with graph convolutions and graph structures

Graphs represent real world relationships, and graph embedding projects nodes in a graph to a latent space that can help simplify downstream tasks. Recent development of graph convolutions in deep learning significantly improves the performance of many learning tasks on graphs. Unfortunately, prior embedding methods either do not embed graphs with node features, or fail to produce high-quality embeddings for downstream learning tasks that result in large performance gap in comparison to direct learning on graphs.We present a versatile and effective embedding method, Conv2Vec, for embedding graphs with or without node features. It is based on graph convolutions with objective functions motivated by concepts and structures from classical graph algorithms. Conv2Vec produce high-quality embedding for both plain graphs and graphs with node features for downstream tasks.We evaluate the embeddings generated by Conv2Vec with a transductive node classification task. With the generated embeddings and very simple machine learning approaches, we are able to achieve accuracies similar to those achieved by direct learning with graph convolutions. Interestingly, if we strip the node features from the graph and thus learning an embedding has to rely entirely on the graph topology, node classification with our embedding significantly outperforms direct learning with various graph convolutions. This suggests that structures from classical graph algorithms may play an important role in learning on graphs.

Cong, Guojing↗

Lifeline-based Global Load Balancing

On shared-memory systems, Cilk-style work-stealing has been used to effectively parallelize irregular task-graph based applications such as Unbalanced Tree Search (UTS). There are two main difficulties in extending this approach to distributed memory. In the shared memory approach, thieves (nodes without work) constantly attempt to asynchronously steal work from randomly chosen victims until they find work. In distributed memory, thieves cannot autonomously steal work from a victim without disrupting its execution. When work is sparse, this results in performance degradation. In essence, a direct extension of traditional work-stealing to distributed memory violates the work-first principle underlying work-stealing. Further, thieves spend useless CPU cycles attacking victims that have no work, resulting in system inefficiencies in multi-programmed contexts. Second, it is non-trivial to detect active distributed termination (detect that programs at all nodes are looking for work, hence there is no work). This problem is well-studied and requires careful design for good performance. Unfortunately, in most existing languages/frameworks, application developers are forced to implement their own distributed termination detection. In this paper, we develop a simple set of ideas that allow work-stealing to be efficiently extended to distributed memory. First, we introduce lifeline graphs: low-degree, low diameter, fully connected directed graphs. Such graphs can be constructed from k-dimensional hypercubes. When a node is unable to find work after w unsuccessful steals, it quiesces after informing the outgoing edges in its lifeline graph. Quiescent nodes do not disturb other nodes. A quiesced node is reactivated when work arrives from a lifeline and itself shares this work with those of its incoming lifelines that are activated. Termination occurs precisely when computation at all nodes has quiesced. In a language such as X10, such passive distributed termination can be detected automatically using the finish construct -- no application code is necessary.

99 GENERAL AND MISCELLANEOUS↗

Measuring and Improving the Core Resilience of Networks

The concept of k-cores is important for understanding the global structure of networks, as well as for identifying central or important nodes within a network. It is often valuable to understand the resilience of the k-cores of a network to attacks and dropped edges (i.e., damaged communications links). We provide a formal definition of a network»s core resilience, and examine the problem of characterizing core resilience in terms of the network»s structural features: in particular, which structural properties cause a network to have high or low core resilience? To measure this, we introduce two novel node properties,Core Strength andCore Influence, which measure the resilience of individual nodes» core numbers and their influence on other nodes» core numbers. Using these properties, we propose theMaximize Resilience of k-Core algorithm to add edges to improve the core resilience of a network. We consider two attack scenarios - randomly deleted edges and randomly deleted nodes. Through experiments on a variety of technological and infrastructure network datasets, we verify the efficacy of our node-based resilience measures at predicting the resilience of a network, and evaluate MRKC at the task of improving a network»s core resilience. We find that on average, for edge deletion attacks, MRKC improves the resilience of a network by 11.1% over the original network, as compared to the best baseline method, which improves the resilience of a network by only 2%. For node deletion attacks, MRKC improves the core resilience of the original network by 19.7% on average, while the best baseline improves it by only 3%.

Laishram, Ricky↗

A network of soil moisture, soil temperature, air temperature, net radiation, ground heat flux and ground water for Chicago, Illinois

This dataset contains environmental monitoring data collected using solar-powered Multi-Function Research (MFR) Long Range Wide Area (LoRaWAN)-enabled nodes at 11 sites in Chicago, Illinois, as part of the DOE Urban Integrated Field Lab CROCUS project. The MFR node system consists of an Input/Output Digital Input Module (IB8) interface box (ICT International) providing wired connections for environmental sensors and an MFR-Node-L data logger that manages power, data processing, and LoRaWAN communication. The wireless data are ingested via Sage network (https://sagecontinuum.org/) nodes that contain LoRaWAN antennae. Measurements were collected from 11 MFR nodes deployed across Chicago State University (CSU), Northeastern Illinois University (NEIU), Northwestern University (NU), University of Illinois Chicago (UIC), West Woodlawn "Blacks in Green" (BIG), and Indian Boundary Prairies (IBP). Each MFR node supports a consistent suite of sensors measuring atmospheric, soil, and hydrological variables. Atmospheric measurements include 2m air temperature (°C), 2m vapor pressure deficit (kPa), and 2m shortwave/longwave radiation (incoming and outgoing, W/m²) measured using ATH-VPD and Apogee SN500 sensors. Soil measurements include volumetric water content (VWC, %) and temperature (°C) at four depths (15, 30, 45, and 60 cm below surface) using Meter Teros54 sensors, and heat flux (W/m²) at 10 cm depth using Huske HFP01-05 sensors. At selected locations, Meter Hydros21 sensors measure groundwater depth (mm), specific conductivity (dS/m), and temperature (°C). The dataset includes timestamps, site identifiers with location names, device IDs, Global Positioning System (GPS) coordinates, variable names with units, measurement depths, values, sensor names, and Sage node identifiers. All timestamps are in local Chicago time (CDT/CST). Quality control flags are provided using a 6-bit binary system indicating physical range violations, step spikes, 24-hour flat-line conditions, 6-hour jitter, 7-day ultra-low variance, and persistent high offset. Data is provided in CSV and CF-compliant NetCDF formats. This dataset is part of a larger collection of CROCUS environmental monitoring data, including linked datasets from Air Quality Transmitter (AQT) sensors, Weather Transmitter (WXT) sensors, and Sap Flow Meter (SFM1x) sensors.

Chicago↗

Evolution of Robustness in Growing Random Networks

Networks are widely used to model the interaction between individual dynamic systems. In many instances, the total number of units and interaction coupling are not fixed in time, and instead constantly evolve. In networks, this means that the number of nodes and edges both change over time. Various properties of coupled dynamic systems, such as their robustness against noise, essentially depend on the structure of the interaction network. Therefore, it is of considerable interest to predict how these properties are affected when the network grows as well as their relationship to the growth mechanism. Here, we focus on the time evolution of a network’s Kirchhoff index. We derive closed-form expressions for its variation in various scenarios, including the addition of both edges and nodes. For the latter case, we investigate the evolution where single nodes with one or two edges connecting to existing nodes are added recursively to a network. In both cases, we derive the relations between the properties of the nodes to which the new node connects along with the global evolution of network robustness. In particular, we show how different scalings of the Kirchhoff index can be obtained as a function of the number of nodes. We illustrate and confirm this theory via numerical simulations of randomly growing networks.

97 MATHEMATICS AND COMPUTING↗