Introducing Graph Cumulants: What is the Kurtosis of your Social Network?

No abstract is available for this paper.

• Publication year

  2020

• Venue

  arXiv.org

• Publication date

  2020-02-10

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Forecasting VaR using realized EGARCH model with skewness and kurtosis

  2020cited by this paper
• A Survey of Measures for Network Motifs

  2019cited by this paper
• Gender and collaboration patterns in a temporal scientific authorship network

  2019cited by this paper
• Exponential random graph models for the Japanese bipartite network of banks and firms

  2019cited by this paper
• Outliers and Influential Observations in Exponential Random Graph Models

  2018cited by this paper
• Milo et al. (2002): Network Motifs: Simple Building Blocks of Complex Networks

  2018cited by this paper
• Sparse Power-Law Network Model for Reliable Statistical Predictions Based on Sampled Data

  2018cited by this paper
• Listing k-cliques in Sparse Real-World Graphs*

  2018cited by this paper
• The physics of brain network structure, function and control

  2018cited by this paper
• The statistical physics of real-world networks

  2018cited by this paper
• Complexity and stability of ecological networks: a review of the theory

  2018cited by this paper
• A perfect sampling method for exponential family random graph models

  2017cited by this paper
• Inductive Representation Learning on Large Graphs

  2017cited by this paper
• Epidemic network analysis for mitigation of invasive pathogens in seed systems: Potato in Ecuador

  2017cited by this paper
• Representation Learning on Graphs: Methods and Applications

  2017cited by this paper
• Homomorphisms are a good basis for counting small subgraphs

  2017cited by this paper
• Testing for Equivalence of Network Distribution Using Subgraph Counts

  2017cited by this paper
• Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling

  2017cited by this paper
• Higher-order organization of complex networks

  2016cited by this paper
• Analysis of Network Clustering Algorithms and Cluster Quality Metrics at Scale

  2016cited by this paper
• Edge-exchangeable graphs and sparsity (NIPS 2016)

  2016cited by this paper
• Information Geometry and Its Applications

  2016cited by this paper
• Semi-Supervised Classification with Graph Convolutional Networks

  2016cited by this paper
• ESCAPE: Efficiently Counting All 5-Vertex Subgraphs

  2016cited by this paper
• Sparsity Measure of a Network Graph: Gini Index

  2016cited by this paper
• Sampling and Estimation for (Sparse) Exchangeable Graphs

  2016cited by this paper
• Emergence of Soft Communities from Geometric Preferential Attachment

  2015cited by this paper
• Triadic analysis of affiliation networks

  2015cited by this paper
• Generation and analysis of networks with a prescribed degree sequence and subgraph family: higher-order structure matters

  2015cited by this paper
• Mandala Networks: ultra-small-world and highly sparse graphs

  2015cited by this paper
• Quantifying randomness in real networks

  2015cited by this paper
• The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration

  2014cited by this paper
• Continuous and robust clustering coefficients for weighted and directed networks

  2014cited by this paper
• Sparse graphs using exchangeable random measures

  2014cited by this paper
• Reducing degeneracy in maximum entropy models of networks.

  2014cited by this paper
• Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

  2014cited by this paper
• Fast Approximate Subgraph Counting and Enumeration

  2013cited by this paper
• Skewness and Kurtosis in Real Data Samples

  2013cited by this paper
• Complex scale-free networks with tunable power-law exponent and clustering

  2013cited by this paper
• Subgraph fluctuations in random graphs.

  2012cited by this paper
• Web evolution and Web Science

  2012cited by this paper
• Graph Products and Its Applications in Mathematical Formulation of Structures

  2012cited by this paper
• Cumulants and Partition Lattices

  2012cited by this paper
• High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School

  2011cited by this paper
• All scale-free networks are sparse.

  2011cited by this paper
• Estimating and understanding exponential random graph models

  2011cited by this paper
• The method of moments and degree distributions for network models

  2011cited by this paper
• Analysis of diverse regulatory networks in a hierarchical context shows consistent tendencies for collaboration in the middle levels

  2010cited by this paper
• Bayesian inference for exponential random graph models

  2010cited by this paper
• What's in a crowd? Analysis of face-to-face behavioral networks

  2010cited by this paper
• A survey of graph edit distance

  2010cited by this paper
• A network model for plant–pollinator community assembly

  2010cited by this paper
• Efficient Parallel Subgraph Counting Using G-Tries

  2010cited by this paper
• Faster algorithms for finding and counting subgraphs

  2009cited by this paper
• Counting Subgraphs via Homomorphisms

  2009cited by this paper
• Exponential random graph models for affiliation networks

  2009cited by this paper
• Clustering in weighted networks

  2009cited by this paper
• Network motifs come in sets: correlations in the randomization process.

  2009cited by this paper
• On the degree distribution of the nodes in increasing trees

  2007cited by this paper
• An introduction to exponential random graph (p*) models for social networks

  2007cited by this paper
• Statistical Analysis of Weighted Networks

  2007cited by this paper
• Exploring biological network structure using exponential random graph models

  2007cited by this paper
• Clustering coefficient and community structure of bipartite networks

  2007cited by this paper
• New Specifications for Exponential Random Graph Models

  2006cited by this paper
• Clustering in complex directed networks.

  2006cited by this paper
• Graph limits and parameter testing

  2006cited by this paper
• The igraph software package for complex network research

  2006cited by this paper
• Efficient Detection of Network Motifs

  2006cited by this paper
• Cycles and clustering in bipartite networks.

  2005cited by this paper
• Statistical mechanics of networks.

  2004cited by this paper
• Small Worlds Among Interlocking Directors: Network Structure and Distance in Bipartite Graphs

  2004cited by this paper
• Solution of the two-star model of a network.

  2004cited by this paper
• Solution for the properties of a clustered network.

  2004cited by this paper
• Optimal oblivious routing in polynomial time

  2003cited by this paper
• The On-Line Encyclopedia of Integer Sequences

  2003cited by this paper
• The architecture of complex weighted networks.

  2003cited by this paper
• Growing scale-free networks with tunable clustering.

  2001cited by this paper
• On the Combinatorics of Cumulants

  2000cited by this paper
• The Early History of the Cumulants and the Gram‐Charlier Series

  2000cited by this paper
• Emergence of Scaling in Random Networks

  1999cited by this paper
• Collective dynamics of ‘small-world’ networks

  1998cited by this paper
• Transportation Network Analysis

  1997cited by this paper
• Ontologies: principles, methods and applications

  1996cited by this paper
• Social Network Analysis: Methods and Applications

  1994cited by this paper
• Resistance distance

  1993cited by this paper
• Monographs on statistics and applied probability

  1990cited by this paper
• When are small subgraphs of a random graph normally distributed?

  1988cited by this paper
• Tensor Methods in Statistics

  1987cited by this paper
• Cumulants and partition lattices II: generalised k-statistics

  1986cited by this paper
• On a general class of models for interaction

  1986cited by this paper
• Arboricity and Subgraph Listing Algorithms

  1985cited by this paper
• A Review of the Theory

  1984cited by this paper
• CUMULANTS AND PARTITION LATTICES1

  1983influential reference
• Unbiased Estimation for Some Non-Parametric Families of Distributions

  1982cited by this paper
• GENERALIZED CUMULANT EXPANSION METHOD

  1962cited by this paper
• Information Theory and Statistical Mechanics

  1957cited by this paper
• Limit Distributions for Sums of Independent Random Variables

  1955cited by this paper
• Methods and applications

  1953cited by this paper
• Some Sampling Simplified

  1950cited by this paper
• The Theory of Unbiased Estimation

  1946cited by this paper

• Graph counting signatures and bicommutative Hopf algebras

  2022cites this paper