Information Spread of Emergency Events: Path Searching on Social Networks by Weihui Dai, Hongzhi Hu, Tunan Wu, Yonghui Dai

“…This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. …”
Get full text

Analysis of the structural reliability of communication networks supporting protective switching mechanisms for one protected section and one backup section by K. А. Batenkov, A. B. Fokin

“…The following methods are used: theory of random graphs, matrices, probabilities and computer modeling.Results. …”
Get full text

A Network-Based Approach to Modeling and Predicting Product Coconsideration Relations by Zhenghui Sha, Yun Huang, Jiawei Sophia Fu, Mingxian Wang, Yan Fu, Noshir Contractor, Wei Chen

“…This paper presents a network-based approach based on Exponential Random Graph Models to study customers’ consideration behaviors according to engineering design. …”
Get full text

The Intertemporal Evolution Model of Enterprise R&D Cooperative Network by Rongguo Qiu, Yutong Wang, Tingqiang Chen

“…This work uses calculation experiment and simulation method to study the evolution characteristics of enterprise R&D network in different initial R&D network topology structures, such as Erdos–Renyi random graph, WS small-world network, and BA scale-free network, and determine how previous history, attractiveness, and reputation for enterprise influence the steady-state characteristics of R&D network evolution. …”
Get full text

A Weighted Statistical Network Modeling Approach to Product Competition Analysis by Yaxin Cui, Faez Ahmed, Zhenghui Sha, Lijun Wang, Yan Fu, Noshir Contractor, Wei Chen

“…Then, we propose a weighted network modeling approach by extending the valued exponential random graph model to investigate the effects of product features and network structures on product competition relations. …”
Get full text

Design of low-carbon planning model for vehicle path based on adaptive multi-strategy ant colony optimization algorithm by Qi Guo, Rui Li, Changjiang Zheng, Gwanggil Jeon

“…Experimental results demonstrate that ACGNN yields significant path planning outcomes on both public and custom-built datasets, surpassing the traditional Dijkstra’s shortest path algorithm, random graph network (RGN), and conventional GNN methodologies. …”
Get full text

Patient-sharing networks among Finnish primary healthcare professionals taking care of patients with mental health or substance use problems: a register study by Christian Hakulinen, Marko Elovainio, Jaana Suvisaari, Timo Sinervo, Laura Hietapakka, Visa Väisänen, Ripsa Niemi, Mai Gutvilig, Outi Linnaranta

“…A patient-sharing relationship was defined between two professionals if a same patient had visited both of them at least once.Primary outcome measures We analysed the potential associations of the network structure and the nodal attributes (municipality, belonging to a certain occupational group and the service type) with nodal formation using Exponential Random Graph Models.Results The main findings showed that two professionals were more likely to share patient(s) when they belonged to the same occupational group, provided similar types of services or worked in the same municipality. …”
Get full text

Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs by Y. Tang, Q. L. Li

“…For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. …”
Get full text

Spectral properties, localization transition and multifractal eigenvectors of the Laplacian on heterogeneous networks by Jeferson D. da Silva, Diego Tapias, Peter Sollich, Fernando L. Metz

“…In this case, the corresponding eigenvectors display localization properties reminiscent of the critical point of the Anderson localization transition on random graphs.…”
Get full text

Synthetic graphs for link prediction benchmarking by Alexey Vlaskin, Eduardo G Altmann

“…We propose a family of random graphs that incorporates both micro-scale motifs and meso-scale communities, two ubiquitous structures in complex networks. …”
Get full text

Spreading Social Influence with both Positive and Negative Opinions in Online Networks by Jing (Selena) He, Meng Han, Shouling Ji, Tianyu Du, Zhao Li

“…Finally, to validate the proposed greedy algorithm, we conduct extensive simulations and experiments on random graphs and seven different real-world data sets that represent small-, medium-, and large-scale networks.…”
Get full text

Approximate Solutions of Combinatorial Problems via Quantum Relaxations by Bryce Fuller, Charles Hadfield, Jennifer R. Glick, Takashi Imamichi, Toshinari Itoko, J. Richard Thompson, Yang Jiao, M. Marna Kagele, W. Blom-Schieber Adriana, Rudy Raymond, Antonio Mezzacapo

“…The proposed quantum relaxations inherit memory compression from quantum random access codes, which allowed us to test the performances of the methods presented for 3-regular random graphs and a design problem motivated by industry for sizes up to 40 nodes, on superconducting quantum processors.…”
Get full text