Lecture

Exchangeability and Network Statistics

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MATH-448: Statistical analysis of network data

A first course in statistical network analysis and applications. ...

Description

This lecture covers the concept of exchangeability in statistical analysis of network data, exploring the definition of exchangeable arrays and the Aldous Hoover theorem. It also delves into statistical summaries for networks, discussing subgraph counts and the challenges with network summaries. The lecture further examines the invariance issues with network statistics, the scaling of XF(G) with edge probability, and the asymptotic Gaussian distribution of XF(G) for strictly balanced graphs. Additionally, it presents the average degree and maximum average degree definitions, the concept of strictly balanced graphs, and the Poisson Limit theorem. The lecture concludes with discussions on induced copies, Stochastic blockmodels, and the functional t(F, G) for graph homomorphisms.

Instructor

Sofia Charlotta Olhede

I am a professor of Statistics at EPFL. I did my PhD in Mathematics at Imperial College London, and graduated in 2003. I was an assistant professor (lecturer) at Imperial College London 2002-2006, and an associate professor (senior lecturer) 2006-2007. In 2007 I moved to University College London and became a full professor. I moved to EPFL in 2019, and in 2018 I became an Institute of Mathematical Statistics Fellow with citation “For seminal contributions to the theory and application of large and heteroge

Official source

Ontological neighbourhood

Statistics

Statistical inference: Mathematical statistics

Related concepts (32)

Extremal graph theory

Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence, extremal graph theory studies how global properties of a graph influence local substructure.

Asymptotic distribution

In mathematics and statistics, an asymptotic distribution is a probability distribution that is in a sense the "limiting" distribution of a sequence of distributions. One of the main uses of the idea of an asymptotic distribution is in providing approximations to the cumulative distribution functions of statistical estimators. A sequence of distributions corresponds to a sequence of random variables Zi for i = 1, 2, ..., I .

Computer network

A computer network is a set of computers sharing resources located on or provided by network nodes. Computers use common communication protocols over digital interconnections to communicate with each other. These interconnections are made up of telecommunication network technologies based on physically wired, optical, and wireless radio-frequency methods that may be arranged in a variety of network topologies. The nodes of a computer network can include personal computers, servers, networking hardware, or other specialized or general-purpose hosts.

Asymptotic theory (statistics)

In statistics, asymptotic theory, or large sample theory, is a framework for assessing properties of estimators and statistical tests. Within this framework, it is often assumed that the sample size n may grow indefinitely; the properties of estimators and tests are then evaluated under the limit of n → ∞. In practice, a limit evaluation is considered to be approximately valid for large finite sample sizes too. Most statistical problems begin with a dataset of size n.

Stable distribution

In probability theory, a distribution is said to be stable if a linear combination of two independent random variables with this distribution has the same distribution, up to location and scale parameters. A random variable is said to be stable if its distribution is stable. The stable distribution family is also sometimes referred to as the Lévy alpha-stable distribution, after Paul Lévy, the first mathematician to have studied it. Of the four parameters defining the family, most attention has been focused on the stability parameter, (see panel).

Related lectures (64)

Statistical analysis of network data

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.

Probability Distributions in Environmental Studies

Explores probability distributions for random variables in air pollution and climate change studies, covering descriptive and inferential statistics.

Statistics: Hypothesis Testing & Confidence Intervals

Covers hypothesis testing, confidence intervals, data distributions, and statistical significance in data analysis.

Likelihood Ratio Tests: Optimality and Extensions

Covers Likelihood Ratio Tests, their optimality, and extensions in hypothesis testing, including Wilks' Theorem and the relationship with Confidence Intervals.

Likelihood Ratio Tests: Optimality and Applications