Source author record

Yanqing Hu

Yanqing Hu appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

30works
15topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

30 published item(s)

preprint2026arXiv

Robust LLM Unlearning Against Relearning Attacks: The Minor Components in Representations Matter

Large language model (LLM) unlearning aims to remove specific data influences from pre-trained model without costly retraining, addressing privacy, copyright, and safety concerns. However, recent studies reveal a critical vulnerability: unlearned models rapidly recover "forgotten" knowledge through relearning attacks. This fragility raises serious security concerns, especially for open-weight models. In this work, we investigate the fundamental mechanism underlying this fragility from a representation geometry perspective. We discover that existing unlearning methods predominantly optimize along dominant components, leaving minor components largely unchanged. Critically, during relearning attacks, the modifications in these dominant components are easily reversed, enabling rapid knowledge recovery, whereas minor components exhibit stronger resistance to such reversal. We further provide a theoretical analysis that explains both observations from the spectral structure of representations. Building on this insight, we propose Minor Component Unlearning (MCU), a novel unlearning approach that explicitly targets minor components in representations. By concentrating unlearning effects in these inherently robust directions, our method achieves substantially improved resistance to relearning attacks. Extensive experiments on three datasets validate our approach, demonstrating significant improvements over state-of-the-art methods including sharpness-aware minimization.

preprint2021arXiv

Detecting and modelling real percolation and phase transitions of information on social media

It is widely believed that information spread on social media is a percolation process, with parallels to phase transitions in theoretical physics. However, evidence for this hypothesis is limited, as phase transitions have not been directly observed in any social media. Here, through analysis of 100 million Weibo and 40 million Twitter users, we identify percolation-like spread, and find that it happens more readily than current theoretical models would predict. The lower percolation threshold can be explained by the existence of positive feedback in the coevolution between network structure and user activity level, such that more active users gain more followers. Moreover, this coevolution induces an extreme imbalance in users' influence. Our findings indicate that the ability of information to spread across social networks is higher than expected, with implications for many information spread problems.

preprint2020arXiv

A Novel Framework with Information Fusion and Neighborhood Enhancement for User Identity Linkage

User identity linkage across social networks is an essential problem for cross-network data mining. Since network structure, profile and content information describe different aspects of users, it is critical to learn effective user representations that integrate heterogeneous information. This paper proposes a novel framework with INformation FUsion and Neighborhood Enhancement (INFUNE) for user identity linkage. The information fusion component adopts a group of encoders and decoders to fuse heterogeneous information and generate discriminative node embeddings for preliminary matching. Then, these embeddings are fed to the neighborhood enhancement component, a novel graph neural network, to produce adaptive neighborhood embeddings that reflect the overlapping degree of neighborhoods of varying candidate user pairs. The importance of node embeddings and neighborhood embeddings are weighted for final prediction. The proposed method is evaluated on real-world social network data. The experimental results show that INFUNE significantly outperforms existing state-of-the-art methods.

preprint2016arXiv

Frequency-dependent attenuation and elasticity in unconsolidated earth materials: effect of damping

We use the Discrete Element Method (DEM) to understand the underlying attenuation mechanism in granular media, with special applicability to the measurements of the so-called effective mass developed earlier. We consider that the particles interact via Hertz-Mindlin elastic contact forces and that the damping is describable as a force proportional to the velocity difference of contacting grains. We determine the behavior of the complex-valued normal mode frequencies using 1) DEM, 2) direct diagonalization of the relevant matrix, and 3) a numerical search for the zeros of the relevant determinant. All three methods are in strong agreement with each other. The real and the imaginary parts of each normal mode frequency characterize the elastic and the dissipative properties, respectively, of the granular medium. We demonstrate that, as the interparticle damping, $ξ$, increases, the normal modes exhibit nearly circular trajectories in the complex frequency plane and that for a given value of $ξ$ they all lie on or near a circle of radius $R$ centered on the point $-iR$ in the complex plane, where $R\propto 1/ξ$. We show that each normal mode becomes critically damped at a value of the damping parameter $ξ\approx 1/ω_n^0$, where $ω_n^0$ is the (real-valued) frequency when there is no damping. The strong indication is that these conclusions carry over to the properties of real granular media whose dissipation is dominated by the relative motion of contacting grains. For example, compressional or shear waves in unconsolidated dry sediments can be expected to become overdamped beyond a critical frequency, depending upon the strength of the intergranular damping constant.

preprint2016arXiv

Percolation of networks with directed dependency links

The self-consistent probabilistic approach has proven itself powerful in studying the percolation behavior of interdependent or multiplex networks without tracking the percolation process through each cascading step. In order to understand how directed dependency links impact criticality, we employ this approach to study the percolation properties of networks with both undirected connectivity links and directed dependency links. We find that when a random network with a given degree distribution undergoes a second-order phase transition, the critical point and the unstable regime surrounding the second-order phase transition regime are determined by the proportion of nodes that do not depend on any other nodes. Moreover, we also find that the triple point and the boundary between first- and second-order transitions are determined by the proportion of nodes that depend on no more than one node. This implies that it is maybe general for multiplex network systems, some important properties of phase transitions can be determined only by a few parameters. We illustrate our findings using Erdos-Renyi (ER) networks.

preprint2015arXiv

A Simplified Self-Consistent Probabilities Framework to Characterize Percolation Phenomena on Interdependent Networks : An Overview

Interdependent networks are ubiquitous in our society, ranging from infrastructure to economics, and the study of their cascading behaviors using percolation theory has attracted much attention in the recent years. To analyze the percolation phenomena of these systems, different mathematical frameworks have been proposed including generating functions, eigenvalues among some others. These different frameworks approach the phase transition behaviors from different angles, and have been very successful in shaping the different quantities of interest including critical threshold, size of the giant component, order of phase transition and the dynamics of cascading. These methods also vary in their mathematical complexity in dealing with interdependent networks that have additional complexity in terms of the correlation among different layers of networks or links. In this work, we review a particular approach of simple self-consistent probability equations, and illustrate that it can greatly simplify the mathematical analysis for systems ranging from single layer network to various different interdependent networks. We give an overview on the detailed framework to study the nature of the critical phase transition, value of the critical threshold and size of the giant component for these different systems.

preprint2015arXiv

Avoiding catastrophic failure in correlated networks of networks

Networks in nature do not act in isolation but instead exchange information, and depend on each other to function properly. An incipient theory of Networks of Networks have shown that connected random networks may very easily result in abrupt failures. This theoretical finding bares an intrinsic paradox: If natural systems organize in interconnected networks, how can they be so stable? Here we provide a solution to this conundrum, showing that the stability of a system of networks relies on the relation between the internal structure of a network and its pattern of connections to other networks. Specifically, we demonstrate that if network inter-connections are provided by hubs of the network and if there is a moderate degree of convergence of inter-network connection the systems of network are stable and robust to failure. We test this theoretical prediction in two independent experiments of functional brain networks (in task- and resting states) which show that brain networks are connected with a topology that maximizes stability according to the theory.

preprint2015arXiv

Effective spreading from multiple leaders identified by percolation in social networks

Social networks constitute a new platform for information propagation, but its success is crucially dependent on the choice of spreaders who initiate the spreading of information. In this paper, we remove edges in a network at random and the network segments into isolated clusters. The most important nodes in each cluster then form a group of influential spreaders, such that news propagating from them would lead to an extensive coverage and minimal redundancy. The method well utilizes the similarities between the pre-percolated state and the coverage of information propagation in each social cluster to obtain a set of distributed and coordinated spreaders. Our tests on the Facebook networks show that this method outperforms conventional methods based on centrality. The suggested way of identifying influential spreaders thus sheds light on a new paradigm of information propagation on social networks.

preprint2014arXiv

Bootstrap percolation on spatial networks

We numerically study bootstrap percolation on Kleinberg's spatial networks, in which the probability density function of a node to have a long-range link at distance $r$ scales as $P(r)\sim r^α$. Setting the ratio of the size of the giant active component to the network size as the order parameter, we find a critical exponent $α_{c}=-1$, above which a hybrid phase transition is observed, with both the first-order and second-order critical points being constant. When $α<α_{c}$, the second-order critical point increases as the decreasing of $α$, and there is either absent of the first-order phase transition or with a decreasing first-order critical point as the decreasing of $α$, depending on other parameters. Our results expand the current understanding on the spreading of information and the adoption of behaviors on spatial social networks.

preprint2014arXiv

Competing for Attention in Social Media under Information Overload Conditions

Although the many forms of modern social media have become major channels for the dissemination of information, they are becoming overloaded because of the rapidly-expanding number of information feeds. We analyze the expanding user-generated content in Sina Weibo, the largest micro-blog site in China, and find evidence that popular messages often follow a mechanism that differs from that found in the spread of disease, in contrast to common believe. In this mechanism, an individual with more friends needs more repeated exposures to spread further the information. Moreover, our data suggest that in contrast to epidemics, for certain messages the chance of an individual to share the message is proportional to the fraction of its neighbours who shared it with him/her. Thus the greater the number of friends an individual has the greater the number of repeated contacts needed to spread the message, which is a result of competition for attention. We model this process using a fractional susceptible infected recovered (FSIR) model, where the infection probability of a node is proportional to its fraction of infected neighbors. Our findings have dramatic implications for information contagion. For example, using the FSIR model we find that real-world social networks have a finite epidemic threshold. This is in contrast to the zero threshold that conventional wisdom derives from disease epidemic models. This means that when individuals are overloaded with excess information feeds, the information either reaches out the population if it is above the critical epidemic threshold, or it would never be well received, leading to only a handful of information contents that can be widely spread throughout the population.

preprint2014arXiv

Conditions for viral influence spreading through multiplex correlated social networks

A fundamental problem in network science is to predict how certain individuals are able to initiate new networks to spring up "new ideas". Frequently, these changes in trends are triggered by a few innovators who rapidly impose their ideas through "viral" influence spreading producing cascades of followers fragmenting an old network to create a new one. Typical examples include the raise of scientific ideas or abrupt changes in social media, like the raise of Facebook.com to the detriment of Myspace.com. How this process arises in practice has not been conclusively demonstrated. Here, we show that a condition for sustaining a viral spreading process is the existence of a multiplex correlated graph with hidden "influence links". Analytical solutions predict percolation phase transitions, either abrupt or continuous, where networks are disintegrated through viral cascades of followers as in empirical data. Our modeling predicts the strict conditions to sustain a large viral spreading via a scaling form of the local correlation function between multilayers, which we also confirm empirically. Ultimately, the theory predicts the conditions for viral cascading in a large class of multiplex networks ranging from social to financial systems and markets.

preprint2014arXiv

Multiple Hybrid Phase Transition: Bootstrap Percolation on Complex Networks with Communities

Bootstrap percolation is a well-known model to study the spreading of rumors, new products or innovations on social networks. The empirical studies show that community structure is ubiquitous among various social networks. Thus, studying the bootstrap percolation on the complex networks with communities can bring us new and important insights of the spreading dynamics on social networks. It attracts a lot of scientists' attentions recently. In this letter, we study the bootstrap percolation on Erdős-Rényi networks with communities and observed second order, hybrid (both second and first order) and multiple hybrid phase transitions, which is rare in natural system. Moreover, we have analytically solved this system and obtained the phase diagram, which is further justified well by the corresponding simulations.

preprint2014arXiv

Stress-dependent normal mode frequencies from the effective mass of granular matter

A zero-temperature critical point has been invoked to control the anomalous behavior of granular matter as it approaches jamming or mechanical arrest. Criticality manifests itself in an anomalous spectrum of low-frequency normal modes and scaling behavior near the jamming transition. The critical point may explain the peculiar mechanical properties of dissimilar systems such as glasses and granular materials. Here, we study the critical scenario via an experimental measurement of the normal modes frequencies of granular matter under stress from a pole decomposition analysis of the effective mass. We extract a complex-valued characteristic frequency which displays scaling $|ω^*(σ)|\simσ^{Ω'}$ with vanishing stress $σ$ for a variety of granular systems. The critical exponent is smaller than that predicted by mean-field theory opening new challenges to explain the exponent for frictional and dissipative granular matter. Our results shed light on the anomalous behavior of stress-dependent acoustics and attenuation in granular materials near the jamming transition.

preprint2013arXiv

Percolation of Interdependent Networks with Inter-similarity

Real data show that interdependent networks usually involve inter-similarity. Intersimilarity means that a pair of interdependent nodes have neighbors in both networks that are also interdependent (Parshani et al \cite{PAR10B}). For example, the coupled world wide port network and the global airport network are intersimilar since many pairs of linked nodes (neighboring cities), by direct flights and direct shipping lines exist in both networks. Nodes in both networks in the same city are regarded as interdependent. If two neighboring nodes in one network depend on neighboring nodes in the another we call these links common links. The fraction of common links in the system is a measure of intersimilarity. Previous simulation results suggest that intersimilarity has considerable effect on reducing the cascading failures, however, a theoretical understanding on this effect on the cascading process is currently missing. Here, we map the cascading process with inter-similarity to a percolation of networks composed of components of common links and non common links. This transforms the percolation of inter-similar system to a regular percolation on a series of subnetworks, which can be solved analytically. We apply our analysis to the case where the network of common links is an Erdős-Rényi (ER) network with the average degree $K$, and the two networks of non-common links are also ER networks. We show for a fully coupled pair of ER networks, that for any $K\geq0$, although the cascade is reduced with increasing $K$, the phase transition is still discontinuous. Our analysis can be generalized to any kind of interdependent random networks system.

preprint2012arXiv

Asymptotic properties of covariate-adaptive randomization

Balancing treatment allocation for influential covariates is critical in clinical trials. This has become increasingly important as more and more biomarkers are found to be associated with different diseases in translational research (genomics, proteomics and metabolomics). Stratified permuted block randomization and minimization methods [Pocock and Simon Biometrics 31 (1975) 103-115, etc.] are the two most popular approaches in practice. However, stratified permuted block randomization fails to achieve good overall balance when the number of strata is large, whereas traditional minimization methods also suffer from the potential drawback of large within-stratum imbalances. Moreover, the theoretical bases of minimization methods remain largely elusive. In this paper, we propose a new covariate-adaptive design that is able to control various types of imbalances. We show that the joint process of within-stratum imbalances is a positive recurrent Markov chain under certain conditions. Therefore, this new procedure yields more balanced allocation. The advantages of the proposed procedure are also demonstrated by extensive simulation studies. Our work provides a theoretical tool for future research in this area.

preprint2011arXiv

Detecting the optimal number of communities in complex networks

To obtain the optimal number of communities is an important problem in detecting community structure. In this paper, we extend the measurement of community detecting algorithms to find the optimal community number. Based on the normalized mutual information index, which has been used as a measure for similarity of communities, a statistic $Ω(c)$ is proposed to detect the optimal number of communities. In general, when $Ω(c)$ reaches its local maximum, especially the first one, the corresponding number of communities \emph{c} is likely to be optimal in community detection. Moreover, the statistic $Ω(c)$ can also measure the significance of community structures in complex networks, which has been paid more attention recently. Numerical and empirical results show that the index $Ω(c)$ is effective in both artificial and real world networks.

preprint2011arXiv

Exact Solution for Optimal Navigation with Total Cost Restriction

Recently, Li \textit{et al.} have concentrated on Kleinberg's navigation model with a certain total length constraint $Λ= cN$, where $N$ is the number of total nodes and $c$ is a constant. Their simulation results for the 1- and 2-dimensional cases indicate that the optimal choice for adding extra long-range connections between any two sites seems to be $α=d+1$, where $d$ is the dimension of the lattice and $α$ is the power-law exponent. In this paper, we prove analytically that for the 1-dimensional large networks, the optimal power-law exponent is $α=2$ Further, we study the impact of the network size and provide exact solutions for time cost as a function of the power-law exponent $α$. We also show that our analytical results are in excellent agreement with simulations.

preprint2011arXiv

Navigation in non-uniform density social networks

Recent empirical investigations suggest a universal scaling law for the spatial structure of social networks. It is found that the probability density distribution of an individual to have a friend at distance $d$ scales as $P(d)\propto d^{-1}$. Since population density is non-uniform in real social networks, a scale invariant friendship network(SIFN) based on the above empirical law is introduced to capture this phenomenon. We prove the time complexity of navigation in 2-dimensional SIFN is at most $O(\log^4 n)$. In the real searching experiment, individuals often resort to extra information besides geography location. Thus, real-world searching process may be seen as a projection of navigation in a $k$-dimensional SIFN($k>2$). Therefore, we also discuss the relationship between high and low dimensional SIFN. Particularly, we prove a 2-dimensional SIFN is the projection of a 3-dimensional SIFN. As a matter of fact, this result can also be generated to any $k$-dimensional SIFN.

preprint2011arXiv

Percolation in Interdependent and Interconnected Networks: Abrupt Change from Second to First Order Transition

Robustness of two coupled networks system has been studied only for dependency coupling (S. Buldyrev et. al., Nature, 2010) and only for connectivity coupling (E. A. Leicht and R. M. D'Souza, arxiv:09070894). Here we study, using a percolation approach, a more realistic coupled networks system where both interdependent and interconnected links exist. We find a rich and unusual phase transition phenomena including hybrid transition of mixed first and second order i.e., discontinuities like a first order transition of the giant component followed by a continuous decrease to zero like a second order transition. Moreover, we find unusual discontinuous changes from second order to first order transition as a function of the dependency coupling between the two networks.

preprint2011arXiv

Toward a General Understanding of the Scaling Laws in Human and Animal Mobility

Recent research highlighted the scaling property of human and animal mobility. An interesting issue is that the exponents of scaling law for animals and humans in different situations are quite different. This paper proposes a general optimization model, a random walker following scaling laws (whose traveling distances in each step obey a power law distribution with exponent α) tries to diversify its visiting places under a given total traveling distance with a home-return probability. The results show that different optimal exponents in between 1 and 2 can emerge naturally. Therefore, the scaling property of human and animal mobility can be understood in our framework where the discrepancy of the scaling law exponents is due to the home-return constraint under the maximization of the visiting places diversity.

preprint2010arXiv

Dynamics on Spatial Networks and the Effect of Distance Coarse Graining

Very recently, a kind of spatial network constructed with power-law distance distribution and total energy constriction is proposed. Moreover, it has been pointed out that such spatial networks have the optimal exponents $δ$ in the power-law distance distribution for the average shortest path, traffic dynamics and navigation. Because the distance is estimated approximately in real world, we present an distance coarse graining procedure to generate the binary spatial networks in this paper. We find that the distance coarse graining procedure will result in the shifting of the optimal exponents $δ$. Interestingly, when the network is large enough, the effect of distance coarse graining can be ignored eventually. Additionally, we also study some main dynamic processes including traffic dynamics, navigation, synchronization and percolation on this spatial networks with coarse grained distance. The results lead us to the enhancement of spatial networks' specifical functions.

preprint2010arXiv

Effects of Levy Flights Mobility Pattern on Epidemic Spreading under Limited Energy Constraint

Recently, many empirical studies uncovered that animal foraging, migration and human traveling obey Levy flights with an exponent around -2. Inspired by the deluge of H1N1 this year, in this paper, the effects of Levy flights' mobility pattern on epidemic spreading is studied from a network perspective. We construct a spatial weighted network which possesses Levy flight spatial property under a restriction of total energy. The energy restriction is represented by the limitation of total travel distance within a certain time period of an individual. We find that the exponent -2 is the epidemic threshold of SIS spreading dynamics. Moreover, at the threshold the speed of epidemics spreading is highest. The results are helpful for the understanding of the effect of mobility pattern on epidemic spreading.

preprint2010arXiv

How to Measure Significance of Community Structure in Complex Networks

Community structure analysis is a powerful tool for complex networks, which can simplify their functional analysis considerably. Recently, many approaches were proposed to community structure detection, but few works were focused on the significance of community structure. Since real networks obtained from complex systems always contain error links, and most of the community detection algorithms have random factors, evaluate the significance of community structure is important and urgent. In this paper, we use the eigenvectors' stability to characterize the significance of community structures. By employing the eigenvalues of Laplacian matrix of a given network, we can evaluate the significance of its community structure and obtain the optimal number of communities, which are always hard for community detection algorithms. We apply our method to many real networks. We find that significant community structures exist in many social networks and C.elegans neural network, and that less significant community structures appear in protein-interaction networks and metabolic networks. Our method can be applied to broad clustering problems in data mining due to its solid mathematical basis and efficiency.

preprint2010arXiv

Maximizing Entropy Yields Spatial Scaling in Social Networks

In addition to the well known common properties such as small world and community structures, recent empirical investigations suggest a universal scaling law for the spatial structure of social networks. It is found that the probability density distribution of an individual to have a friend at distance $r$ scales as $P(r)\propto r^{-1}$. The basic principle that yields this spatial scaling property is not yet understood. Here we propose a fundamental origin for this law based on the concept of entropy. We show that this spatial scaling law can result from maximization of information entropy, which means individuals seek to maximize the diversity of their friendships. Such spatial distribution can benefit individuals significantly in optimally collecting information in a social network.

preprint2009arXiv

Analyzing Netizen's View and Reply Behaviors on the Forum

Quantitative understanding of human behaviors provides elementary comprehension of the complexity of many human-initiated systems. In this paper, we investigate the behavior of people on the $BBS$ forum by the statistical analysis of the amounts of view and reply of posts. According to our statistics, we find that the amounts of view and reply of posts follow the power law distributions with different power exponent. Furthermore, we discover that the amounts of view and reply of posts have nonlinear relationship. They are related by power function and show us straight line in log-log plot. Based on the estimation of slope and intercept of the line, we can characterize the behaviors quantitatively and know that people of Chinese forum and those of foreign forum have different preference towards replying to and viewing the posts. At last, we analyze the burstiness and memory in replying time series. They show some universal properties among different forum. All of them locate themselves in the high-$B$, low-$M$ region.

preprint2009arXiv

Measuring Significance of Community Structure in Complex Networks

Many complex systems can be represented as networks and separating a network into communities could simplify the functional analysis considerably. Recently, many approaches have been proposed for finding communities, but none of them can evaluate the communities found are significant or trivial definitely. In this paper, we propose an index to evaluate the significance of communities in networks. The index is based on comparing the similarity between the original community structure in network and the community structure of the network after perturbed, and is defined by integrating all the similarities. Many artificial networks and real-world networks are tested. The results show that the index is independent from the size of network and the number of communities. Moreover, we find the clear communities always exist in social networks, but don't find significative communities in proteins interaction networks and metabolic networks.

preprint2009arXiv

Optimal Tree for Both Synchronizability and Converging Time

It has been proved that the spanning tree from a given network has the optimal synchronizability, which means the index $R=λ_{N}/λ_{2}$ reaches the minimum 1. Although the optimal synchronizability is corresponding to the minimal critical overall coupling strength to reach synchronization, it does not guarantee a shorter converging time from disorder initial configuration to synchronized state. In this letter, we find that it is the depth of the tree that affects the converging time. In addition, we present a simple and universal way to get such an effective oriented tree in a given network to reduce the converging time significantly by minimizing the depth of the tree. The shortest spanning tree has both the maximal synchronizability and efficiency.

preprint2009arXiv

Scaling properties in spatial networks and its effects on topology and traffic dynamics

Empirical studies on the spatial structures in several real transport networks reveal that the distance distribution in these networks obeys power law. To discuss the influence of the power-law exponent on the network's structure and function, a spatial network model is proposed. Based on a regular network and subject to a limited cost $C$, long range connections are added with power law distance distribution $P(r)=ar^{-δ}$. Some basic topological properties of the network with different $δ$ are studied. It is found that the network has the smallest average shortest path when $δ=2$. Then a traffic model on this network is investigated. It is found that the network with $δ=1.5$ is best for the traffic process. All of these results give us some deep understandings about the relationship between spatial structure and network function.

preprint2009arXiv

Unevenness of Loop Location in Complex Networks

The loop structure plays an important role in many aspects of complex networks and attracts much attention. Among the previous works, Bianconi et al find that real networks often have fewer short loops as compared to random models. In this paper, we focus on the uneven location of loops which makes some parts of the network rich while some other parts sparse in loops. We propose a node removing process to analyze the unevenness and find rich loop cores can exist in many real networks such as neural networks and food web networks. Finally, an index is presented to quantify the unevenness of loop location in complex networks.

preprint2007arXiv

Community Detecting By Signaling on Complex Networks

Based on signaling process on complex networks, a method for identification community structure is proposed. For a network with $n$ nodes, every node is assumed to be a system which can send, receive, and record signals. Each node is taken as the initial signal source once to inspire the whole network by exciting its neighbors and then the source node is endowed a $n$d vector which recording the effects of signaling process. So by this process, the topological relationship of nodes on networks could be transferred into the geometrical structure of vectors in $n$d Euclidian space. Then the best partition of groups is determined by $F$-statistic and the final community structure is given by Fuzzy $C$-means clustering method (FCM). This method can detect community structure both in unweighted and weighted networks without any extra parameters. It has been applied to ad hoc networks and some real networks including Zachary Karate Club network and football team network. The results are compared with that of other approaches and the evidence indicates that the algorithm based on signaling process is effective.