Search results for "random graph"
showing 8 items of 28 documents
The smallest singular value of a shifted $d$-regular random square matrix
2017
We derive a lower bound on the smallest singular value of a random d-regular matrix, that is, the adjacency matrix of a random d-regular directed graph. Specifically, let $$C_1<d< c n/\log ^2 n$$ and let $$\mathcal {M}_{n,d}$$ be the set of all $$n\times n$$ square matrices with 0 / 1 entries, such that each row and each column of every matrix in $$\mathcal {M}_{n,d}$$ has exactly d ones. Let M be a random matrix uniformly distributed on $$\mathcal {M}_{n,d}$$ . Then the smallest singular value $$s_{n} (M)$$ of M is greater than $$n^{-6}$$ with probability at least $$1-C_2\log ^2 d/\sqrt{d}$$ , where c, $$C_1$$ , and $$C_2$$ are absolute positive constants independent of any other parameter…
Covariance and correlation estimators in bipartite complex systems with a double heterogeneity
2019
Complex bipartite systems are studied in Biology, Physics, Economics, and Social Sciences, and they can suitably be described as bipartite networks. The heterogeneity of elements in those systems makes it very difficult to perform a statistical analysis of similarity starting from empirical data. Though binary Pearson's correlation coefficient has proved effective to investigate the similarity structure of some real-world bipartite networks, here we show that both the usual sample covariance and correlation coefficient are affected by a bias, which is due to the aforementioned heterogeneity. Such a bias affects real bipartite systems, and, for example, we report its effects on empirical dat…
Random walk networks
2004
Abstract Random Boolean networks are among the best-known systems used to model genetic networks. They show an on–off dynamics and it is easy to obtain analytical results with them. Unfortunately very few genes are strictly on–off switched. On the other hand, continuous methods are in principle more suitable to capture the real behavior of the genome, but have difficulties when trying to obtain analytical results. In this work, we introduce a new model of random discrete network: random walk networks, where the state of each gene is changed by small discrete variations, being thus a natural bridge between discrete and continuous models.
On the Analysis of a Random Interleaving Walk–Jump Process with Applications to Testing
2011
Abstract Although random walks (RWs) with single-step transitions have been extensively studied for almost a century as seen in Feller (1968), problems involving the analysis of RWs that contain interleaving random steps and random “jumps” are intrinsically hard. In this article, we consider the analysis of one such fascinating RW, where every step is paired with its counterpart random jump. In addition to this RW being conceptually interesting, it has applications in testing of entities (components or personnel), where the entity is never allowed to make more than a prespecified number of consecutive failures. The article contains the analysis of the chain, some fascinating limiting proper…
Trapping of Continuous-Time Quantum walks on Erdos-Renyi graphs
2011
We consider the coherent exciton transport, modeled by continuous-time quantum walks, on Erd\"{o}s-R\'{e}ny graphs in the presence of a random distribution of traps. The role of trap concentration and of the substrate dilution is deepened showing that, at long times and for intermediate degree of dilution, the survival probability typically decays exponentially with a (average) decay rate which depends non monotonically on the graph connectivity; when the degree of dilution is either very low or very high, stationary states, not affected by traps, get more likely giving rise to a survival probability decaying to a finite value. Both these features constitute a qualitative difference with re…
On statistical inference for the random set generated Cox process with set-marking.
2007
Cox point process is a process class for hierarchical modelling of systems of non-interacting points in ℝd under environmental heterogeneity which is modelled through a random intensity function. In this work a class of Cox processes is suggested where the random intensity is generated by a random closed set. Such heterogeneity appears for example in forestry where silvicultural treatments like harvesting and site-preparation create geometrical patterns for tree density variation in two different phases. In this paper the second order property, important both in data analysis and in the context of spatial sampling, is derived. The usefulness of the random set generated Cox process is highly…
Analyzing online search patterns of music festival tourists
2020
Music festivals, as cultural events that induce tourism flows, intermediate both the cultural and travel experience. The present study analyzes online search behavior of potential attenders to a music festival. We hypothesize that the search process reveals latent patterns of behavior of cultural tourists planning to attend music festivals. To this end, information from Google Trends on queries related to three popular music festivals is used to build a network of search topics. Based on it, alternative exponential random graph model specifications are estimated. Findings support the general result of mediated information flows: music festivals induce planning and traveling queries. Howeve…
Univariate and multivariate properties of wind velocity time series
2009
We analyze the time series of hourly average wind speeds measured at 29 different stations located in Sicily, a region with a complex morphology. The investigation, performed from the univariate as well as the multivariate point of view, evidences that the statistical properties of wind at the single sites have features that are not reproduced by standard models and, thus, require specific modeling. Moreover, the synchronous evolution of wind velocity presents a cluster structure, obtained with different algorithms, that persists in the standard deviation too.