Related papers: On the uniqueness class, stochastic completeness a…
Let X(t) be a Gaussian random field R d $\rightarrow$ R. Using the notion of (d -- 1)-integral geometric measures, we establish a relation between (a) the volume of the level set (b) the number of crossings of the restriction of the random…
Algebraic connectivity is one way to quantify graph connectivity, which in turn gauges robustness as a network. In this paper, we consider the problem of maximising algebraic connectivity both local and globally over all simple, undirected,…
The identifiability problem arises naturally in a number of contexts in mathematics and computer science. Specific instances include local or global rigidity of graphs and unique completability of partially-filled tensors subject to rank…
We establish presumably optimal rates of normal convergence with respect to the Kolmogorov distance for a large class of geometric functionals of marked Poisson and binomial point processes on general metric spaces. The rates are valid…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
We study a class of graphs that represent local independence structures in stochastic processes allowing for correlated error processes. Several graphs may encode the same local independencies and we characterize such equivalence classes of…
The Fr\'echet mean is an important statistical summary and measure of centrality of data; it has been defined and studied for persistent homology captured by persistence diagrams. However, the complicated geometry of the space of…
We are concerned with the study of different notions of curvature on graphs. We show that if a graph has stronger inner-outer curvature growth than a model graph, then it has faster volume growth too. We also study the relationhips of…
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…
We prove the existence of self-similar solutions to the Fradkov model for two-dimensional grain growth, which consists of an infinite number of nonlocally coupled transport equations for the number densities of grains with given area and…
Zykov showed in 1949 that among graphs on $n$ vertices with clique number $\omega(G) \le \omega$, the Tur\'an graph $T_{\omega}(n)$ maximizes not only the number of edges but also the number of copies of $K_t$ for each size $t$. The problem…
We investigate the mean-field dynamics of stochastic McKean differential equations with heterogeneous particle interactions described by large network structures. To express a wide range of graphs, from dense to sparse structures, we…
We introduce an statistical mechanical formalism for the study of discrete-time stochastic processes with which we prove: (i) General properties of extremal chains, including triviality on the tail $\sigma$-algebra, short-range…
Let $\zeta$ be Euclidean norm of the degree sequence of a graph normalized by the graph size. We prove that when the vertices of a graph are randomly colored with $s$ colors such that the fraction of vertices in each color class is bounded…
For a graph $G$, denote by $t_r(G)$ (resp. $b_r(G)$) the maximum size of a $K_r$-free (resp. $(r-1)$-partite) subgraph of $G$. Of course $t_r(G) \geq b_r(G)$ for any $G$, and Tur\'an's Theorem says that equality holds for complete graphs.…
We present the full thermodynamics of a fluid confined by an arbitrary external potential based on the virial expansion of the grand potential. The fluid may be classical or quantum and it is assumed that interatomic interactions are…
We study the rigidity results for self-shrinkers in Euclidean space by restriction of the image under the Gauss map. The geometric properties of the target manifolds carry into effect. In the self-shrinking hypersurface situation Theorem…
We study the parameterized complexity of a broad class of problems called "local graph partitioning problems" that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique…
We prove discrete-to-continuum convergence for dynamical optimal transport on $\mathbb{Z}^d$-periodic graphs with energy density having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer,…
Using a maximum entropy principle to assign a statistical weight to any graph, we introduce a model of random graphs with arbitrary degree distribution in the framework of standard statistical mechanics. We compute the free energy and the…