Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Multi angle  Weighted distances in scale free random graphs
Komjathy, Julia (Auteur de la Conférence) | CIRM (Editeur )

In this talk I will review the recent developments on weighted distances in scale free random graphs as well as highlight key techniques used in the proofs. We consider graph models where the degree distribution follows a power-law such that the empirical variance of the degrees is infinite, such as the configuration model, geometric inhomogeneous random graphs, or scale free percolation. Once the graph is created according to the model definition, we assign i.i.d. positive edge weights to existing edges, and we are interested in the proper scaling and asymptotic distribution of weighted distances.
In the infinite variance degree regime, a dichotomy can be observed in all these graph models: the edge weight distributions form two classes, explosive vs conservative weight distributions. When a distribution falls into the explosive class, typical distances converge in distribution to proper random variables. While, when a distribution falls into the conservative class, distances tend to infinity with the model size, according to a formula that captures the doubly-logarithmic graph distances as well as the precise behaviour of the distribution of edge-weights around the origin. An integrability condition decides into which class a given distribution falls.
This is joint work with Adriaans, Baroni, van der Hofstad, and Lodewijks.
In this talk I will review the recent developments on weighted distances in scale free random graphs as well as highlight key techniques used in the proofs. We consider graph models where the degree distribution follows a power-law such that the empirical variance of the degrees is infinite, such as the configuration model, geometric inhomogeneous random graphs, or scale free percolation. Once the graph is created according to the model ...

05C80 ; 90B15 ; 60C05 ; 60D05

Filtrer

Type
Domaine
Codes MSC

Z
class="top-gradient">

Post-edited  The partially disjoint paths problem
Schrijver, Alexander (Auteur de la Conférence) | CIRM (Editeur )

The partially disjoint paths problem asks for paths $P_1, \ldots,P_k$ between given pairs of terminals, while certain pairs of paths $P_i$,$P_j$ are required to be disjoint. With the help of combinatorial group theory, we show that, for fixed $k$, this problem can be solved in polynomial time for planar directed graphs. We also discuss related problems. No specific foreknowledge is required.

05C10 ; 05C20 ; 05C25 ; 05C38 ; 68Q25 ; 90C27

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Post-edited  Expected topology of a random subcomplex in a simplicial complex
Welschinger, Jean-Yves (Auteur de la Conférence) | CIRM (Editeur )

I will explain how to bound from above and below the expected Betti numbers of a random subcomplex in a simplicial complex and get asymptotic results under infinitely many barycentric subdivisions. This is a joint work with Nermin Salepci. It complements previous joint works with Damien Gayet on random topology.

52Cxx ; 60C05 ; 60B05 ; 55U10

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Post-edited  An integration approach to the Toeplitz square peg problem
Tao, Terence (Auteur de la Conférence) | CIRM (Editeur )

The Toeplitz square peg problem asks if every simple closed curve in the plane inscribes a square. This is known for sufficiently regular curves (e.g. polygons), but is open in general. We show that the answer is affirmative if the curve consists of two Lipschitz graphs of constant less than 1 using an integration by parts technique, and give some related problems which look more tractable.

55N45

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Post-edited  Learning determinantal point processes from moments and cycles
Brunel, Victor-Emmanuel (Auteur de la Conférence) | CIRM (Editeur )

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Multi angle  Interlacements and the uniform spanning forest
Hutchcroft, Tom (Auteur de la Conférence) | CIRM (Editeur )

The Aldous-Broder algorithm allows one to sample the uniform spanning tree of a finite graph as the set of first-entry edges of a simple random walk. In this talk, I will discuss how this can be extended to infinite transient graphs by replacing the random walk with the random interlacement process. I will then outline how this new sampling algorithm can be used to compute critical exponents for the uniform spanning forest of $Z^d$.

60D05 ; 05C05 ; 20F65

or Sunada equivalence,
(c) Chebotarev density theorem.
This is a joint work with Hau-Wen Huang. Given a finite connected undirected graph $X$, its fundamental group plays the role of the absolute Galois group of $X$. The familiar Galois theory holds in this setting. In this talk we shall discuss graph theoretical counter parts of several important theorems for number fields. Topics include
(a) Determination, up to equivalence, of unramified normal covers of $X$ of given degree,
(b) Criteria for Sunada equivalence,
(c) Chebotarev density ...

05C25 ; 05C50 ; 11R32 ; 11R44 ; 11R45