Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
about
Bootstrap quantification of estimation uncertainties in network degree distributions.Unraveling spurious properties of interaction networks with tailored random networks.Emergence of network features from multiplexity.The informational architecture of the cell.Influence of choice of null network on small-world parameters of structural correlation networks.Degree correlations in directed scale-free networks.New scaling relation for information transfer in biological networks.Quantifying randomness in real networks.Threshold-limited spreading in social networks with multiple initiators.Emergence of disassortative mixing from pruning nodes in growing scale-free networksSimultaneous stability and sensitivity in model cortical networks is achieved through anti-correlations between the in- and out-degree of connectivityMultiple transitions of the susceptible-infected-susceptible epidemic model on complex networks.Correlations between weights and overlap in ensembles of weighted multiplex networks.Endemic infections are always possible on regular networks.Artefacts in statistical analyses of network motifs: general framework and application to metabolic networks.Aspects of randomness in neural graph structures.Duality between equilibrium and growing networks.Assortative mixing in functional brain networks during epileptic seizures.Origin and implications of zero degeneracy in networks spectra.Clustering spectrum of scale-free networks.Optimized evolution of networks for principal eigenvector localization.Lower bound of assortativity coefficient in scale-free networks.Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes.Constrained randomization of weighted networks.Relaxation dynamics of maximally clustered networks.Phase transitions for scaling of structural correlations in directed networks.Reducing degeneracy in maximum entropy models of networks.Entropy distribution and condensation in random networks with a given degree distribution.Clustering of random scale-free networks.Unbiased degree-preserving randomization of directed binary networks.Bias in generation of random graphs.Minimum Dominating Sets in Scale-Free Network Ensembles.
P2860
Q33918374-07AED8F0-09E8-43A4-A5C3-EE23189896EAQ33995603-7609C130-6714-4A38-82DC-624CE8505C17Q34330184-4B65B170-DB59-4053-939A-82AF94E64BA5Q34512959-855299A2-8250-4426-999A-D62B6E22E80DQ34807077-F3B3E056-D4B3-4F2B-B9E3-E4A70ABA3B56Q35326326-A7715B3C-8957-4ED2-B98B-8102FE84D8FEQ35877989-443887B2-542C-44D5-83C8-99CE3F2987D6Q36341592-0D89B165-585C-4695-BE83-227FD20AF389Q37057931-F107BC43-4A34-4596-9E82-94669D369384Q39272137-E8AE4496-B03C-4ABB-BEDE-340B0790D67CQ39316347-BAF85049-9615-4BD7-94A8-E6E50562E68BQ41484847-726E715C-B2E7-425E-A88A-1DB24B691480Q41536941-5A45F8F4-0E61-4183-A9EC-AD88A4B72640Q42240745-38810E9F-9FDF-47AE-B6D0-3837E69302D7Q42402856-C31D83DB-CF81-41F7-AB25-8ACD03A05935Q44286910-6F0BB27A-8CC7-43F0-85DC-102BDDF95E88Q46215845-94116D14-94EC-4FD5-9DED-907680C37B22Q46725525-88664A1F-6D51-4522-A8FE-AE9A66073C63Q46734835-B7129D47-62F9-4E50-8EA6-BEF945897AF0Q47559781-F0472687-A6D1-43A0-979E-6BF7B686AE19Q47629613-F984F5FC-829F-49CE-A0CD-E0B6212DCCDAQ48339552-0B76ADA6-6EB3-4E22-A889-825C590494EDQ48624022-8945815F-CB14-428B-82D0-270BC8522CE7Q48891436-23D37792-0537-497D-868C-695FBDB04FCFQ49966370-39223A48-93C0-43F7-A7EA-B38461F50DF6Q50852767-CAE26659-0634-49B8-869D-43C65776E0D3Q50921666-73CC451B-3E64-4ABC-A1F4-754EE10DAFB7Q51067676-B582FFE5-BD70-46F8-B0F9-1AE08DDAB7E2Q51318631-A06DBABA-AF9C-4612-88B9-42AA64A474E6Q51357237-6D63E22B-7C84-4158-96B7-E71DAE1DDC73Q53097802-42F873EF-AA4A-4E8C-9D53-A0EE695DF787Q55214754-475649CE-7E8F-4F85-BDB9-325302A0A378
P2860
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
description
2010 nî lūn-bûn
@nan
2010 թուականի Ապրիլին հրատարակուած գիտական յօդուած
@hyw
2010 թվականի ապրիլին հրատարակված գիտական հոդված
@hy
2010年の論文
@ja
2010年論文
@yue
2010年論文
@zh-hant
2010年論文
@zh-hk
2010年論文
@zh-mo
2010年論文
@zh-tw
2010年论文
@wuu
name
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@ast
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@en
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@nl
type
label
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@ast
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@en
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@nl
prefLabel
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@ast
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@en
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@nl
P2093
P2860
P1433
P1476
Efficient and exact sampling of simple graphs with given arbitrary degree sequence.
@en
P2093
Hyunju Kim
Kevin E Bassler
Zoltán Toroczkai
P2860
P304
P356
10.1371/JOURNAL.PONE.0010012
P407
P577
2010-04-08T00:00:00Z