Related papers: On the uniqueness class, stochastic completeness a…
This paper deals with the large-scale behaviour of dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with general lower semicontinuous and convex energy densities. Our main contribution is a homogenisation result that describes…
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into the current graph of an ever-growing graph sequence. The…
Several discrete geometry problems are equivalent to estimating the size of the largest homogeneous sets in graphs that happen to be the union of few comparability graphs. An important observation for such results is that if $G$ is an…
Local convergence techniques have become a key methodology to study sparse random graphs. However, convergence of many random graph properties does not directly follow from local convergence. A notable, and important, such random graph…
We introduce a natural generalization of the Erd\H{o}s-R\'enyi random graph model in which random instances of a fixed motif are added independently. The binomial random motif graph $G(H,n,p)$ is the random (multi)graph obtained by adding…
We prove a scale of generalized $L^p$-Poincar\'e inequalities and Sobolev type inequalities on graphs with polynomial volume growth. They are optimal on Vicsek graphs.
Consider the family of all finite graphs with maximum degree $\Delta(G)<d$ and matching number $\nu(G)<m$. In this paper we give a new proof to obtain the exact upper bound for the number of edges in such graphs and also characterize all…
In this paper, we investigate the geometry of a general class of gradient flows with multiple local maxima. we decompose the underlying space into disjoint regions of attraction and establish the adjacency criterion. The criterion states a…
We study stochastic particle systems on a complete graph and derive effective mean-field rate equations in the limit of diverging system size, which are also known from cluster aggregation models. We establish the propagation of chaos under…
We study graphs whose vertex degree tends and which are, therefore, called rapidly branching. We prove spectral estimates, discreteness of spectrum, first order eigenvalue and Weyl asymptotics solely in terms of the vertex degree growth.…
We reconsider some fundamental aspects of the fluid mechanics model, and the derivation of continuum flow equations from gas kinetic theory. Two topologies for fluid representation are presented, and a set of macroscopic equations are…
We study thermodynamic formalism of dynamical systems with non-uniform structure. Precisely, we obtain the uniqueness of equilibrium states for a family of non-uniformly expansive flows by generalizing Climenhaga-Thompson's orbit…
We prove a `resilience' version of Dirac's theorem in the setting of random regular graphs. More precisely, we show that, whenever $d$ is sufficiently large compared to $\varepsilon>0$, a.a.s. the following holds: let $G'$ be any subgraph…
In this paper, we study the wave equation on infinite graphs. On one hand, in contrast to the wave equation on manifolds, we construct an example for the non-uniqueness for the Cauchy problem of the wave equation on graphs. On the other…
In this short note, we prove the uniqueness of exterior differentiation on locally finite graphs.
Given a graph $F$, the random Tur\'an problem asks to determine the maximum number of edges in an $F$-free subgraph of $G_{n,p}$. Prior to this work, the only bipartite graphs $F$ with known tight bounds included certain classes of complete…
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this…
The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph…
The closure of a graph $G$ is the graph $G^*$ obtained from $G$ by repeatedly adding edges between pairs of non-adjacent vertices whose degree sum is at least $n$, where $n$ is the number of vertices of $G$. The well-known Closure Lemma…
We consider Markov jump processes on a graph described by a rate matrix that depends on various control parameters. We derive explicit expressions for the static responses of edge currents and steady-state probabilities. We show that they…