相关论文: Saturation in regular, exotic and random pore netw…
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
The study of the topological structure of complex networks has fascinated researchers for several decades, and today we have a fairly good understanding of the types and reoccurring characteristics of many different complex networks.…
Random graph generation is an important tool for studying large complex networks. Despite abundance of random graph models, constructing models with application-driven constraints is poorly understood. In order to advance state-of-the-art…
Recently, the saturation problem of $0$-$1$ matrices gained a lot of attention. This problem can be regarded as a saturation problem of ordered bipartite graphs. Motivated by this, we initiate the study of the saturation problem of ordered…
In this paper we examine the percolation properties of higher-order networks that have non-trivial clustering and subgraph-based assortative mixing (the tendency of vertices to connect to other vertices based on subgraph joint degree). Our…
Bootstrap percolation in (random) graphs is a contagion dynamics among a set of vertices with certain threshold levels. The process is started by a set of initially infected vertices, and an initially uninfected vertex with threshold $k$…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…
We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set $S$ of nodes of a prescribed cardinality, we add a new node that is adjacent to…
Local percolation probabilities are used to characterize the connectivity in porous and heterogeneous media. Together with local porosity distributions they allow to predict transport properties \cite{hil91d}. While local porosity…
Exploring statistics of locally connected subgraph patterns (also known as network motifs) has helped researchers better understand the structure and function of biological and online social networks (OSNs). Nowadays the massive size of…
The study of the optimality of low-complexity greedy scheduling techniques in wireless communications networks is a very complex problem. The Local Pooling (LoP) factor provides a single-parameter means of expressing the achievable capacity…
We perform more than 6000 steady-state simulations with a dynamic pore network model, corresponding to a large span in viscosity ratios and capillary numbers. From these simulations, dimensionless quantities such as relative permeabilities,…
Following [6,12], we study coupled map networks over arbitrary finite graphs. An estimate from below for a topological entropy of a perturbed coupled map network via a topological entropy of an unperturbed network by making use of the…
The study of random graphs has become very popular for real-life network modeling such as social networks or financial networks. Inhomogeneous long-range percolation (or scale-free percolation) on the lattice $\mathbb Z^d$, $d\ge1$, is a…
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…
In this paper, site percolation on random $\Phi^{3}$ planar graphs is studied by Monte-Carlo numerical techniques. The method consists in randomly removing a fraction $q=1-p$ of vertices from graphs generated by Monte-Carlo simulations,…
Data-driven analysis of complex networks has been in the focus of research for decades. An important area of research is to study how well real networks can be described with a small selection of metrics, furthermore how well network models…
This study presents a novel algorithm based on graph theory for the precise segmentation and measurement of detonation cells from 3D pressure traces, termed detonation lattices, addressing the limitations of manual and primitive 2D edge…