5 papers
Spanning Trees in Random Satisfiability Problems
A. Ramezanpour, S. Moghimi-Araghi
Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the soluti…
Biology helps to construct weighted scale free networks
A. Ramezanpour
In this work we study a simple evolutionary model of bipartite networks which its evolution is based on the duplication of nodes. Using analytical results along with numerical simu…
Ising Model on Edge-Dual of Random Networks
A. Ramezanpour
We consider Ising model on edge-dual of uncorrelated random networks with arbitrary degree distribution. These networks have a finite clustering in the thermodynamic limit. High an…
Investigation of a Protein Complex Network
A. R. Mashaghi, A. Ramezanpour, V. Karimipour
The budding yeast {\it Saccharomyces cerevisiae} is the first eukaryote whose genome has been completely sequenced. It is also the first eukaryotic cell whose proteome (the set of…
Generating correlated networks from uncorrelated ones
A. Ramezanpour, V. Karimipour, A. Mashaghi
In this paper we consider a transformation which converts uncorrelated networks to correlated ones(here by correlation we mean that coordination numbers of two neighbors are not in…