The average distances in random graphs with given expected degrees.
about
Analytical solution of average path length for Apollonian networksHyperbolic geometry of complex networksScale-Free Networks Are UltrasmallGraphlet characteristics in directed networksA Poisson model for random multigraphs.Characterizing the community structure of complex networksInferring topology from clustering coefficients in protein-protein interaction networks.Evidence of probabilistic behaviour in protein interaction networksNon-uniform survival rate of heterodimerization links in the evolution of the yeast protein-protein interaction network.Multifractal network generator.Alignment-free protein interaction network comparisonSpectra of random graphs with given expected degrees.Lost in the city: revisiting Milgram's experiment in the age of social networks.Extinction times of epidemic outbreaks in networksComparison of large networks with sub-sampling strategies.Core-periphery disparity in fractal behavior of complex networks.Action-based Modeling of Complex Networks.Efficient immunization strategies to prevent financial contagionEpidemic thresholds in dynamic contact networks.Profiling core-periphery network structure by random walkers.The Effect of Random Edge Removal on Network Degree Sequence.Network-driven design principles for neuromorphic systemsAspects of randomness in neural graph structures.Spectra of random graphs with arbitrary expected degrees.Community structure and scale-free collections of Erdős-Rényi graphs.Social contagion with degree-dependent thresholds.Distribution of shortest path lengths in a class of node duplication network models.Clustering spectrum of scale-free networks.Distribution of shortest cycle lengths in random networks.Ring structures and mean first passage time in networks.Distance distribution in configuration-model networks.Analytic treatment of tipping points for social consensus in large random networks.Random walks in modular scale-free networks with multiple traps.Navigating ultrasmall worlds in ultrashort time.Random graph models for directed acyclic networks.Spreading dynamics on heterogeneous populations: multitype network approach.Analysis of scale-free networks based on a threshold graph with intrinsic vertex weights.Spectra of random graphs with community structure and arbitrary degrees.Subgraphs in random networks.Spreading dynamics on small-world networks with connectivity fluctuations and correlations.
P2860
Q27350196-8F41EA83-9FD2-4FC7-9D15-EE7621CD2054Q27444483-C5317C91-2365-4A2A-B3FB-59BE4AF29E2AQ27450885-343DFFE7-D436-47AB-A049-7B128C2A670AQ28595997-DF186A7E-0898-4C3E-9E91-91FEF5CDA59AQ28743326-F7080E11-CF5A-4C19-9C0E-C1A8F84C254FQ28749704-50607E09-883A-4013-AEBF-EA64C8B2EE7DQ33265102-65C89750-4FB9-4E87-991D-F2132A51143AQ33317634-6A29892A-CCF4-4C43-A3CE-0B69DCECEC93Q33321230-611B7348-3060-49A7-89C1-84190090F572Q33842798-C0DB4402-4618-4A7F-A401-D2F127D916B2Q34103155-580A474D-4776-408B-9ECA-CAAEDB849B71Q34196474-5CE44E71-F748-4DF2-9575-A485D0BCEC82Q34482608-E22F6174-A163-430E-B543-8410D6EC460EQ35080937-B1328FF3-E273-40D8-A3E0-58D0D366E833Q37067711-0931E4C5-D01C-43A7-9582-5E687FD8B0DCQ38468890-D012C99A-7EDB-488C-930F-20D2FCC61E80Q41159049-82BACF50-29E1-45C1-928B-59AB11765293Q41886780-3FFE46F3-A93E-442E-B17C-271F243842ECQ41945057-68813B49-59EF-45DB-830D-1A8EE96FB3DFQ42121739-F770960A-E616-4E52-97B8-10BF5AC159E8Q42588389-08D0C361-D6BE-4DC9-9E32-154168D814EEQ42594004-B4C0C8A2-2B92-4D65-9FDA-24F2713EE162Q44286910-C89B2A44-0427-4CE9-BA8A-E9BE92CAC46DQ46337943-EFC6045E-C5A5-43EF-AA18-868A3A9DE2D4Q46422541-1E7FE24F-A3BB-4081-9BD8-8DE6A65D5DA3Q47557533-981D0733-B3D3-4A08-9042-C30BADD8F3A5Q47557564-2C3E9DA4-7276-4491-95BB-B6D37E5744E8Q47559781-30D15B07-A062-4EBF-AEDB-C5C540C57082Q47560052-D8E677CF-0D3E-4AB1-B374-33040906D623Q48588164-9FFA26AF-6B34-41C4-A221-4B8DF033FF77Q50610075-F8E75521-2AB0-4936-B7AA-0E0806F796EFQ51269167-806634DD-1818-4B9F-B9BC-11AC19114BF8Q51603334-CF007E60-96D1-4A67-82F2-583CE379AC10Q51617708-1B57418D-1662-4713-888B-D7CD37C06845Q51776291-81133C5D-DD59-442A-9CFA-4D9B677F2C9AQ51923326-2D0068D7-ABBC-4358-B860-7A7E150A9C01Q51985055-F6F14427-3A6C-4211-806D-A6D0226484A7Q53551861-2A73C336-54FB-44B1-8C03-FE843ADA07AEQ54117487-A1C489C6-71A2-4A68-8DD2-FF4B40F880C0Q54261833-D215ADD1-1619-4E78-98FF-4BD39B871873
P2860
The average distances in random graphs with given expected degrees.
description
2002 nî lūn-bûn
@nan
2002 թուականի Դեկտեմբերին հրատարակուած գիտական յօդուած
@hyw
2002 թվականի դեկտեմբերին հրատարակված գիտական հոդված
@hy
2002年の論文
@ja
2002年論文
@yue
2002年論文
@zh-hant
2002年論文
@zh-hk
2002年論文
@zh-mo
2002年論文
@zh-tw
2002年论文
@wuu
name
The average distances in random graphs with given expected degrees.
@ast
The average distances in random graphs with given expected degrees.
@en
The average distances in random graphs with given expected degrees.
@nl
type
label
The average distances in random graphs with given expected degrees.
@ast
The average distances in random graphs with given expected degrees.
@en
The average distances in random graphs with given expected degrees.
@nl
prefLabel
The average distances in random graphs with given expected degrees.
@ast
The average distances in random graphs with given expected degrees.
@en
The average distances in random graphs with given expected degrees.
@nl
P2860
P356
P1476
The average distances in random graphs with given expected degrees.
@en
P2093
P2860
P304
15879-15882
P356
10.1073/PNAS.252631999
P407
P577
2002-12-04T00:00:00Z