Generation of networks with prescribed degree-dependent clustering
From MaRDI portal
Publication:691437
DOI10.1007/s11590-011-0319-xzbMath1259.90152MaRDI QIDQ691437
Karthikeyan Rajendran, Chrysanthos E. Gounaris
Publication date: 30 November 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0319-x
90C35: Programming involving graphs or networks
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity analysis for maximum flow problems with arc reversals
- Network models and financial stability
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Connected components in random graphs with given expected degree sequences
- A unified network performance measure with importance identification and the ranking of network components
- Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level analysis
- From the Cover: The structure of scientific collaboration networks
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Dynamical Processes on Complex Networks
- Jointly Constrained Biconvex Programming
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Seven criteria for integer sequences being graphic
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Some problems in the enumeration of labelled graphs
- The Structure and Function of Complex Networks
- Random graph models of social networks
- Community structure in social and biological networks
- A Compact Mathematical Programming Formulation for DNA Motif Finding
- Collective dynamics of ‘small-world’ networks
- Exploring complex networks
