**Are you an EPFL student looking for a semester project?**

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Lecture# Distances and Motif Counts

Description

This lecture by the instructor covers the definition of distances on graphs, including the edit distance and the Hamming distance. It explores the cut norm of graphs, the spanning tree dissimilarity, and the blockmodel. The lecture delves into metrics and norms, focusing on the Hamming distance, Jaccard distance, lp distances on eigenvalues, and the Steinhaus transform. It also discusses ERGMs, their applications in sociology, and the exponential random graph models. The content includes examples, definitions, theorems, and special cases related to network data analysis.

Official source

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

In course

Related concepts (152)

MATH-448: Statistical analysis of network data

A first course in statistical network analysis and applications.

Distance (graph theory)

In the mathematical field of graph theory, the distance between two vertices in a graph is the number of edges in a shortest path (also called a graph geodesic) connecting them. This is also known as the geodesic distance or shortest-path distance. Notice that there may be more than one shortest path between two vertices. If there is no path connecting the two vertices, i.e., if they belong to different connected components, then conventionally the distance is defined as infinite.

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.

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Statistical hypothesis testing

A statistical hypothesis test is a method of statistical inference used to decide whether the data at hand sufficiently support a particular hypothesis. Hypothesis testing allows us to make probabilistic statements about population parameters. While hypothesis testing was popularized early in the 20th century, early forms were used in the 1700s. The first use is credited to John Arbuthnot (1710), followed by Pierre-Simon Laplace (1770s), in analyzing the human sex ratio at birth; see .

Line graph

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. L(G) is constructed in the following way: for each edge in G, make a vertex in L(G); for every two edges in G that have a vertex in common, make an edge between their corresponding vertices in L(G). The name line graph comes from a paper by although both and used the construction before this.

Related lectures (184)

Statistical Analysis of Network DataMATH-448: Statistical analysis of network data

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Statistical analysis of network dataMATH-448: Statistical analysis of network data

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

Statistical Analysis of Network Data: Structures and ModelsMATH-448: Statistical analysis of network data

Explores statistical analysis of network data, covering graph structures, models, statistics, and sampling methods.

Exchangeability and Network StatisticsMATH-448: Statistical analysis of network data

Explores exchangeability, statistical summaries for networks, invariance issues, and the Poisson Limit theorem in network statistics.

Graphical Models: Representing Probabilistic DistributionsPHYS-512: Statistical physics of computation

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.