Generation of networks with prescribed degree-dependent clustering (Q691437): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-011-0319-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076770688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical mechanics of complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jointly Constrained Biconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamical Processes on Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4429163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the uniformity and independence assumptions using the concept of fractal dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation-free, coarse-grained multiscale computation: enabling microscopic simulators to perform system-level analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compact Mathematical Programming Formulation for DNA Motif Finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From the Cover: The structure of scientific collaboration networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random graph models of social networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network models and financial stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified network performance measure with importance identification and the ranking of network components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis for maximum flow problems with arc reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Seven criteria for integer sequences being graphic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring complex networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems in the enumeration of labelled graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:16, 5 July 2024

scientific article
Language Label Description Also known as
English
Generation of networks with prescribed degree-dependent clustering
scientific article

    Statements

    Generation of networks with prescribed degree-dependent clustering (English)
    0 references
    30 November 2012
    0 references
    0 references
    networks
    0 references
    graph theory
    0 references
    clustering
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references