Micro- and macroscopic modeling of crowding and pushing in corridors

Michael Fischer; Gaspard Jankowiak; Marie-Therese Wolfram; Michael Fischer; Gaspard Jankowiak; Marie-Therese Wolfram

doi:10.3934/nhm.2020025

Networks and Heterogeneous Media

2020, Volume 15, Issue 3: 405-426. doi: 10.3934/nhm.2020025

Previous Article Next Article

Micro- and macroscopic modeling of crowding and pushing in corridors

1.
Radon Institute for Applied and Computational Mathematics, Altenbergerstr. 69, 4040, Linz, Austria
2.
University of Warwick, Mathematics Institute, Gibbet Hill Road, CV47AL Coventry, UK

Received: 01 November 2019 Revised: 01 July 2020 Published: 09 September 2020
91C20, 68Q80, 35Q84

Experiments with pedestrians revealed that the geometry of the domain, as well as the incentive of pedestrians to reach a target as fast as possible have a strong influence on the overall dynamics. In this paper, we propose and validate different mathematical models at the micro- and macroscopic levels to study the influence of both effects. We calibrate the models with experimental data and compare the results at the micro- as well as macroscopic levels. Our numerical simulations reproduce qualitative experimental features on both levels, and indicate how geometry and motivation level influence the observed pedestrian density. Furthermore, we discuss the dynamics of solutions for different modeling approaches and comment on the analysis of the respective equations.

Keywords:

Microscopic and macroscopic pedestrian models,
Fokker-Planck equation,
parameter estimation,
scalar conservation laws,
eikonal equation

Citation: Michael Fischer, Gaspard Jankowiak, Marie-Therese Wolfram. Micro- and macroscopic modeling of crowding and pushing in corridors[J]. Networks and Heterogeneous Media, 2020, 15(3): 405-426. doi: 10.3934/nhm.2020025

Related Papers:

[1]	Sarker Ashraful Islam, Farhana Kabir Esheta, Md Mahir Shahriar, Dewan Hasan Ahmed . Numerical study of aerodynamic drag reduction of a circular cylinder with an inbuilt nozzle. Metascience in Aerospace, 2024, 1(4): 379-400. doi: 10.3934/mina.2024018
[2]	Hussein Kokash, G. Gilou Agbaglah . A two- to three-dimensional wake transition mechanism induced by the angle of attack of a NACA0012 airfoil. Metascience in Aerospace, 2024, 1(3): 329-345. doi: 10.3934/mina.2024015
[3]	Jubilee Prasad Rao, Sai Naveen Chimata . Machine learning-based surrogates for eVTOL performance prediction and design optimization. Metascience in Aerospace, 2024, 1(3): 246-267. doi: 10.3934/mina.2024011
[4]	Hui Ying WANG, Némo DECAMPS . Effects of oxygen concentration of oxidizer flow on laminar diffusion flame established over liquid fuel beds at microgravity. Metascience in Aerospace, 2024, 1(2): 159-184. doi: 10.3934/mina.2024007
[5]	Pasynok Sergey . Cumulative STF coefficients evaluation and validation. Metascience in Aerospace, 2024, 1(4): 371-378. doi: 10.3934/mina.2024017
[6]	Dulce M Graciano, Fernando Z Sierra-Espinosa, Juan C García . Numerical simulation of vortex-induced vibration in a bladeless turbine: Effects of separation distance between tandem harvesters. Metascience in Aerospace, 2024, 1(3): 309-328. doi: 10.3934/mina.2024014
[7]	James H. Page, Lorenzo Dorbolò, Marco Pretto, Alessandro Zanon, Pietro Giannattasio, Michele De Gennaro . Sensitivity analysis of mixed analysis-synthesis flight profile reconstruction. Metascience in Aerospace, 2024, 1(4): 401-415. doi: 10.3934/mina.2024019
[8]	Xu Han, Bin Yu, Hong Liu . Mixing mechanisms in the view of mixing indicators: from passive-scalar mixing to variable-density mixing. Metascience in Aerospace, 2024, 1(1): 1-37. doi: 10.3934/mina.2024001
[9]	Weizhen Tang, Jie Dai, Zhousheng Huang . Comprehensive assessment of air pollutant and noise emissions at airports across different altitudes. Metascience in Aerospace, 2024, 1(3): 292-308. doi: 10.3934/mina.2024013
[10]	Yuan Hu, Zhihao Jiang, Xintai Yuan, Xifan Hua, Wei Liu . Isometric mapping algorithm based GNSS-R sea ice detection. Metascience in Aerospace, 2024, 1(1): 38-52. doi: 10.3934/mina.2024002

Abstract

1. Introduction and preliminaries

We begin with the following definitions of notations:

$\begin{equation*} \mathbb{N = }\left\{ 1, 2, 3, \cdots \right\} \text{ and }\mathbb{N}_{0}: = \mathbb{ N\cup }\left\{ 0\right\} \text{.} \end{equation*}$

Also, as usual, $\mathbb{R}$ denotes the set of real numbers and $\mathbb{C}$ denotes the set of complex numbers.

The two variable Laguerre polynomials $L_{n}(u, v)$ ^[1] are defined by the Taylor expansion about $\tau = 0$ (also popularly known as generating function) as follows:

$\begin{equation*} \sum\limits_{p = 0}^{\infty }L_{p}(u, v)\frac{\tau ^{p}}{p!} = e^{v\tau }C_{0}(u\tau ), \end{equation*}$

where is the $0$ -th order Tricomi function ^[19] given by

$\begin{equation*} C_{0}(u) = \sum\limits_{p = 0}^{\infty }\frac{(-1)^{p}u^{p}}{(p!)^{2}} \end{equation*}$

and has the series representation

$\begin{equation*} L_{p}(u, v) = \sum\limits_{s = 0}^{p}\; \frac{p!(-1)^{s}v^{p-s}u^{s}}{(p-s)!(s!)^{2}}. \end{equation*}$

The classical Euler polynomials $E_{p}(u)$ , Genocchi polynomials $G_{p}(u)$ and the Bernoulli polynomials $B_{p}(u)$ are usually defined by the generating functions (see, for details and further work, ^{[1,2,4,5,6,7,9,11,12,20]}):

$\begin{equation*} \sum\limits_{p = 0}^{\infty }E_{p}(u)\frac{\tau ^{p}}{p!} = \frac{2}{e^{\tau }+1} e^{u\tau }\quad (|\tau | \lt \pi ), \end{equation*}$

$\begin{equation*} \sum\limits_{p = 0}^{\infty }G_{p}(u)\frac{\tau ^{p}}{p!} = \frac{2\tau }{e^{\tau }+1} e^{u\tau }\quad (|\tau | \lt \pi ) \end{equation*}$

and

$\begin{equation*} \sum\limits_{p = 0}^{\infty }B_{p}(u)\frac{\tau ^{p}}{p!} = \frac{\tau }{e^{\tau }-1} e^{u\tau }\quad (|\tau | \lt 2\pi ). \end{equation*}$

The Daehee polynomials, recently originally defined by Kim et al. ^[9], are defined as follows

$\begin{equation} \sum\limits_{p = 0}^{\infty }D_{p}(u)\frac{\tau ^{p}}{p!} = \frac{\log (1+\tau )}{\tau } (1+\tau )^{u}, \end{equation}$

(1.1)

where, for $u = 0$ , $D_{p}(0) = D_{p}$ stands for Daehee numbers given by

$\begin{equation} \sum\limits_{p = 0}^{\infty }D_{p}\, \frac{\tau ^{p}}{p!} = \frac{\log (1+\tau )}{\tau }. \end{equation}$

(1.2)

Due to Kim et al.'s idea ^[9], Jang et al. ^[3] gave the partially degenarate Genocchi polynomials as follows:

$\begin{equation} \frac{2\log (1+\tau \lambda )^{\frac{1}{\lambda }}}{e^{\tau }+1}e^{u\tau } = \sum\limits_{p = 0}^{\infty }G_{p, \lambda }(u)\frac{\tau ^{p}}{p!}, \end{equation}$

(1.3)

which, for the case $u = 0$ , yields the partially degenerate Genocchi numbers $G_{n, \lambda }: = G_{n, \lambda }(0)$ .

Pathan et al. ^[17] considered the generalization of Hermite-Bernoulli polynomials of two variables ${}_{H}B_{p}^{(\alpha)}(u, v)$ as follows

$\begin{equation} \left( \frac{\tau }{e^{\tau }-1}\right) ^{\alpha }e^{u\tau +v\tau ^{2}} = \sum\limits_{p = 0}^{\infty }{}_{H}B_{p}^{(\alpha )}(u, v)\frac{\tau ^{p}}{p!}. \end{equation}$

(1.4)

On taking $\alpha = 1$ in (1.4) yields a well known result of [2,p. 386 (1.6)] given by

$\begin{equation} \left( \frac{\tau }{e^{\tau }-1}\right) e^{u\tau +v\tau ^{2}} = \sum\limits_{p = 0}^{\infty }{}_{H}B_{p}(u, v)\frac{\tau ^{p}}{p!}. \end{equation}$

(1.5)

The two variable Laguerre-Euler polynomials (see ^[7,8]) are defined as

$\begin{equation} \sum\limits_{p = 0}^{\infty }{}_{L}E_{p}(u, v)\frac{\tau ^{p}}{p!} = \frac{2}{e^{\tau }+1}e^{v\tau }C_{0}(u\tau ). \end{equation}$

(1.6)

The alternating sum $T_{k}(p)$ , where $k\in \mathbb{N}_{0}$ , (see ^[14]) is given as

$\begin{equation*} T_{k}(p) = \sum\limits_{j = 0}^{p}(-1)^{j}j^{k} \end{equation*}$

and possess the generating function

$\begin{equation} \sum\limits_{r = 0}^{\infty }T_{k}(p)\frac{\tau ^{r}}{r!} = \frac{1-(-e^{\tau })^{(p+1)} }{e^{\tau }+1}. \end{equation}$

(1.7)

The idea of degenerate numbers and polynomials found existence with the study related to Bernoulli and Euler numbers and polynomials. Lately, many researchers have begun to study the degenerate versions of the classical and special polynomials (see ^{[3,10,11,12,13,14,15,16,18]}, for a systematic work). Influenced by their works, we introduce partially degenerate Laguerre-Genocchi polynomials and also a new generalization of partially degenerate Laguerre-Genocchi polynomials and then give some of their applications. We also derive some implicit summation formula and general symmetry identities.

2. Partially degenerate Laguerre-Genocchi polynomials

Let $\lambda, \tau \in \mathbb{C}$ with $|\tau \lambda |\leq 1$ and $\tau \lambda \neq -1$ . We introduce and investigate the partially degenerate Laguerre-Genocchi polynomials as follows:

$\begin{equation} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} = \frac{ 2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{e^{\tau }+1}e^{v\tau }C_{0}(u\tau ). \end{equation}$

(2.1)

In particular, when $\lambda\to 0$ , ${}_LG_{p, \lambda}(u, v)\to {}_LG_p(u, v)$ and they have the closed form given as

$\begin{equation*} {}_{L}G_{p, \lambda }(u, v) = \sum\limits_{q = 0}^{p}\binom{p}{q}G_{q, \lambda }L_{p-q}(u, v). \end{equation*}$

Clearly, $u = 0$ in (2.1) gives ${}_{L}G_{p, \lambda }(0, 0): = G_{p, \lambda }$ that stands for the partially degenerate Genocchi polynomials ^[3].

Theorem 1. For $p \in \mathbb{N}_{o}$ , the undermentioned relation holds:

$\begin{equation} {}_LG_{p, \lambda}(u, v) = \sum\limits_{q = 0}^{p} \binom{p}{q+1}\, q!(-\lambda)^{q}{}_LG_{p-q-1}(u, v). \end{equation}$

(2.2)

Proof. With the help of (2.1), one can write

$\begin{align*} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} = & \frac{ 2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{e^{\tau }+1}e^{v\tau }C_{0}(u\tau ) \\ = & \tau\left\{ \sum\limits_{q = 0}^{\infty }\frac{(-1)^{q}}{q+1}(\lambda \tau )^{q}\right\} \left\{ \sum\limits_{p = 0}^{\infty }{}_{L}G_{p}(u, v)\frac{\tau ^{p}}{p! }\right\} \\ = & \sum\limits_{p = 0}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\binom{p}{q}\frac{(-\lambda )^{q}}{q+1}q!{}_{L}G_{p-q}(u, v)\right\} \frac{\tau ^{p+1}}{p!}, \end{align*}$

where, ${}_{L}G_{p-q}(u, v)$ are the Laguerre-Genocchi polynomials (see ^[8]). Finally, the assertion easily follows by equating the coefficients $\frac{ \tau ^{p}}{p!}$ .

Theorem 2. For $p\in \mathbb{N}_{o}$ , the undermentioned relation holds:

$\begin{equation} {}_{L}G_{p+1, \lambda }(u, v) = \sum\limits_{q = 0}^{p}\binom{p}{q}\lambda ^{q}(p+1){}_{L}G_{p-q+1}(u, v)D_{q}. \end{equation}$

(2.3)

Proof. We first consider

$\begin{align*} I_{1} = \frac{1}{\tau }\frac{2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{ e^{\tau }+1}e^{v\tau }C_{0}(u\tau ) = & \left\{ \sum\limits_{q = 0}^{\infty }D_{q}\frac{ (\lambda \tau )^{q}}{q!}\right\} \left\{ \sum\limits_{p = 0}^{\infty }{}_{L}G_{p}(u, v) \frac{\tau ^{p}}{p!}\right\} \\ = & \sum\limits_{p = 1}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\binom{p}{q}(\lambda )^{q} D_{q}{}_{L}G_{p-q}(u, v)\right\} \frac{\tau ^{p}}{p!}. \end{align*}$

Next we have,

$\begin{align*} I_{2} = \frac{1}{\tau}\frac{2\log(1+\lambda \tau)^{\frac{1}{\lambda}}}{ e^{\tau}+1}e^{v\tau}C_{o}(u\tau) = &\frac{1}{\tau}\sum\limits_{p = 0}^{\infty}{}_LG_{p, \lambda}(u, v)\frac{\tau^{p}}{p!} \\ = &\sum\limits_{p = 0}^{\infty}\frac{{}_LG_{p+1, \lambda}(u, v)}{p+1}\frac{\tau^{p}}{p!}. \end{align*}$

Since $I_{1} = I_{2}$ , we conclude the assertion (2.3) of Theorem 2.

Theorem 3. For $p\in \mathbb{N}_{0}$ , the undermentioned relation holds:

$\begin{equation} {}_{L}G_{p, \lambda }(u, v) = p\sum\limits_{q = 0}^{p-1}\binom{p-1}{q}(\lambda )^{q}{}_{L}E_{p-q-1}(u, v)D_{q}. \end{equation}$

(2.4)

Proof. With the help of (2.1), one can write

$\begin{align*} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(x, y)\frac{\tau ^{p}}{p!} = & \left\{ \frac{\tau \log (1+\lambda \tau )}{\lambda \tau }\right\} \left\{ \frac{2}{ e^{\tau }+1}e^{v\tau }C_{0}(u\tau )\right\} \\ = & \tau \left\{ \sum\limits_{q = 0}^{\infty }D_{q}\frac{(\lambda \tau )^{q}}{q!} \right\} \left\{ \sum\limits_{p = 0}^{\infty }{}_{L}E_{p}(u, v)\frac{\tau ^{p}}{p!} \right\} \\ = & \sum\limits_{p = 0}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\binom{p}{q}(\lambda )^{q}D_{q}\, {}_{L}E_{p-q}(u, v)\right\} \frac{\tau ^{p+1}}{p!}. \end{align*}$

Finally, the assertion (2.4) straightforwardly follows by equating the coefficients of same powers of $\tau$ above.

Theorem 4. For $p\in \mathbb{N}_{o}$ , the following relation holds:

$\begin{equation} {}_{L}G_{p, \lambda }(u, v+1) = \sum\limits_{q = 0}^{p}\binom{p}{q}{}\; _{L}G_{p-q, \lambda }(u, v). \end{equation}$

(2.5)

Proof. Using (2.1), we find

$\begin{align*} \sum\limits_{p = 0}^{\infty }& \left\{ {}_{L}G_{p, \lambda }(u, v+1)-{}_{L}G_{p, \lambda }(u, v)\right\}\frac{\tau^p}{p!} = \frac{2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{e^{\tau }+1} \\ \times & e^{(v+1)\tau }C_{0}(u\tau )-\frac{2\log (1+\lambda \tau )^{\frac{1}{ \lambda }}}{e^{\tau }+1}e^{v\tau }C_{0}(u\tau ) \\ = & \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} \sum\limits_{q = 0}^{\infty }\frac{\tau ^{q}}{q!}-\sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} \\ = & \sum\limits_{p = 0}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\binom{p}{q}\; {}_{L}G_{p-q, \lambda }(u, v)-{}_{L}G_{p, \lambda }(u, v)\right\} \frac{\tau ^{p}}{p!}. \end{align*}$

Hence, the assertion (2.5) straightforwardly follows by equating the coefficients of $\tau ^{p}$ above.

Theorem 5. For $p\in \mathbb{N}_{o}$ , the undermentioned relation holds:

$\begin{equation} {}_{L}G_{p, \lambda }(u, v) = \sum\limits_{q = 0}^{p}\sum\limits_{l = 0}^{q}\binom{p}{q}\binom{q}{l }G_{p-q}D_{q-l}\; \lambda ^{q-l}L_{l}(u, v). \end{equation}$

(2.6)

Proof. Since

$\begin{align*} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} = & \frac{ 2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{e^{\tau }+1}e^{v\tau }C_{0}(u\tau ) \\ = & \left\{ \frac{2\tau }{e^{\tau }+1}\right\} \left\{ \frac{2\log (1+\lambda \tau )}{\lambda \tau }\right\} e^{v\tau }C_{0}(u\tau ) \\ = & \left\{ \sum\limits_{p = 0}^{\infty }G_{p}\frac{\tau ^{p}}{p!}\right\} \left\{ \sum\limits_{q = 0}^{\infty }D_{q}\frac{(\lambda \tau )^{q}}{q!}\right\} \left\{ \sum\limits_{l = 0}^{\infty }L_{l}(u, v)\frac{\tau ^{l}}{l!}\right\} , \end{align*}$

we have

$\begin{equation*} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} = \sum\limits_{p = 0}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\sum\limits_{l = 0}^{q}\binom{p}{q}\binom{q }{l}G_{p-q}D_{q-l}\lambda ^{q-l}L_{l}(u, v)\right\} \frac{\tau ^{p}}{p!}. \end{equation*}$

We thus complete the proof of Theorem 5.

Theorem 6. (Multiplication formula). For $p\in \mathbb{N}_{o}$ , the undermentioned relation holds:

$\begin{equation} {}_{L}G_{p, \lambda }(u, v) = f^{p-1}\sum\limits_{a = 0}^{f-1}{}_{L}G_{p, \frac{\lambda }{f }}\left( u, \frac{v+a}{f}\right). \; \; \; \; \; \; \; \; \end{equation}$

(2.7)

Proof. With the help of (2.1), we obtain

$\begin{align*} \sum\limits_{p = 0}^{\infty}{}_LG_{p, \lambda}(u, v)\frac{\tau^{p}}{p!} = &\frac{ 2\log(1+\lambda \tau)^{\frac{1}{\lambda}}}{e^{\tau}+1}e^{v\tau}C_{0}(u\tau) \\ = &\frac{2\log(1+\lambda \tau)^{\frac{1}{\lambda}}}{e^{\tau}+1} C_{0}(u\tau)\sum\limits_{a = 0}^{f-1}e^{(a+v)\tau} \\ = &\sum\limits_{p = 0}^{\infty}\left\lbrace f^{p-1}\sum\limits_{a = 0}^{f-1}{}_LG_{p, \frac{ \lambda}{f}}\left(u, \frac{v+a}{f}\right)\right\rbrace\frac{\tau^{p}}{p!}. \end{align*}$

Thus, the result in (2.7) straightforwardly follows by comparing the coefficients of $\tau^{p}$ above.

3. Generalized partially degenerate Laguerre-Genocchi polynomials

Consider a Dirichlet character $\chi$ and let $d\; \; (d\in \mathbb{N})$ be the conductor connected with it such that $d\equiv 1(\mod 2)$ (see ^[22]). Now we present a generalization of partially degenerate Laguerre-Genocchi polynomials attached to $\chi$ as follows:

$\begin{equation} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \chi , \lambda }(u, v)\frac{\tau ^{p}}{p!} = \frac{2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{e^{f\tau }+1} \sum\limits_{a = 0}^{f-1}(-1)^{a}\chi (a)e^{(v+a)\tau }C_{0}(u\tau ). \end{equation}$

(3.1)

Here, $G_{p, \chi, \lambda } = {}_{L}G_{p, \chi, \lambda }(0, 0)$ are in fact, the generalized partially degenerate Genocchi numbers attached to the Drichlet character $\chi$ . We also notice that

$\underset{\begin{smallmatrix} \lambda \to 0 \\ v = 0 \end{smallmatrix}}{\mathop \lim\limits }\, \ {{\ }_{L}}{{G}_{p, \chi , \lambda }}(u, v) = {{G}_{p, \chi }}(u),$

is the familiar looking generalized Genocchi polynomial (see ^[20]).

Theorem 7. For $p\in \mathbb{N}_{0}$ , the following relation holds:

$\begin{equation} {}_{L}G_{p, \chi , \lambda }(u, v) = \sum\limits_{q = 0}^{p}\binom{p}{q}\lambda ^{q}D_{q}\, {}_{L}G_{p-q, \chi }(u, v). \end{equation}$

(3.2)

Proof. In view of (3.1), we can write

$\begin{equation*} \sum\limits_{p = 0}^{\infty}{}_LG_{p, \chi, \lambda}(u, v)\frac{\tau^{p}}{p!} = \frac{ 2\log(1+\lambda \tau)^{\frac{1}{\lambda}}}{e^{f\tau}+1} \sum\limits_{a = 0}^{f-1} (-1)^{a} \chi(a) e^{(v+a)\tau} C_{0}(u\tau) \end{equation*}$

$\begin{equation*} = \left\lbrace\frac{\log(1+\lambda \tau)}{\lambda \tau}\right\rbrace\left \lbrace \frac{2\tau}{e^{f\tau}+1}\sum\limits_{a = 0}^{f-1} (-1)^{a} \chi(a) e^{(v+a)\tau} C_{0}(u\tau)\right\rbrace \end{equation*}$

$\begin{equation*} = \left\lbrace\sum\limits_{q = 0}^{\infty}D_{q}\frac{\lambda^{q}}{\tau^{q}}{q!} \right\rbrace\left\lbrace \sum\limits_{p = 0}^{\infty}{}_LG_{p, \chi}(u, v)\frac{ \tau^{p}}{p!}\right\rbrace. \end{equation*}$

Finally, the assertion (3.2) of Theorem 7 can be achieved by equating the coefficients of same powers of $\tau$ .

Theorem 8. The undermentioned formula holds true:

$\begin{equation} {}_LG_{p, \chi, \lambda}(u, v) = f^{p-1} \sum\limits_{a = 0}^{f-1} (-1)^{a} \chi(a) {}_LG_{p, \frac{\lambda}{f}}\left(u, \frac{a+v}{f}\right). \end{equation}$

(3.3)

Proof. We first evaluate

$\begin{align*} \sum\limits_{p = 0}^{\infty}{}_LG_{p, \chi, \lambda}(u, v)\frac{\tau^{p}}{p!} = &\frac{ 2\log(1+\lambda \tau)^{\frac{1}{\lambda}}}{e^{f\tau}+1} \sum\limits_{a = 0}^{f-1} (-1)^{a} \chi(a) e^{(v+a)\tau} C_{0}(u\tau) \\ = &\frac{1}{f} \sum\limits_{a = 0}^{f-1} (-1)^{a} \chi(a) \frac{2\log(1+\lambda \tau)^{ \frac{f}{\lambda}}}{e^{f\tau}+1} e^{\left(\frac{a+v}{f}\right)f\tau} C_{0}(u\tau) \\ = &\sum\limits_{p = 0}^{\infty}\left\lbrace f^{p-1} \sum\limits_{a = 0}^{f-1} (-1)^{a} \chi(a) {}_LG_{p, \frac{\lambda}{f}}\left(u, \frac{a+v}{f}\right)\right\rbrace\frac{ \tau^{p}}{p!}. \end{align*}$

Now, the Theorem 8 can easily be concluded by equating the coefficients $\frac{\tau^{p}}{p!}$ above.

Using the result in (3.1) and with a similar approach used just as in above theorems, we provide some more theorems given below. The proofs are being omitted.

Theorem 9. The undermentioned formula holds true:

$\begin{equation} {}_{L}G_{p, \chi , \lambda }(u, v) = \sum\limits_{q = 0}^{p}\frac{G_{p-q, \chi , \lambda }(v)\; (-u)^{q}\; p!}{(q!)^{2}\, (p-q)!}. \end{equation}$

(3.4)

Theorem 10. The undermentioned formula holds true:

$\begin{equation} {}_{L}G_{p, \chi , \lambda }(u, v) = \sum\limits_{q = 0}^{p, l}\frac{G_{p-q-l, \chi , \lambda }\; (v)^{q}\; (-u)^{l}\; p!}{(p-q-l)!\; (q)!\; (l!)^{2}}. \end{equation}$

(3.5)

4. Implicit summation formulae

Theorem 11. The undermentioned formula holds true:

$\begin{equation} {}_{L}G_{l+h, \lambda }(u, \nu ) = \sum\limits_{p, n = 0}^{l, h}\binom{l}{p}\binom{h}{n} (u -v)^{p+n}{}_{L}G_{l+h-n-p, \lambda }(u, v). \end{equation}$

(4.1)

Proof. On changing $\tau$ by $\tau+\mu$ and rewriting (2.1), we evaluate

$\begin{equation*} e^{-v(\tau+\mu)} \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, v) \frac{ \tau^{l}\mu^{h}}{l!h!} = \frac{2\log(1+\lambda (\tau+\mu))^{\frac{1}{\lambda}} }{e^{\tau+\mu}+1} C_{o}(u(\tau+\mu)), \end{equation*}$

which, upon replacing $v$ by $u$ and solving further, gives

$\begin{equation*} e^{(u-v)(\tau+\mu)} \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, v) \frac{ \tau^{l}\mu^{h}}{l!h!} = \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, \nu) \frac{\tau^{l}\mu^{h}}{l!h!}, \end{equation*}$

and also

$\begin{equation} \sum\limits_{P = 0}^{\infty} \frac{(u-v)^{P}(\tau+u)^{P}}{P!}\sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, v) \frac{\tau^{l}\mu^{h}}{l!h!} = \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, \nu) \frac{\tau^{l}\mu^{h}}{l!h!}. \end{equation}$

(4.2)

Now applying the formula [21,p.52(2)]

$\begin{equation*} \sum\limits_{P = 0}^{\infty} f(P) \frac{(u+v)^{P}}{P!} = \sum\limits_{p, q = 0}^{\infty} f(p+q) \frac{u^{p}}{p!}\frac{v^{q}}{q!}, \end{equation*}$

in conjunction with (4.2), it becomes

$\begin{equation} \sum\limits_{p, n = 0}^{\infty} \frac{(u-v)^{p+n}\tau^{p}\mu^{n}}{p!n!} \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, v) \frac{\tau^{l}\mu^{h}}{l!h!} = \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, \nu) \frac{\tau^{l}\mu^{h}}{l!h! }.\; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \; \end{equation}$

(4.3)

Further, upon replacing $l$ by $l-p$ , $h$ by $h-n$ , and using the result in [21,p.100 (1)], in the left of (4.3), we obtain

$\begin{equation*} \sum\limits_{p, n = 0}^{\infty} \sum\limits_{l, h = 0}^{\infty} \frac{(u-v)^{p+n}}{p!\, n!} {} _LG_{l+h-p-n, \lambda}(u, v) \frac{\tau^{l}\mu^{h}}{(l-p)!(h-n)!} = \sum\limits_{l, h = 0}^{\infty} {}_LG_{l+h, \lambda}(u, \nu) \frac{\tau^{l}\mu^{h}}{ l!\, h!}. \end{equation*}$

Finally, the required result can be concluded by equating the coefficients of the identical powers of $\tau^{l}$ and $\mu^{h}$ above.

Corollary 4.1. For $h = 0$ in (4.1), we get

$\begin{equation*} {}_{L}G_{l, \lambda }(u, \nu ) = \sum\limits_{\rho = 0}^{l}\binom{l}{\rho } \; {(u-v)^p}_{L}G_{l-\rho , \lambda }(u, v). \end{equation*}$

Some identities of Genocchi polynomials for special values of the parameters $u$ and $\nu$ in Theorem 11 can also be obtained. Now, using the result in (2.1) and with a similar approach, we provide some more theorems given below. The proofs are being omitted.

Theorem 12. The undermentioned formula holds good:

$\begin{equation*} {}_{L}G_{p, \lambda }(u, v+\mu ) = \sum\limits_{q = 0}^{p}\binom{p}{q}\mu ^{q}{}_{L}G_{p-q, \lambda }(u, v) \end{equation*}$

Theorem 13. The undermentioned implicit holds true:

$\begin{equation*} \sum\limits_{p = 0}^{\infty }{}_{L}G_{p, \lambda }(u, v)\frac{\tau ^{p}}{p!} = \frac{ 2\log (1+\lambda \tau )^{\frac{1}{\lambda }}}{e^{\tau }+1}e^{v\tau }C_{o}(u\tau ) = \sum\limits_{q = 0}^{p}\binom{p}{q}G_{p-q, \lambda }\; L_{p}(u, v) \end{equation*}$

and

$\begin{equation*} {}_{L}G_{p, \lambda }(u, v) = \sum\limits_{q = 0}^{p}\binom{p}{q}G_{p-q, \lambda }(u, v)\; L_{p}(u, v)\mathit{\text{.}} \end{equation*}$

Theorem 14. The undermentioned implicit summation formula holds:

$\begin{equation*} {}_{L}G_{p, \lambda }(u, v+1)+{}_{L}G_{p, \lambda }(u, v) = 2p\; \sum\limits_{q = 0}^{p-1} \binom{p-1}{q}\frac{(-\lambda )^{q}q!}{q+1}L_{p-q-1}(u, v). \end{equation*}$

Theorem 15. The undermentioned formula holds true:

$\begin{equation*} {}_LG_{p, \lambda}(u, v+1) = \sum\limits_{q = 0}^{p} {}_LG_{p-q, \lambda}(u, v). \end{equation*}$

5. Symmetry identities

Symmetry identities involving various polynomials have been discussed (e.g., ^{[7,9,10,11,17]}). As in above-cited work, here, in view of the generating functions (1.3) and (2.1), we obtain symmetry identities for the partially degenerate Laguerre-Genocchi polynomials ${}_{L}G_{n, \lambda }(u, v)$ .

Theorem 16. Let $\alpha, \beta \in \mathbb{Z}$ and $p\in \mathbb{N}_{0}$ , we have

$\begin{equation*} \sum\limits_{q = 0}^{p}\binom{p}{q}\beta ^{q}\alpha ^{p-q}{}_{L}G_{p-q, \lambda }(u\beta , v\beta ){}_{L}G_{q, \lambda }(u\alpha , v\alpha ) \end{equation*}$

$\begin{equation*} = \sum\limits_{q = 0}^{p}\binom{p}{q}\alpha ^{q}\beta ^{p-q}{}_{L}G_{p-q, \lambda }(u\alpha , v\alpha ){}_{L}G_{q, \lambda }(u\beta , v\beta )\mathit{\text{.}} \end{equation*}$

Proof. We first consider

$\begin{equation*} g(\tau ) = \frac{\left\{ 2\log (1+\lambda )^{\frac{\beta }{\lambda }}\right\} }{(e^{\alpha \tau }+1)}\frac{\left\{ 2\log (1+\lambda )^{\frac{\alpha }{ \lambda }}\right\} }{\; (e^{\beta \tau }+1)}e^{(\alpha +\beta )v\tau }C_{0}(u\alpha \tau )C_{0}(u\beta \tau ). \end{equation*}$

Now we can have two series expansion of $g(\tau)$ in the following ways:

On one hand, we have

$\begin{eqnarray} g(\tau ) & = &\left( \sum\limits_{p = 0}^{\infty }\; _{L}G_{p, \lambda }(u\beta , v\beta )\frac{\left( \alpha \tau \right) ^{p}}{p!}\right) \left( \sum\limits_{q = 0}^{\infty }\; _{L}G_{q, \lambda }(u\alpha , v\alpha )\frac{ \left( \beta \tau \right) ^{q}}{q!}\right) \\ & = &\sum\limits_{p = 0}^{\infty }\left( \sum\limits_{q = 0}^{p}\binom{p}{q} \beta ^{q}\alpha ^{p-q}\; _{L}G_{p-q, \lambda }(u\beta , v\beta )\; _{L}G_{q, \lambda }(u\alpha , v\alpha )\right) \frac{\tau ^{p}}{p!}. \end{eqnarray}$

(5.1)

and on the other, we can write

$\begin{eqnarray} g(\tau ) & = &\left( \sum\limits_{p = 0}^{\infty }\; _{L}G_{p, \lambda }(u\alpha , v\alpha )\frac{\left( \beta \tau \right) ^{p}}{p!}\right) \left( \sum\limits_{q = 0}^{\infty }\; _{L}G_{q, \lambda }(u\beta , v\beta )\frac{\left( \alpha \tau \right) ^{q}}{q!}\right) \\ & = &\sum\limits_{p = 0}^{\infty }\left( \sum\limits_{q = 0}^{p}\binom{p}{q} \alpha ^{q}\beta ^{p-q}\; _{L}G_{p-q, \lambda }(u\alpha , v\alpha )\; _{L}G_{q, \lambda }(u\beta , v\beta )\right) \frac{\tau ^{p}}{p!}. \end{eqnarray}$

(5.2)

Finally, the result easily follows by equating the coefficients of $\tau ^{p}$ on the right-hand side of Eqs (5.1) and (5.2).

Theorem 17. Let $\alpha, \beta \in \mathbb{Z}$ with $p\in \mathbb{N}_{0}$ , Then,

$\begin{equation*} \sum\limits_{q = 0}^{p}\binom{p}{q}\beta ^{q}\alpha ^{p-q}\sum\limits_{\sigma = 0}^{\alpha -1}\sum\limits_{\rho = 0}^{\beta -1}(-1)^{\sigma +\rho }{}_{L}G_{p-q, \lambda }(u, v\beta +\frac{\beta }{\alpha }\sigma +\rho )G_{q, \lambda }(z\alpha ) \end{equation*}$

$\begin{equation*} = \sum\limits_{q = 0}^{p}\binom{p}{q}\alpha ^{p}\beta ^{p-q}\sum\limits_{\sigma = 0}^{\beta -1}\sum\limits_{\rho = 0}^{\alpha -1}(-1)^{\sigma +\rho }{}_{L}G_{p-q, \lambda }(u, v\alpha +\frac{\beta }{\alpha }\sigma +\rho )G_{q, \lambda }(z\beta ) \mathit{\text{.}} \end{equation*}$

Proof. Let

$\begin{equation*} g(\tau) = \frac{\left\lbrace 2\log(1+\lambda)^{\frac{\alpha}{\lambda} }\right\rbrace}{(e^{\alpha\tau}+1)^{2}}\frac{\left\lbrace 2\log(1+\lambda)^{ \frac{\beta}{\lambda}}\right\rbrace}{(e^{\beta\tau}+1)^{2}} e^{(\alpha\beta\tau+1)^{2}} e^{(\alpha\beta)(v+z)\tau}[Cs_{0}(u\tau)]. \end{equation*}$

Considering $g(\tau)$ in two forms. Firstly,

$\begin{align*} g(\tau)& = \frac{\left\lbrace2\log(1+\lambda)^{\frac{\alpha}{\lambda} }\right\rbrace}{e^{\alpha\tau}+1}e^{\alpha\beta v\tau}C_{o}(u\tau) \left( \frac{e^{\alpha\beta\tau}+1}{e^{\beta\tau}+1}\right) \notag \\ &\times\frac{\left\lbrace2\log(1+\lambda)^{\frac{\beta}{\lambda} }\right\rbrace}{e^{\beta\tau}+1} e^{\alpha\beta z\tau} \left(\frac{ e^{\alpha\beta\tau}+1}{e^{\alpha\tau}+1}\right) \end{align*}$

$\begin{align} & = \frac{\left\{ 2\log (1+\lambda )^{\frac{\alpha }{\lambda }}\right\} }{ e^{\alpha \tau }+1}e^{\alpha \beta v\tau }C_{0}(u\tau )\left( \sum\limits_{\sigma = 0}^{\alpha -1}(-1)^{\sigma }e^{\beta \tau \sigma }\right) \\ & \times \frac{\left\{ 2\log (1+\lambda )^{\frac{\beta }{\lambda }}\right\} }{e^{\beta \tau }+1}e^{\alpha \beta \tau z}C_{0}(u\tau )\left( \sum\limits_{\rho = 0}^{\beta -1}(-1)^{\rho }e^{\alpha \tau \rho }\right) , \end{align}$

(5.3)

Secondly,

$\begin{align} & g(\tau ) \\ & = \sum\limits_{p = 0}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\binom{p}{q}\; \beta ^{q}\alpha ^{p-q}\sum\limits_{\sigma = 0}^{\alpha -1}\sum\limits_{\rho = 0}^{\beta -1}(-1)^{\sigma +\rho }{}_{L}G_{p-q, \lambda }\left( u\alpha , v\beta +\frac{\beta }{\alpha } \sigma +\rho \right) G_{q, \lambda }(\alpha z)\right\} \frac{\tau ^{p}}{p!} \\ & = \sum\limits_{p = 0}^{\infty }\left\{ \sum\limits_{q = 0}^{p}\binom{p}{q}\; \alpha ^{q}\beta ^{p-q}\sum\limits_{\sigma = 0}^{\alpha -1}\sum\limits_{\rho = 0}^{\beta -1}(-1)^{\sigma +\rho }{}_{L}G_{\sigma -\rho , \lambda }\left( u, v\alpha +\frac{\alpha }{ \beta }\sigma +\rho \right) G_{q, \lambda }(z\beta )\right\} \frac{\tau ^{p}}{ p!}.\; \; \; \; \end{align}$

(5.4)

Finally, the result straightforwardly follows by equating the coefficients of $\tau^{p}$ in Eqs (5.3) and (5.4).

We now give the following two Theorems. We omit their proofs since they follow the same technique as in the Theorems 16 and 17.

Theorem 18. Let $\alpha, \beta \in \mathbb{Z}$ and $p\in \mathbb{N}_{0}$ , Then,

$\begin{eqnarray*} &&\sum\limits_{q = 0}^{p}\binom{p}{q}\beta ^{q}\alpha ^{p-q}\sum\limits_{\sigma = 0}^{\alpha -1}\sum\limits_{\rho = 0}^{\beta -1}(-1)^{\sigma +\rho }{}_{L}G_{p-q, \lambda }\left( u, v\beta +\frac{\beta }{\alpha }\sigma \right) G_{q, \lambda }\left( z\alpha + \frac{\alpha }{\beta }\rho \right) \\ & = &\sum\limits_{q = 0}^{p}\binom{p}{q}\alpha ^{q}\beta ^{p-q}\sum\limits_{\sigma = 0}^{\beta -1}\sum\limits_{\rho = 0}^{\alpha -1}(-1)^{\sigma +\rho }{}_{L}G_{p-q, \lambda }\left( u, v\alpha +\frac{\alpha }{\beta }\sigma +\rho \right) {}_{L}G_{q, \lambda }\left( z\beta +\frac{\beta }{\alpha }\rho \right) \mathit{\text{.}} \end{eqnarray*}$

Theorem 19. Let $\alpha, \beta \in \mathbb{Z}$ and $p\in \mathbb{N}_{0}$ , Then,

$\begin{eqnarray*} &&\sum\limits_{q = 0}^{p}\binom{p}{q}\beta ^{q}\alpha ^{p-q}{}_{L}G_{p-q, \lambda }(u\beta , v\beta )\sum\limits_{\sigma = 0}^{q}\binom{q}{\sigma }T_{\sigma }(\alpha -1)G_{q-\sigma , \lambda }(u\alpha ) \\ & = &\sum\limits_{q = 0}^{p}\binom{p}{q}\beta ^{p-q}\alpha ^{q}{}_{L}G_{p-q, \lambda }(u\alpha , v\alpha )\sum\limits_{\sigma = 0}^{q}\binom{q}{\sigma }T_{\sigma }(\beta -1)G_{q-\sigma , \lambda }(u\beta ). \end{eqnarray*}$

6. Concluding remark and observation

Motivated by importance and potential for applications in certain problems in number theory, combinatorics, classical and numerical analysis and other fields of applied mathematics, various special numbers and polynomials, and their variants and generalizations have been extensively investigated (for example, see the references here and those cited therein). The results presented here, being very general, can be specialized to yield a large number of identities involving known or new simpler numbers and polynomials. For example, the case $u = 0$ of the results presented here give the corresponding ones for the generalized partially degenerate Genocchi polynomials ^[3].

Acknowledgment

The authors express their thanks to the anonymous reviewers for their valuable comments and suggestions, which help to improve the paper in the current form.

Conflict of interest

We declare that we have no conflict of interests.

References

[1]	Crowding and queuing at entrances, (2018), http://ped.fz-juelich.de/da/doku.php?id=wuptmp.
[2]	Jupedsim, (2019), https://www.jupedsim.org.
[3]	J. Adrian, M. Boltes, S. Holl, A. Sieben and A. Seyfried, Crowding and queuing in entrance scenarios: Influence of corridor width in front of bottlenecks, arXiv e-prints, arXiv: 1810.07424.
[4]	When push comes to shove: Exclusion processes with nonlocal consequences. Physica A (2015) 437: 119-129.
[5]	M. Bardi and I. Capuzzo-Dolcetta, Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations, Systems & Control: Foundations & Applications, Birkhäuser Boston, Inc., Boston, MA, 1997.
[6]	Lane formation by side-stepping. SIAM Journal on Mathematical Analysis (2016) 48: 981-1005.
[7]	Flow characteristics in a crowded transport model. Nonlinearity (2016) 29: 3528-3550.
[8]	Simulation of pedestrian dynamics using a two-dimensional cellular automaton. Physica A: Statistical Mechanics and its Applications (2001) 295: 507-525.
[9]	Distance functions and almost global solutions of eikonal equations. Communications in Partial Differential Equations (2010) 35: 391-414.
[10]	A. Corbetta, J. A. Meeusen, C.-m. Lee, R. Benzi and F. Toschi, Physics-based modeling and data representation of pairwise interactions among pedestrians, Physical Review E, 98 (2018), 062310.
[11]	E. Cristiani, B. Piccoli and A. Tosin, Multiscale Modeling of Pedestrian Dynamics, MS & A, Modeling, Simulation and Applications, 12. Springer, Cham, 2014.
[12]	On the Hughes' model for pedestrian flow: The one-dimensional case. Journal of Differential Equations (2011) 250: 1334-1362.
[13]	D. C. Duives, W. Daamen and S. Hoogendoorn, Trajectory analysis of pedestrian crowd movements at a Dutch music festival, Pedestrian and Evacuation Dynamics 2012, Springer, (2014), 151–166.
[14]	Parameter estimation for macroscopic pedestrian dynamics models from microscopic data. SIAM Journal on Applied Mathematics (2019) 79: 1475-1500.
[15]	B. Hein, Agent-Based Modelling for Crowding and Queuing in Front of Bottlenecks, Bachelor's Thesis, University of Wuppertal, 2019.
[16]	D. Helbing and P. Molnár, Social force model for pedestrian dynamics, Physical Review E, 51 (1995), 4282.
[17]	K. Hirai and K. Tarui, A simulation of the behavior of a crowd in panic, Systems and Control.
[18]	A continuum theory for the flow of pedestrians. Transportation Research Part B: Methodological (2002) 36: 507-535.
[19]	A. Johansson and D. Helbing, Analysis of empirical trajectory data of pedestrians, Pedestrian and Evacuation Dynamics 2008, (2009), 203–214.
[20]	A. Jüngel, The boundedness-by-entropy method for cross-diffusion systems, Nonlinearity, 28 (2015), 1963.
[21]	Simulation of evacuation processes using a bionics-inspired cellular automaton model for pedestrian dynamics. Physica A: Statistical Mechanics and its Applications (2002) 312: 260-276.
[22]	C. Koutschan, H. Ranetbauer, G. Regensburger and M.-T. Wolfram, Symbolic derivation of mean-field PDEs from lattice-based models, 2015 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 27–33.
[23]	O. Ladyzhenskaya, Linear and Quasilinear Elliptic Equations, ISSN, Elsevier Science, 1968.
[24]	Explicit formula for scalar nonlinear conservation laws with boundary condition. Mathematical Methods in the Applied Sciences (1988) 10: 265-287.
[25]	Explicit formula for weighted scalar nonlinear hyperbolic conservation laws. Transactions of the American Mathematical Society (1988) 308: 667-683.
[26]	C. Lehrenfeld, On a Space-Time Extended Finite Element Method for the Solution of a Class of Two-Phase Mass Transport Problems, PhD thesis, RWTH Aachen, 2015, http://publications.rwth-aachen.de/record/462743.
[27]	A. Y. Leroux, Approximation de Quelques Problèmes Hyperboliques Non-Linéaires, Thèse d'état, Rennes, 1979.
[28]	B. Maury and S. Faure, Crowds in Equations. An Introduction to the Microscopic Modeling of Crowds, Advanced Textbooks in Mathematics. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2019.
[29]	Experimental study of the behavioural mechanisms underlying self-organization in human crowds. Proceedings of The Royal Society B: Biological Sciences (2009) 276: 2755-2762.
[30]	S. Nowak and A. Schadschneider, Quantitative analysis of pedestrian counterflow in a cellular automaton model, Physical Review E, 85 (2012), 066128.
[31]	S. Okazaki, A study of pedestrian movement in architectural space, Trans. of A.I.J., 283.
[32]	Time-evolving measures and macroscopic modeling of pedestrian flow. Archive for Rational Mechanics and Analysis (2011) 199: 707-738.
[33]	Fast sweeping methods for eikonal equations on triangular meshes. SIAM J. Numerical Analysis (2007) 45: 83-107.
[34]	C. Rudloff, T. Matyus and S. Seer, Comparison of different calibration techniques on simulated data, Pedestrian and Evacuation Dynamics 2012, Springer, (2013), 657–672.
[35]	A. Schadschneider, C. Eilhardt, S. Nowak and R. Will, Towards a calibration of the floor field cellular automaton, Pedestrian and Evacuation Dynamics, (2011), 557–566.
[36]	A. Schadschneider, H. Klpfel, T. Kretz, C. Rogsch and A. Seyfried, Fundamentals of pedestrian and evacuation dynamics, IGI Global, (2009), 124–154.
[37]	Comparative study of macroscopic pedestrian models. Transportation Research Procedia (2014) 2: 477-485.
[38]	U. Weidmann, Transporttechnik der Fussgänger: Transporttechnische Eigenschaften des Fussgängerverkehrs, Schriftenreihe des IVT, IVT, 1993.
[39]	W. G. Weng, T. Chen, H. Y. Yuan and W. C. Fan, Cellular automaton simulation of pedestrian counter flow with different walk velocities, Physical Review. E, 74 (2006), 036102.
[40]	C. A. Yates, A. Parker and R. E. Baker, Incorporating pushing in exclusion-process models of cell migration, Physical Review E, 91 (2015), 052711.

This article has been cited by:

Sarker Ashraful Islam, Farhana Kabir Esheta, Md Mahir Shahriar, Dewan Hasan Ahmed, Numerical study of aerodynamic drag reduction of a circular cylinder with an inbuilt nozzle, 2024, 1, 2996-0800, 379, 10.3934/mina.2024018

Reader Comments

Your name:*

Email:*
© 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)