BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Jianxi Gao

Jianxi Gao contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
physics.soc-phMachine LearningApplicationsComputer VisionMultiagent SystemsSocial and Information NetworksArtificial Intelligenceeess.SYmath.DSnlin.AOphysics.data-anQuantitative MethodsSystems and Control

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
12works
0followers
13topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

12 published item(s)

preprint2026arXiv

Intermediate Representations are Strong AI-Generated Image Detectors

The rapid advancement in generative AI models has enabled the creation of photorealistic images. At the same time, there are growing concerns about the potential misuse and dangers of generated content, as well as a pressing need for effective AI-generated image detectors. However, current training-based detection techniques are typically computationally costly and can hardly be generalized to unseen data domains, while training-free methods fall short in detection performance. To bridge this gap, we propose a search-based method employing data embedding sensitivity in intermediate layers to detect AI-generated images. Given a set of real and AI-generated images, our method examines the similarity between original image embeddings and perturbed image embeddings, and detects AI-generated images based on the similarity. We examine the proposed method on two comprehensive benchmarks: GenImage and Forensics Small. Our method exhibits improved performance across different datasets compared to both training-free and training-based state-of-the-art methods. On average, our method achieves the largest performance gain on the Forensics Small benchmark by 39.61% compared to the best training-free method and 5.14% compared to the best training-based method in AUROC score.

0 citations0 reviewsNo code linkedOpen access
preprint2023arXiv

Reconstructing Sparse Multiplex Networks with Application to Covert Networks

Network structure provides critical information for understanding the dynamic behavior of networks. However, the complete structure of real-world networks is often unavailable, thus it is crucially important to develop approaches to infer a more complete structure of networks. In this paper, we integrate the configuration model for generating random networks into an Expectation-Maximization-Aggregation (EMA) framework to reconstruct the complete structure of multiplex networks. We validate the proposed EMA framework against the random model on several real-world multiplex networks, including both covert and overt ones. It is found that the EMA framework generally achieves the best predictive accuracy compared to the EM framework and the random model. As the number of layers increases, the performance improvement of EMA over EM decreases. The inferred multiplex networks can be leveraged to inform the decision-making on monitoring covert networks as well as allocating limited resources for collecting additional information to improve reconstruction accuracy. For law enforcement agencies, the inferred complete network structure can be used to develop more effective strategies for covert network interdiction.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Bullwhip Effect of Supply Networks: Joint Impact of Network Structure and Market Demand

The progressive amplification of fluctuations in demand as the demand travels upstream the supply chains is known as the bullwhip effect. We first analytically characterize the bullwhip effect in general supply chain networks in two cases: (i) all suppliers have a unique layer position, where our method is founded on the control-theoretic approach, and (ii) not all suppliers have a unique layer position due to the presence of intra-layer links or inter-layer links between suppliers that are not positioned in consecutive layers, where we use both the absorbing Markov chain and the control-theoretic approach. We then investigate how network structures impact the BWE of supply chain networks. In particular, we analytically show that (i) if the market demand is generated from the same stationary process, the structure of supply networks does not affect the layer-wise bullwhip effect of supply networks, and (ii) if the market demand is generated from different stationary or non-stationary market processes, wider supply networks lead to a lower level of layer-wise bullwhip effect. Finally, numerical simulations are used to validate our propositions.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Network resilience

Many systems on our planet are known to shift abruptly and irreversibly from one state to another when they are forced across a "tipping point," such as mass extinctions in ecological networks, cascading failures in infrastructure systems, and social convention changes in human and animal networks. Such a regime shift demonstrates a system's resilience that characterizes the ability of a system to adjust its activity to retain its basic functionality in the face of internal disturbances or external environmental changes. In the past 50 years, attention was almost exclusively given to low dimensional systems and calibration of their resilience functions and indicators of early warning signals without considerations for the interactions between the components. Only in recent years, taking advantages of the network theory and lavish real data sets, network scientists have directed their interest to the real-world complex networked multidimensional systems and their resilience function and early warning indicators. This report is devoted to a comprehensive review of resilience function and regime shift of complex systems in different domains, such as ecology, biology, social systems and infrastructure. We cover the related research about empirical observations, experimental studies, mathematical modeling, and theoretical analysis. We also discuss some ambiguous definitions, such as robustness, resilience, and stability.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Neural Capacitance: A New Perspective of Neural Network Selection via Edge Dynamics

Efficient model selection for identifying a suitable pre-trained neural network to a downstream task is a fundamental yet challenging task in deep learning. Current practice requires expensive computational costs in model training for performance prediction. In this paper, we propose a novel framework for neural network selection by analyzing the governing dynamics over synaptic connections (edges) during training. Our framework is built on the fact that back-propagation during neural network training is equivalent to the dynamical evolution of synaptic connections. Therefore, a converged neural network is associated with an equilibrium state of a networked system composed of those edges. To this end, we construct a network mapping $ϕ$, converting a neural network $G_A$ to a directed line graph $G_B$ that is defined on those edges in $G_A$. Next, we derive a neural capacitance metric $β_{\rm eff}$ as a predictive measure universally capturing the generalization capability of $G_A$ on the downstream task using only a handful of early training results. We carried out extensive experiments using 17 popular pre-trained ImageNet models and five benchmark datasets, including CIFAR10, CIFAR100, SVHN, Fashion MNIST and Birds, to evaluate the fine-tuning performance of our framework. Our neural capacitance metric is shown to be a powerful indicator for model selection based only on early training results and is more efficient than state-of-the-art methods.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Reviving a failed network through microscopic interventions

From mass extinction to cell death, complex networked systems often exhibit abrupt dynamic transitions between desirable and undesirable states. Such transitions are often caused by topological perturbations, such as node or link removal, or decreasing link strengths. The problem is that reversing the topological damage, namely retrieving the lost nodes or links, or reinforcing the weakened interactions, does not guarantee the spontaneous recovery to the desired functional state. Indeed, many of the relevant systems exhibit a hysteresis phenomenon, remaining in the dysfunctional state, despite reconstructing their damaged topology. To address this challenge, we develop a two-step recovery scheme: first - topological reconstruction to the point where the system can be revived, then dynamic interventions, to reignite the system's lost functionality. Applying this method to a range of nonlinear network dynamics, we identify the recoverable phase of a complex system, a state in which the system can be reignited by microscopic interventions, for instance, controlling just a single node. Mapping the boundaries of this dynamical phase, we obtain guidelines for our two-step recovery.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Network percolation reveals adaptive bridges of the mobility network response to COVID-19

Human mobility is crucial to understand the transmission pattern of COVID-19 on spatially embedded geographic networks. This pattern seems unpredictable, and the propagation appears unstoppable, resulting in over 350,000 death tolls in the U.S. by the end of 2020. Here, we create the spatiotemporal inter-county mobility network using 10 TB (Terabytes) trajectory data of 30 million smart devices in the U.S. in the first six months of 2020. We investigate its bound percolation by removing the weakly connected edges. The mobility network becomes vulnerable and prone to reach its criticality and thus experience surprisingly abrupt phase transitions. Despite the complex behaviors of the mobility network, we devised a novel approach to identify a small, manageable set of recurrent critical bridges, connecting the giant component and the second-largest component. These adaptive links, located across the United States, played a key role as valves connecting components in divisions and regions during the pandemic. Beyond, our numerical results unveil that network characteristics determine the critical thresholds and the bridge locations. The findings provide new insights into managing and controlling the connectivity of mobility networks during unprecedented disruptions. The work can also potentially offer practical future infectious diseases both globally and locally.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Discrimination universally determines reconstruction of multiplex networks

Network reconstruction is fundamental to understanding the dynamical behaviors of the networked systems. Many systems, modeled by multiplex networks with various types of interactions, display an entirely different dynamical behavior compared to the corresponding aggregated network. In many cases, unfortunately, only the aggregated topology and partial observations of the network layers are available, raising an urgent demand for reconstructing multiplex networks. We fill this gap by developing a mathematical and computational tool based on the Expectation-Maximization framework to reconstruct multiplex layer structures. The reconstruction accuracy depends on the various factors, such as partial observation and network characteristics, limiting our ability to predict and allocate observations. Surprisingly, by using a mean-field approximation, we discovered that a discrimination indicator that integrates all these factors universally determines the accuracy of reconstruction. This discovery enables us to design the optimal strategies to allocate the fixed budget for deriving the partial observations, promoting the optimal reconstruction of multiplex networks. To further evaluate the performance of our method, we predict beside structure also dynamical behaviors on the multiplex networks, including percolation, random walk, and spreading processes. Finally, applying our method on empirical multiplex networks drawn from biological, transportation, and social domains, corroborate the theoretical analysis.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

High-resolution human mobility data reveal race and wealth disparities in disaster evacuation patterns

Major disasters such as extreme weather events can magnify and exacerbate pre-existing social disparities, with disadvantaged populations bearing disproportionate costs. Despite the implications for equity and emergency planning, we lack a quantitative understanding of how these social fault lines translate to different behaviors in large-scale emergency contexts. Here we investigate this problem in the context of Hurricane Harvey, using over 30 million anonymized GPS records from over 150,000 opted-in users in the Greater Houston Area to quantify patterns of disaster-inflicted relocation activities before, during, and after the shock. We show that evacuation distance is highly homogenous across individuals from different types of neighborhoods classified by race and wealth, obeying a truncated power-law distribution. Yet here the similarities end: we find that both race and wealth strongly impact evacuation patterns, with disadvantaged minority populations less likely to evacuate than wealthier white residents. Finally, there are considerable discrepancies in terms of departure and return times by race and wealth, with strong social cohesion among evacuees from advantaged neighborhoods in their destination choices. These empirical findings bring new insights into mobility and evacuations, providing policy recommendations for residents, decision makers, and disaster managers alike.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Inferring Degrees from Incomplete Networks and Nonlinear Dynamics

Inferring topological characteristics of complex networks from observed data is critical to understand the dynamical behavior of networked systems, ranging from the Internet and the World Wide Web to biological networks and social networks. Prior studies usually focus on the structure-based estimation to infer network sizes, degree distributions, average degrees, and more. Little effort attempted to estimate the specific degree of each vertex from a sampled induced graph, which prevents us from measuring the lethality of nodes in protein networks and influencers in social networks. The current approaches dramatically fail for a tiny sampled induced graph and require a specific sampling method and a large sample size. These approaches neglect information of the vertex state, representing the dynamical behavior of the networked system, such as the biomass of species or expression of a gene, which is useful for degree estimation. We fill this gap by developing a framework to infer individual vertex degrees using both information of the sampled topology and vertex state. We combine the mean-field theory with combinatorial optimization to learn vertex degrees. Experimental results on real networks with a variety of dynamics demonstrate that our framework can produce reliable degree estimates and dramatically improve existing link prediction methods by replacing the sampled degrees with our estimated degrees.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Macroscopic and Microscopic Characteristics of Networks with Time-variant Functionality for Evaluating Resilience to External Perturbations

Knowledge of time-variant functionality of real-world physical, social, and engineered networks is critical to the understanding of the resilience of networks facing external perturbations. The majority of existing studies, however, focus only on the topological properties of networks for resilience assessment, which does not fully capture their dynamical resilience. In this study, we evaluate and quantify network resilience based both on the functionality states of links and on topology. We propose three independent measures---the failure scaling index (FSI), the weighted degree scaling index (WDSI), and the link functionality irregularity index (LFII)---that capture macroscopic, microscopic, and temporal performance characteristics of networks. Accordingly, an integrated general resilience (GR) metric is used to assess performance loss and recovery speed in networks with time-variant functionality. We test the proposed methods in the study of traffic networks under urban flooding impacts in the context of Harris County, Texas, during Hurricane Harvey using a high-resolution dataset, which contains temporal speed of 20,000 roads every 5 minutes for 5 months. Our results show that link weights and node weighted degrees with perturbed functionality in the traffic network during flooding follow a scale-free distribution. Hence, three proposed measures capture clear resilience curves of the network as well as identify the irregularity of links. Accordingly, network performance measures and the methodology for resilience quantification reveal insights into the extent of network performance loss and recovery speed, suggesting possible improvements in network resilience in the face of external perturbations such as urban flooding.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

True Nonlinear Dynamics from Incomplete Networks

We study nonlinear dynamics on complex networks. Each vertex $i$ has a state $x_i$ which evolves according to a networked dynamics to a steady-state $x_i^*$. We develop fundamental tools to learn the true steady-state of a small part of the network, without knowing the full network. A naive approach and the current state-of-the-art is to follow the dynamics of the observed partial network to local equilibrium. This dramatically fails to extract the true steady state. We use a mean-field approach to map the dynamics of the unseen part of the network to a single node, which allows us to recover accurate estimates of steady-state on as few as 5 observed vertices in domains ranging from ecology to social networks to gene regulation. Incomplete networks are the norm in practice, and we offer new ways to think about nonlinear dynamics when only sparse information is available.

0 citations0 reviewsNo code linkedOpen access