Related papers: A Bramble like Witness for Large Branch-Width
We prove asymptotic normality for the number of fringe subtrees isomorphic to any given tree in uniformly random trees with given vertex degrees. As applications, we also prove corresponding results for random labelled trees with given…
Graphs are widely used for modeling various types of interactions, such as email communications and online discussions. Many of such real-world graphs are temporal, and specifically, they grow over time with new nodes and edges. Counting…
The Horton-Strahler analysis is a graph-theoretic method to measure the bifurcation complexity of branching patterns, by defining a number called the order to each branch. The main result of this paper is a large deviation theorem for the…
We consider the branch-length estimation problem on a bifurcating tree: a character evolves along the edges of a binary tree according to a two-state symmetric Markov process, and we seek to recover the edge transition probabilities from…
Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…
A self-similar growth-fragmentation describes the evolution of particles that grow and split as time passes. Its genealogy yields a self-similar continuum tree endowed with an intrinsic measure. Extending results of Haas for pure…
The paper aims at reconsidering the famous Le Cam LAN theory. The main features of the approach which make it different from the classical one are as follows: (1) the study is nonasymptotic, that is, the sample size is fixed and does not…
In many physical situations involving diverse length scales, waves or rays representing them travel through media characterized by spatially smooth, random, modest refactive index variations. "Primary" diffraction (by individual…
In a paper from 2001 (Journal of the LMS), Diestel and Leader offered a proof that a connected graph has a normal spanning tree if and only if it does not contain a minor from two specific forbidden classes of graphs, all of cardinality…
Many organisms exhibit branching morphologies that twist around each other and become entangled. Entanglement occurs when different objects interlock, creating complex and often irreversible configurations. This physical phenomenon is…
There has been significant progress in creating machine learning models that identify objects in scenes along with their associated attributes and relationships; however, there is a large gap between the best models and human capabilities.…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
We propose a nonparametric framework for the analysis of networks, based on a natural limit object termed a graphon. We prove consistency of graphon estimation under general conditions, giving rates which include the important practical…
We study the statistical distribution of the closest encounter between generic smooth observations computed along different trajectories of a rapidly mixing dynamical system. At the limit of large trajectories, we obtain a distribution of…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
We exhibit some families of subgroups of the pure braid group that are highly generating, in the sense of Abels and Holz. In one class of examples, the relevant geometric object is a complex termed the restricted arc complex of a surface.…
Perfect matching width is a treewidth-like parameter designed for graphs with perfect matchings. The concept was originally introduced by Norine for the study of non-bipartite Pfaffian graphs. Additionally, perfect matching width appears to…
We construct nonlinear multiparty entanglement measures for distinguishable particles, bosons and fermions. In each case properties of an entanglement measures are related to the decomposition of the suitably chosen representation of the…
We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.
The Isabelle Archive of Formal Proofs has grown to a significant size in the past years. It makes up for an impressive body of research, which enables a number of statistical approaches to various aspects in theorem proving, and has not yet…