Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUnderstanding how both the partitions of a bipartite network affect its one-mode projection
190
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
It is a well-known fact that the degree distribution (DD) of the nodes in a partition of a bipartite network influences the DD of its one-mode projection on that partition. However, there are no studies exploring the effect of the DD of the other partition on the one-mode projection. In this article, we show that the DD of the other partition, in fact, has a very strong influence on the DD of the one-mode projection. We establish this fact by deriving the exact or approximate closed-forms of the DD of the one-mode projection through the application of generating function formalism followed by the method of iterative convolution. The results are cross-validated through appropriate simulations.
rate research
Read More
The paper is being withdrawn since the authors felt that the submission is a little premature after a careful reading by some of the experts in this field.
The one-mode projecting is extensively used to compress the bipartite networks. Since the one-mode projection is always less informative than the bipartite representation, a proper weighting method is required to better retain the original information. In this article, inspired by the network-based resource-allocation dynamics, we raise a weighting method, which can be directly applied in extracting the hidden information of networks, with remarkably better performance than the widely used global ranking method as well as collaborative filtering. This work not only provides a creditable method in compressing bipartite networks, but also highlights a possible way for the better solution of a long-standing challenge in modern information science: How to do personal recommendation?
We investigate the critical properties of Ising models on a Regularized Apollonian Network (RAN), here defined as a kind of Apollonian Network (AN) in which the connectivity asymmetry associated to its corners is removed. Different choices for the coupling constants between nearest neighbors are considered, and two different order parameters are used to detect the critical behaviour. While ordinary ferromagnetic and anti-ferromagnetic models on RAN do not undergo a phase transition, some anti-ferrimagnetic models show an interesting infinite order transition. All results are obtained by an exact analytical approach based on iterative partial tracing of the Boltzmann factor as intermediate steps for the calculation of the partition function and the order parameters.
Sine-Wiener noise is increasingly adopted in realistic stochastic modeling for its bounded nature. However, many features of the SW noise are still unexplored. In this paper, firstly, the properties of the SW noise and its integral process are explored as the parameter $D$ in the SW noise tends to infinite. It is found that although the distribution of the SW noise is quite different from Gaussian white noise, the integral process of the SW noise shows many similarities with the Wiener process. Inspired by the Wiener process, which uses the diffusion coefficient to denote the intensity of the Gaussian noise, a quantity is put forward to characterize the SW noises intensity. Then we apply the SW noise to a one-dimensional double-well potential system and the Maier-Stein system to investigate the escape behaviors. A more interesting result is observed that the mean first exit time also follows the well-known Arrhenius law as in the case of the Gaussian noise, and the quasi-potential and the exit location distributions are very close to the results of the Gaussian noise.
We give an approximate solution to the difficult inverse problem of inferring the topology of an unknown network from given time-dependent signals at the nodes. For example, we measure signals from individual neurons in the brain, and infer how they are inter-connected. We use Maximum Caliber as an inference principle. The combinatorial challenge of high-dimensional data is handled using two different approximations to the pairwise couplings. We show two proofs of principle: in a nonlinear genetic toggle switch circuit, and in a toy neural network.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
