Related papers: Counting subgraphs in bounded-size Achlioptas proc…
We describe a variant of the Bellman-Ford algorithm for single-source shortest paths in graphs with negative edges but no negative cycles that randomly permutes the vertices and uses this randomized order to process the vertices within each…
We consider the Graph Ornstein-Uhlenbeck (GrOU) process observed on a non-uniform discrete time grid and introduce discretised maximum likelihood estimators with parameters specific to the whole graph or specific to each component, or node.…
This paper quantifies the impact of branches and branch mispredictions on the single-core performance for two classes of graph problems. Specifically, we consider classical algorithms for computing connected components and breadth-first…
Estimation of permutation entropy (PE) using Bayesian statistical methods is presented for systems where the ordinal pattern sampling follows an independent, multinomial distribution. It is demonstrated that the PE posterior distribution is…
A classical result from graph theory is that every graph with chromatic number \chi > t contains a subgraph with all degrees at least t, and therefore contains a copy of every t-edge tree. Bohman, Frieze, and Mubayi recently posed this…
When analyzing data from multiple sources, it is often convenient to strike a careful balance between two goals: capturing the heterogeneity of the samples and sharing information across them. We introduce a novel framework to model a…
We consider a dynamic Erd\H{o}s-R\'enyi random graph (ERRG) on $n$ vertices in which each edge switches on at rate $\lambda$ and switches off at rate $\mu$, independently of other edges. The focus is on the analysis of the evolution of the…
The dissertation is related to combinatorial geometry with a strong probabilistic flavor. The main results can be split into three parts. The results of the first part guarantee that each "unit distance graph" in the plane has an induced…
Consider observations $y_1,\dots,y_n$ on nodes of a connected graph, where the $y_i$ independently come from $N(\theta_i, \sigma^2)$ distributions and an unknown partition divides the $n$ observations into blocks. One well-studied class of…
This article studies a particular process that approximates solutions of the Beltrami equation (straightening of ellipse fields, a.k.a. measurable Riemann mapping theorem) on $\mathbb{C}$. It passes through the introduction of a sequence of…
In this paper we present a new approach to visualize directed graphs and their hierarchies that completely departs from the classical four-phase framework of Sugiyama and computes readable hierarchical visualizations that contain the…
The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is ${\sf NP}$-hard in…
The nonparametric view of Bayesian inference has transformed statistics and many of its applications. The canonical Dirichlet process and other more general families of nonparametric priors have served as a gateway to solve frontier…
We extend the work of Aarts et al., including an imaginary chemical potential for quark number into the Sakai-Sugimoto model and codimension k defect theories. The phase diagram of these models are a function of three parameters, the…
We consider single-source shortest path algorithms that perform a sequence of relaxation steps whose ordering depends only on the input graph structure and not on its weights or the results of prior steps. Each step examines one edge of the…
Inferring models, predicting the future, and estimating the entropy rate of discrete-time, discrete-event processes is well-worn ground. However, a much broader class of discrete-event processes operates in continuous-time. Here, we provide…
Consider the budget-constrained random graph process introduced by Frieze, Krivelevich and Michaeli, where each time an edge is offered through the (standard) random graph process we must irrevocably decide whether to "purchase" this edge…
The availability of larger and larger graph datasets, growing exponentially over the years, has created several new algorithmic challenges to be addressed. Sequential approaches have become unfeasible, while interest on parallel and…
Due to the popularity of randomly evolving graph processes, there exists a randomized version of many recursively defined graph models. This is also the case with the cherry tree, which was introduced by Buksz\'ar and Pr\'ekopa to improve…
In many applications, it is often necessary to sample the mean value of certain quantity with respect to a probability measure {\mu} on the level set of a smooth function $\xi: \mathbb{R}^d\rightarrow \mathbb{R}^k$, $1\le k < d$. A…