Related papers: A Modification of the Random Cutting Model
In this work, we introduce a random field in view of natural image modeling, obtained as a limit of sequences of dead leaves models, when considering arbitrarily small or big objects. The dead leaves model, introduced by the Mathematical…
We study the statistical properties of large random networks with specified degree distributions. New techniques are presented for analyzing the structure of social networks. Specifically, we address the question of how many nodes exist at…
In this paper we consider a simple virus infection spread model on a finite population of $n$ agents connected by some neighborhood structure. Given a graph $G$ on $n$ vertices, we begin with some fixed number of initial infected vertices.…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable structured class, such as the class of all planar graphs. Here we consider a general 'bridge-addable' class of graphs - if a graph…
A min-cut that seperates vertices s and t in a network is an edge set of minimum weight whose removal will disconnect s and t. This problem is the dual of the well known s-t max-flow problem. Several algorithms for the min-cut problem are…
We study a class of growth algorithms for directed graphs that are candidate models for the evolution of genetic regulatory networks. The algorithms involve partial duplication of nodes and their links, together with innovation of new…
We study the following version of cut sparsification. Given a large edge-weighted network $G$ with $k$ terminal vertices, compress it into a smaller network $H$ with the same terminals, such that every minimum terminal cut in $H$…
Degree distribution, or equivalently called degree sequence, has been commonly used to be one of most significant measures for studying a large number of complex networks with which some well-known results have been obtained. By contrast,…
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in…
In this paper, we consider the problem of reconstructing a directed graph using path queries. In this query model of learning, a graph is hidden from the learner, and the learner can access information about it with path queries. For a…
There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…
In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to logarithmic factors. The first problem is to approximate cuts in balanced directed…
We study the problem of deleting the smallest set $S$ of vertices (resp. edges) from a given graph $G$ such that the induced subgraph (resp. subgraph) $G \setminus S$ belongs to some class $\mathcal{H}$. We consider the case where graphs in…
We consider the propagation of a contagion process (epidemic) on a network and study the problem of dynamically allocating a fixed curing budget to the nodes of the graph, at each time instant. For bounded degree graphs, we provide a lower…
The sensitivity of networks regarding the removal of vertices has been studied extensively within the last 15 years. A common approach to measure this sensitivity is (i) removing successively vertices by following a specific removal…
For a hereditary graph class $\mathcal{H}$, the $\mathcal{H}$-elimination distance of a graph $G$ is the minimum number of rounds needed to reduce $G$ to a member of $\mathcal{H}$ by removing one vertex from each connected component in each…
We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that…
We introduce a new model of random tree that grows like a random recursive tree, except at some exceptional "doubling events" when the tree is replaced by two copies of itself attached to a new root. We prove asymptotic results for the size…
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…