In analogy to chemical reaction networks, I demonstrate the utility of expressing the governing equations of an arbitrary dynamical system (interaction network) as sums of real functions (generalized reactions) multiplied by real scalars (generalized stoichiometries) for analysis of its stability. The reaction stoichiometries and first derivatives define the network's "influence topology", a si...

We present a method for detecting communities in bipartite networks. Based on an extension of the k-clique community detection algorithm suggested by Palla et al. [1], we demonstrate how modular structure in bipartite networks presents itself as overlapping bicliques. The talk is based work discussed in Ref [2]. Bipartite networks are ubiquitous A bipartite network is a network whose nodes is n...

In this paper, we propose a method to solve the network fault diagnosis problem using the realistic abductive reasoning model. This model uses abductive inference mechanism based on the parsimonious covering theory and adds some new features to the general model of diagnostic problem solving. The network fault diagnosis knowledge is assumed to be represented in the form of causal chaining, name...

‎in this paper we give a characterization of unmixed tripartite‎ ‎graphs under certain conditions which is a generalization of a‎ ‎result of villarreal on bipartite graphs‎. ‎for bipartite graphs two‎ ‎different characterizations were given by ravindra and villarreal‎. ‎we show that these two characterizations imply each other‎.

Nowadays, the video-sharing websites are becoming more and more popular, which leads to latent social networks among videos and users. In this work, results are integrated with the data collected from YouTube, one of the largest user-driven online video repositories, and are supported by Chinese sentiment analysis which excels the state of art. Along with it, the authors construct two types of ...

The network community structure detection problem consists in finding groups of nodes that are more connected to each other than to the rest of the network. While many methods have been designed to deal with this problem for general networks, there are few methods that deal with bipartite ones. In this paper we explore the behavior of an optimization method designed for identifying the communit...

We present a new network model accounting for homophily and triadic closure in the evolution of social networks. In particular, in our model, each node is characterized by a number of features and the probability of a link between two nodes depends on common features. The bipartite network of the actors and features evolves according to a dynamics that depends on three parameters that respectiv...

We study the response of a two-dimensional hexagonal packing of rigid, frictionless spherical grains due to a vertically downward point force on a single grain at the top layer. We use a statistical approach, where each configuration of the contact forces is equally likely. We find that the response is double-peaked, independantly of the details of boundary conditions. The two peaks lie precise...

Let Γ denote the spaces of all double entire sequences. Let Λ denote the spaces of all double analytic sequences. This paper is devoted to a study of the general properties of Nörlund double entire sequence space η ( Γ ) , Γ and also study some of the properties of η ( Γ ) and η ( Λ ) .

We show that any graph that contains k edge-disjoint double rays for any k ∈ N contains also infinitely many edge-disjoint double rays. This was conjectured by Andreae in 1981.