order to give a better description of the morphology of a network. Last, we generate a large amount of different networks … the complete feasible domain of all networks with a given input parameter. Moreover, each network generator covers its own …

networks topologically similar to random graphs. An effective dimension dchem(μ) can be defined in terms of the shortest … according to P(r)∼r-μ. By changing the decay exponent μ one can go from d-dimensional short-range networks to ∞-dimensional …-path properties of these networks. These effective dimensions dchem are calculated here in one and two dimensions, for system sizes of …

–Rényi (ER) random graphs, with z neighbors for each spin. In the case with spin S=1/2, the undirected and directed ER graphs … graphs the model presents a spontaneous magnetization at p=z/N(z=2,3,…,N), but no spontaneous magnetization at p=1/N which is … the percolation threshold. For both directed and undirected ER graphs with spin S=1, we find a first-order phase …

accepted by Olav Sorenson, organizations and social networks. …

We study stable matchings on exogenously given or endogenously formed bipartite graphs that reflect constraints on …