Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Iyer, Srikanth K"'
Autor:
Nabeel, Arshed, Jadhav, Vivek, M, Danny Raj, Sire, Clément, Theraulaz, Guy, Escobedo, Ramón, Iyer, Srikanth K., Guttal, Vishwesha
Publikováno v:
Physical Biology, 20, 056003, 2023
Coarse-grained descriptions of collective motion of flocking systems are often derived for the macroscopic or the thermodynamic limit. However, many real flocks are small sized (10 to 100 individuals), called the mesoscopic scales, where stochasticit
Externí odkaz:
http://arxiv.org/abs/2304.10071
Autor:
Iyer, Srikanth K., Jhawar, Sanjoy Kr.
Publikováno v:
Electron. J. Probab. 26(none): 1-23 (2021)
We study an inhomogeneous random connection model in the connectivity regime. The vertex set of the graph is a homogeneous Poisson point process $\mathcal{P}_s$ of intensity $s>0$ on the unit cube $S=\left(-\frac{1}{2},\frac{1}{2}\right]^{d},$ $d \ge
Externí odkaz:
http://arxiv.org/abs/2002.10128
Autor:
Iyer, Srikanth K., Jhawar, Sanjoy Kr.
We study phase transition and percolation at criticality for three random graph models on the plane, viz., the homogeneous and inhomogeneous enhanced random connection models (RCM) and the Poisson stick model. These models are built on a homogeneous
Externí odkaz:
http://arxiv.org/abs/1908.00346
Autor:
Iyer, Srikanth K., Yogeshwaran, D.
We study combinatorial connectivity for two models of random geometric complexes. These two models - \v{C}ech and Vietoris-Rips complexes - are built on a homogeneous Poisson point process of intensity $n$ on a $d$-dimensional torus using balls of ra
Externí odkaz:
http://arxiv.org/abs/1802.08224
Publikováno v:
Phys. Rev. E 99, 032412 (2019)
Many animal groups are heterogeneous and may even consist of individuals of different species, called mixed-species flocks. Mathematical and computational models of collective animal movement behaviour, however, typically assume that groups and popul
Externí odkaz:
http://arxiv.org/abs/1711.06882
Autor:
Iyer, Srikanth K.
Consider the random graph $G({\mathcal P}_{n},r)$ whose vertex set ${\mathcal P}_{n}$ is a Poisson point process of intensity $n$ on $(- \frac{1}{2}, \frac{1}{2}]^d$, $d \geq 2$. Any two vertices $X_i,X_j \in {\mathcal P}_{n}$ are connected by an edg
Externí odkaz:
http://arxiv.org/abs/1510.05440
Autor:
Iyer, Srikanth K., Vaze, Rahul
In wireless networks, where each node transmits independently of other nodes in the network (the ALOHA protocol), the expected delay experienced by a packet until it is successfully received at any other node is known to be infinite for signal-to-int
Externí odkaz:
http://arxiv.org/abs/1501.00381
This paper considers a model for cascades on random networks in which the cascade propagation at any node depends on the load at the failed neighbor, the degree of the neighbor as well as the load at that node. Each node in the network bears an initi
Externí odkaz:
http://arxiv.org/abs/1411.3796
Autor:
Iyer, Srikanth K., Thacker, Debleena
Publikováno v:
Annals of Applied Probability 2012, Vol. 22, No. 5, 2048-2066
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density function on $
Externí odkaz:
http://arxiv.org/abs/1210.5380
Autor:
Iyer, Srikanth K., Yogeshwaran, D.
Given two independent Poisson point processes $\Phi^{(1)},\Phi^{(2)}$ in $R^d$, the continuum AB percolation model is the graph with points of $\Phi^{(1)}$ as vertices and with edges between any pair of points for which the intersection of balls of r
Externí odkaz:
http://arxiv.org/abs/0904.0223